Kotlin
Offered By: Exercism
Course Description
Overview
Kotlin was designed and developed by JetBrains, the company behind IntelliJ. It is a language that runs on the JVM which can target versions 6+ (including the Android platform). JetBrains wanted to use a statically typed language which can remove Java boilerplate code, provide modern functional paradigms, and had seamless two-way Java interoperability with their existing codebase. The JVM already had alternate languages like Groovy and Scala but neither fit the bill with their desired criteria, so they built Kotlin.
Syllabus
- Hello World
- Two Fer
- Hamming
- Gigasecond
- Scrabble Score
- Matrix
- Difference Of Squares
- Secret Handshake
- Triangle
- Saddle Points
- Flatten Array
- Word Count
- Robot Name
- Rotational Cipher
- Bank Account
- Linked List
- Binary Search
- Pangram
- Raindrops
- Isogram
- Pig Latin
- Anagram
- Resistor Color
- Resistor Color Duo
- Rna Transcription
- Diamond
- Bob
- Beer Song
- Acronym
- Armstrong Numbers
- Resistor Color Trio
- Transpose
- Isbn Verifier
- Largest Series Product
- Luhn
- Nucleotide Count
- Phone Number
- Series
- Roman Numerals
- Leap
- Custom Set
- Space Age
- Allergies
- Meetup
- Crypto Square
- Run Length Encoding
- Scale Generator
- Wordy
- Minesweeper
- Dominoes
- Perfect Numbers
- Yacht
- Sieve
- Sum Of Multiples
- Forth
- Grains
- Robot Simulator
- Collatz Conjecture
- Kindergarten Garden
- Nth Prime
- Pascals Triangle
- Prime Factors
- Complex Numbers
- All Your Base
- Clock
- Matching Brackets
- Spiral Matrix
- Change
- Binary Search Tree
- Etl
- Grade School
- Affine Cipher
- Atbash Cipher
- Rail Fence Cipher
- Say
- Simple Cipher
- Sublist
- Diffie Hellman
- List Ops
- Zebra Puzzle
- React
- D&D Character
- Reverse String
- Darts
- Knapsack
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera