https://github.com/anhvu2889/problem-solving-practice-kotlin
A Kotlin-based LeetCode practice repository focused on daily problem solving, DSA fundamentals, and pattern-based learning through Blind 75, Top 150, and topic-based exercises.
https://github.com/anhvu2889/problem-solving-practice-kotlin
data-structures-and-algorithms dsa kotlin leetcode problem-solving
Last synced: about 10 hours ago
JSON representation
A Kotlin-based LeetCode practice repository focused on daily problem solving, DSA fundamentals, and pattern-based learning through Blind 75, Top 150, and topic-based exercises.
- Host: GitHub
- URL: https://github.com/anhvu2889/problem-solving-practice-kotlin
- Owner: anhvu2889
- License: mit
- Created: 2025-03-27T05:06:19.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2026-06-22T04:58:50.000Z (11 days ago)
- Last Synced: 2026-06-22T06:24:33.374Z (11 days ago)
- Topics: data-structures-and-algorithms, dsa, kotlin, leetcode, problem-solving
- Language: Kotlin
- Homepage: https://leetcode.com/u/anhvu2889/
- Size: 233 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# LeetCode Practice in Kotlin
Welcome to my LeetCode practice repository. 👋
This repo is where I practice **Data Structures and Algorithms in Kotlin** through LeetCode problems as a way to keep a consistent learning habit, sharpen analytical thinking, and enjoy solving coding challenges.
## 🚀 About This Repository
This repository is dedicated to practicing LeetCode problems through structured topics, curated problem lists, and daily challenges.
The focus is on:
- Building a consistent problem-solving habit
- Improving logical thinking
- Practicing Kotlin implementation
- Understanding common data structures and algorithms
- Recognizing patterns across similar LeetCode problems
- Revisiting solutions over time to write cleaner and simpler code
Problems are organized by curated lists and topic-based folders, including **Blind 75**, **Top 150**, and dedicated topic practice.
## 🎯 Goals
- Keep a daily coding habit
- Strengthen problem-solving skills
- Practice Kotlin through hands-on coding
- Learn and review common algorithmic patterns
- Improve clarity when analyzing problems
- Build a personal collection of clean and reusable solutions
## 🧠Practice Approach
For each problem, I try to focus on:
- Understanding the problem clearly
- Identifying edge cases
- Starting from a simple approach
- Finding a cleaner or more efficient solution
- Recognizing the underlying pattern
- Writing readable Kotlin code
- Reviewing time and space complexity
- Revisiting similar problems to reinforce learning
## 📚 Topics Covered
The repo is organized by common data structure and algorithm topics:
- Array
- Matrix
- Two Pointers
- Fast and Slow Pointers
- Sliding Window
- Merge Intervals
- Linked List
- Heap
- K-way Merge
- Top K Elements
- Binary Search
- Backtracking
- Subsets
- Greedy
- Dynamic Programming
- Bitwise Manipulation
- Graphs
- Tree Depth-First Search
- Tree Breadth-First Search
- Trie
- Hash Maps
- Union Find
- Math and Geometry
## 📂 Project Structure
```text
root/
├── src/
│ ├── blind75/
│ ├── top150/
│ │ ├── array/
│ │ ├── matrix/
│ │ └── twopointer/
│ └── topic/
│ ├── array/
│ ├── backtracking/
│ ├── binarysearch/
│ ├── bitwise/
│ ├── dp/
│ ├── fastslowpointer/
│ ├── greedy/
│ ├── heap/
│ ├── kwaymerge/
│ ├── linkedlist/
│ ├── matrix/
│ ├── mergeinterval/
│ ├── slidingwindow/
│ ├── subset/
│ ├── topkelement/
│ └── twopointer/
├── README.md
└── build files