This project is a curated and growing set of data structure and algorithm problems implemented in Kotlin.

✅ Clean & idiomatic Kotlin solutions

🧠 Problem-solving strategies explained inline

📦 Structured for real-world interview prep (FAANG, Delivery Hero, Zalando, etc.)

🔁 Patterns include arrays, trees, recursion, graphs, DP, and more

🖥️ Requirements Kotlin 1.8+ IntelliJ IDEA or any Kotlin-friendly IDE JDK 17+

Example using Kotlin CLI kotlinc arrays/TwoSum.kt -include-runtime -d out.jar java -jar out.jar You can also run each file inside IntelliJ using the green ▶️ run button

• Arrays & HashMaps
• Strings & Parsing
• Linked Lists
• Trees & Recursion
• Dynamic Programming
• Sliding Window
• Graph Traversal (DFS/BFS)
• Backtracking
• Sorting & Searching

Pull requests are welcome! Feel free to open an issue for:

• Bugs
• Suggestions
• Additional problems or optimization strategies