{"id":51348882,"url":"https://github.com/anhvu2889/problem-solving-practice-java","last_synced_at":"2026-07-02T14:14:40.557Z","repository":{"id":257951586,"uuid":"830827168","full_name":"anhvu2889/problem-solving-practice-java","owner":"anhvu2889","description":"A Java-focused repository to master algorithms, data structures, and problem-solving techniques. Ideal for coding interview preparation and competitive programming challenges.","archived":false,"fork":false,"pushed_at":"2025-04-12T02:05:12.000Z","size":3212,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-01-24T07:03:12.568Z","etag":null,"topics":["algorithms","big-o-interview","codeforces","data-structures","grokking-coding-interview","java","leetcode","problem"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"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":null,"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}},"created_at":"2024-07-19T04:55:39.000Z","updated_at":"2025-04-18T19:38:27.000Z","dependencies_parsed_at":"2025-04-14T13:27:52.918Z","dependency_job_id":null,"html_url":"https://github.com/anhvu2889/problem-solving-practice-java","commit_stats":null,"previous_names":["crisnguyenvn/problem-solving-practice","crisnguyendev/problem-solving-practice","crisnguyendev/problem-solving-practice-java","crisnguyengl/problem-solving-practice-java","anhvu2889/problem-solving-practice-java"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/anhvu2889/problem-solving-practice-java","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anhvu2889%2Fproblem-solving-practice-java","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anhvu2889%2Fproblem-solving-practice-java/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anhvu2889%2Fproblem-solving-practice-java/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anhvu2889%2Fproblem-solving-practice-java/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/anhvu2889","download_url":"https://codeload.github.com/anhvu2889/problem-solving-practice-java/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anhvu2889%2Fproblem-solving-practice-java/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35050417,"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":["algorithms","big-o-interview","codeforces","data-structures","grokking-coding-interview","java","leetcode","problem"],"created_at":"2026-07-02T14:14:35.481Z","updated_at":"2026-07-02T14:14:40.542Z","avatar_url":"https://github.com/anhvu2889.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Problem Solving Practice in Java\n\nWelcome to my problem-solving practice repository. 👋\n\nThis repository is where I practice **Data Structures and Algorithms in Java**, mainly through **Codeforces-style problems** and structured lessons from **Big-O Coding courses**.\n\nThe focus is not only on solving algorithmic problems, but also on improving practical problem-solving skills such as reading input carefully, handling file-based data, parsing problem statements, choosing the right data structures, and writing efficient Java solutions.\n\n## 🚀 About This Repository\n\nThis repository is dedicated to practicing algorithmic problem solving through structured topics, hands-on exercises, and competitive-programming-style challenges.\n\nThe practice includes:\n\n- Codeforces-style problems\n- Big-O Coding course exercises\n- Topic-based data structures and algorithms\n- Problems that require input/output handling\n- Problems that involve reading, parsing, and processing data\n- Java implementation practice\n\nCompared with standard curated problem lists, this repository puts more focus on problem statement analysis, data handling, edge cases, and implementation details.\n\n## 🎯 Goals\n\n- Keep a consistent problem-solving habit\n- Strengthen algorithmic thinking\n- Practice Java implementation\n- Improve reading and parsing of problem statements\n- Handle input/output and file-based data correctly\n- Learn common data structures and algorithms through structured topics\n- Build efficient and optimized solutions\n- Review and improve solutions over time\n\n## 🧠 Practice Approach\n\nFor each problem, I try to focus on:\n\n- Understanding the problem statement carefully\n- Identifying input/output requirements\n- Parsing data correctly\n- Thinking through a simple approach first\n- Choosing the right data structure or algorithm\n- Handling edge cases\n- Writing clean and efficient Java code\n- Reviewing time and space complexity\n- Revisiting similar problems to reinforce learning\n\n## 📚 Topics Covered\n\nThe repo is organized around core data structure and algorithm topics:\n\n- Algorithmic Complexity\n- Data Abstraction\n- Array and String\n- Sorting\n- Prefix Sum\n- Two Pointers\n- Sliding Window\n- Fast and Slow Pointers\n- Binary Search\n- Stack and Queue\n- Linked List\n- Recursion\n- Backtracking\n- Bit Manipulation\n- Greedy\n- Divide and Conquer\n- Hash Table\n- Tree\n- Binary Search Tree\n- Heap / Priority Queue\n- Trie\n- Graph\n- Graph Traversal\n- Shortest Path\n- Minimum Spanning Tree\n- Disjoint Set Union\n- Dynamic Programming\n- String Algorithms\n- Segment Tree\n- Number Theory\n- Math and Geometry\n\n## 📂 Project Structure\n\n```text\nroot/\n├── DSA/\n│   ├── Abstraction/\n│   ├── BellmanFord/\n│   ├── BinarySearch/\n│   ├── BinarySearchTree/\n│   ├── BreadthFirstSearch/\n│   ├── Complexity/\n│   ├── DepthFirstSearch/\n│   ├── Dijkstra/\n│   ├── DisjointSetUnion/\n│   ├── DynamicArrayAndString.SuffixStructures/\n│   ├── DynamicProgramming.CoinChange/\n│   ├── FastAndSlowPointers/\n│   ├── Heap/\n│   ├── KWayMerge/\n│   ├── LinkedList/\n│   ├── MergeInterval/\n│   ├── ModifiedBinarySearch/\n│   ├── PrefixSum/\n│   ├── Prim/\n│   ├── Recursion/\n│   ├── SlidingWindow/\n│   ├── Sorting/\n│   ├── StackAndQueue/\n│   ├── TopKthElements/\n│   ├── Trie/\n│   ├── TwoHeap/\n│   └── TwoPointers/\n├── README.md\n└── build files\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanhvu2889%2Fproblem-solving-practice-java","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanhvu2889%2Fproblem-solving-practice-java","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanhvu2889%2Fproblem-solving-practice-java/lists"}