Daily coding challenges solved in Python and Kotlin.
coding-challenges/
├── python/ # Python solutions
├── kotlin/ # Kotlin solutions
└── README.md
| Problem | Description |
|---|---|
| fibonacci.py | Generate the first n Fibonacci numbers |
| fizz_buzz.py | FizzBuzz for numbers 1 through n |
| binary_search.py | Binary search with O(log n) two-pointer approach |
| linked_list.py | Singly linked list with append, delete, search, reverse |
| stack_queue.py | Stack and queue implementations from scratch |
| binary_tree_bfs.py | Binary tree level-order traversal using BFS |
| valid_parentheses.py | Valid parentheses check using a stack |
| [lru_cache.py] (python/lru_cache.py) | Least recently used cache |
| Problem | Description |
|---|---|
| pascals_triangle.kt | Generate n rows of Pascal's Triangle |
| two_sum.kt | Two sum using hash map for O(n) solution |
| palindrome.kt | Palindrome check with two-pointer and one-liner approaches |
| reverse_linked_list.kt | Singly linked list with in-place reversal |
Solved as part of ongoing practice alongside BSc Computer Science at the University of Leeds.