{"id":51348919,"url":"https://github.com/anhvu2889/problem-solving-practice-kotlin","last_synced_at":"2026-07-02T14:14:44.788Z","repository":{"id":285413439,"uuid":"955723775","full_name":"anhvu2889/problem-solving-practice-kotlin","owner":"anhvu2889","description":"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.","archived":false,"fork":false,"pushed_at":"2026-06-22T04:58:50.000Z","size":239,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-06-22T06:24:33.374Z","etag":null,"topics":["data-structures-and-algorithms","dsa","kotlin","leetcode","problem-solving"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/anhvu2889/","language":"Kotlin","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/anhvu2889.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-03-27T05:06:19.000Z","updated_at":"2026-06-22T04:58:54.000Z","dependencies_parsed_at":"2025-03-31T16:50:18.805Z","dependency_job_id":"fac595ee-ef12-4e7d-8f0e-954eba52b3cd","html_url":"https://github.com/anhvu2889/problem-solving-practice-kotlin","commit_stats":null,"previous_names":["crisnguyendev/problem-solving-practice-kotlin","crisnguyengl/problem-solving-practice-kotlin","anhvu2889/problem-solving-practice-kotlin"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/anhvu2889/problem-solving-practice-kotlin","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anhvu2889%2Fproblem-solving-practice-kotlin","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anhvu2889%2Fproblem-solving-practice-kotlin/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anhvu2889%2Fproblem-solving-practice-kotlin/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anhvu2889%2Fproblem-solving-practice-kotlin/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/anhvu2889","download_url":"https://codeload.github.com/anhvu2889/problem-solving-practice-kotlin/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anhvu2889%2Fproblem-solving-practice-kotlin/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35050418,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-07-02T02:00:06.368Z","response_time":173,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["data-structures-and-algorithms","dsa","kotlin","leetcode","problem-solving"],"created_at":"2026-07-02T14:14:39.652Z","updated_at":"2026-07-02T14:14:44.777Z","avatar_url":"https://github.com/anhvu2889.png","language":"Kotlin","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode Practice in Kotlin\n\nWelcome to my LeetCode practice repository. 👋\n\nThis 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.\n\n## 🚀 About This Repository\n\nThis repository is dedicated to practicing LeetCode problems through structured topics, curated problem lists, and daily challenges.\n\nThe focus is on:\n\n- Building a consistent problem-solving habit\n- Improving logical thinking\n- Practicing Kotlin implementation\n- Understanding common data structures and algorithms\n- Recognizing patterns across similar LeetCode problems\n- Revisiting solutions over time to write cleaner and simpler code\n\nProblems are organized by curated lists and topic-based folders, including **Blind 75**, **Top 150**, and dedicated topic practice.\n\n## 🎯 Goals\n\n- Keep a daily coding habit\n- Strengthen problem-solving skills\n- Practice Kotlin through hands-on coding\n- Learn and review common algorithmic patterns\n- Improve clarity when analyzing problems\n- Build a personal collection of clean and reusable solutions\n\n## 🧠 Practice Approach\n\nFor each problem, I try to focus on:\n\n- Understanding the problem clearly\n- Identifying edge cases\n- Starting from a simple approach\n- Finding a cleaner or more efficient solution\n- Recognizing the underlying pattern\n- Writing readable Kotlin code\n- Reviewing time and space complexity\n- Revisiting similar problems to reinforce learning\n\n## 📚 Topics Covered\n\nThe repo is organized by common data structure and algorithm topics:\n\n- Array\n- Matrix\n- Two Pointers\n- Fast and Slow Pointers\n- Sliding Window\n- Merge Intervals\n- Linked List\n- Heap\n- K-way Merge\n- Top K Elements\n- Binary Search\n- Backtracking\n- Subsets\n- Greedy\n- Dynamic Programming\n- Bitwise Manipulation\n- Graphs\n- Tree Depth-First Search\n- Tree Breadth-First Search\n- Trie\n- Hash Maps\n- Union Find\n- Math and Geometry\n\n## 📂 Project Structure\n\n```text\nroot/\n├── src/\n│   ├── blind75/\n│   ├── top150/\n│   │   ├── array/\n│   │   ├── matrix/\n│   │   └── twopointer/\n│   └── topic/\n│       ├── array/\n│       ├── backtracking/\n│       ├── binarysearch/\n│       ├── bitwise/\n│       ├── dp/\n│       ├── fastslowpointer/\n│       ├── greedy/\n│       ├── heap/\n│       ├── kwaymerge/\n│       ├── linkedlist/\n│       ├── matrix/\n│       ├── mergeinterval/\n│       ├── slidingwindow/\n│       ├── subset/\n│       ├── topkelement/\n│       └── twopointer/\n├── README.md\n└── build files\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanhvu2889%2Fproblem-solving-practice-kotlin","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanhvu2889%2Fproblem-solving-practice-kotlin","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanhvu2889%2Fproblem-solving-practice-kotlin/lists"}