Kotlin DSA Series — Complete Index
Kotlin DSA Series — Complete Index
A complete Data Structures & Algorithms series written in idiomatic Kotlin. Not Java translated to .kt — real Kotlin the way it’s meant to be written.
🟢 Phase 1 — Arrays
| LC # | Problem | Difficulty | Post |
|---|---|---|---|
| #1 | Two Sum | Easy | Read → |
| #121 | Best Time to Buy and Sell Stock | Easy | Read → |
| #217 | Contains Duplicate | Easy | Read → |
| #238 | Product of Array Except Self | Medium | Coming Soon |
| #53 | Maximum Subarray | Medium | Coming Soon |
🔵 Phase 2 — Strings
| LC # | Problem | Difficulty | Post |
|---|---|---|---|
| #242 | Valid Anagram | Easy | Coming Soon |
| #125 | Valid Palindrome | Easy | Coming Soon |
| #3 | Longest Substring Without Repeating Characters | Medium | Coming Soon |
🟠 Phase 3 — Linked List
| LC # | Problem | Difficulty | Post |
|---|---|---|---|
| #206 | Reverse Linked List | Easy | Coming Soon |
| #21 | Merge Two Sorted Lists | Easy | Coming Soon |
| #141 | Linked List Cycle | Easy | Coming Soon |
🔴 Phase 4 — Trees
| LC # | Problem | Difficulty | Post |
|---|---|---|---|
| #226 | Invert Binary Tree | Easy | Coming Soon |
| #104 | Maximum Depth of Binary Tree | Easy | Coming Soon |
| #98 | Validate Binary Search Tree | Medium | Coming Soon |
🟣 Phase 5 — Graphs
🔶 Phase 6 — Dynamic Programming
| LC # | Problem | Difficulty | Post |
|---|---|---|---|
| #70 | Climbing Stairs | Easy | Coming Soon |
| #198 | House Robber | Medium | Coming Soon |
| #322 | Coin Change | Medium | Coming Soon |
This index is updated every time a new post is published. Bookmark this page.
This post is licensed under CC BY 4.0 by the author.