easy 25
- Intervals: Meeting Rooms — Kotlin Solution
- 1-D DP: Min Cost Climbing Stairs — Kotlin Solution
- 1-D DP: Climbing Stairs — Kotlin Solution
- Heap: Last Stone Weight — Kotlin Solution
- Heap: Kth Largest Element In a Stream — Kotlin Solution
- Trees: Subtree of Another Tree — Kotlin Solution
- Trees: Same Tree — Kotlin Solution
- Trees: Maximum Depth of Binary Tree — Kotlin Solution
- Trees: Invert Binary Tree — Kotlin Solution
- Trees: Diameter of Binary Tree — Kotlin Solution
- Trees: Balanced Binary Tree — Kotlin Solution
- Sliding Window: Best Time to Buy And Sell Stock — Kotlin Solution
- Binary Search: Binary Search — Kotlin Solution
- Stack: Valid Parentheses — Kotlin Solution
- Two Pointers: Valid Palindrome — Kotlin Solution
- Arrays: Valid Anagram — Kotlin Solution
- Trees: Maximum Depth of Binary Tree — Kotlin Solution
- Trees: Invert Binary Tree — Kotlin Solution
- Dynamic Programming: Climbing Stairs — Kotlin Solution
- Linked List: Reverse Linked List — Kotlin Solution
- Linked List: Merge Two Sorted Lists — Kotlin Solution
- Linked List: Linked List Cycle — Kotlin Solution
- Arrays: Two Sum — Kotlin Solution
- Arrays: Contains Duplicate — Kotlin Solution
- Arrays: Best Time to Buy and Sell Stock — Kotlin Solution