{"id":20169750,"url":"https://github.com/razimantv/leetcode-solutions","last_synced_at":"2025-04-09T11:12:02.955Z","repository":{"id":58094684,"uuid":"529069892","full_name":"razimantv/leetcode-solutions","owner":"razimantv","description":"My solutions to Leetcode Problems","archived":false,"fork":false,"pushed_at":"2024-10-19T04:38:04.000Z","size":3636,"stargazers_count":85,"open_issues_count":0,"forks_count":6,"subscribers_count":5,"default_branch":"main","last_synced_at":"2024-10-19T07:20:27.941Z","etag":null,"topics":["algorithms","competitive-programming","data-structures","leetcode"],"latest_commit_sha":null,"homepage":"","language":"C++","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/razimantv.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}},"created_at":"2022-08-26T01:12:06.000Z","updated_at":"2024-10-19T04:38:07.000Z","dependencies_parsed_at":"2023-10-12T17:58:38.243Z","dependency_job_id":"984ee5d0-c569-42ee-8aeb-b09a4bf53a40","html_url":"https://github.com/razimantv/leetcode-solutions","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/razimantv%2Fleetcode-solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/razimantv%2Fleetcode-solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/razimantv%2Fleetcode-solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/razimantv%2Fleetcode-solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/razimantv","download_url":"https://codeload.github.com/razimantv/leetcode-solutions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248027411,"owners_count":21035594,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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","competitive-programming","data-structures","leetcode"],"created_at":"2024-11-14T01:13:38.136Z","updated_at":"2025-04-09T11:12:02.916Z","avatar_url":"https://github.com/razimantv.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode solutions\nMy topic-wise collection of LeetCode problems and solutions\n\n## Collected problems by topic\nClick on the topic collections to access subtopics, problems, and solutions\n### Algorithms\n#### Common\n* [Array scanning](/Collections/array-scanning.md)\n* [Backtracking](/Collections/backtracking.md)\n* [Binary search](/Collections/binary-search.md)\n* [Bitwise operation](/Collections/bitwise-operation.md)\n* [Brute force enumeration](/Collections/brute-force-enumeration.md)\n* [Dynamic programming](/Collections/dynamic-programming.md)\n* [Graph theory](/Collections/graph-theory.md)\n* [Greedy](/Collections/greedy.md)\n* [Mathematics](/Collections/mathematics.md)\n* [Palindrome](/Collections/palindrome.md)\n* [Prefix sums and extrema](/Collections/prefix.md)\n* [Sliding window](/Collections/sliding-window.md)\n* [Two pointers](/Collections/two-pointers.md)\n* [Sorting](/Collections/sorting.md)\n* [String](/Collections/string.md)\n#### Uncommon\n* [Binary lifting](/Collections/binary-lifting.md)\n* [Case-by-case analysis](/Collections/case-by-case-analysis.md)\n* [Divide and conquer](/Collections/divide-and-conquer.md)\n* [Heuristic optimisation](/Collections/heuristic-optimisation.md)\n* [Interval operations](/Collections/intervals.md)\n* [Meet in the middle](/Collections/meet-in-the-middle.md)\n* [Quick Select](/Collections/quick-select.md)\n### Data structures\n* [Deque](/Collections/deque.md)\n* [Disjoint set union](/Collections/disjoint-set-union.md)\n* [Hashmap](/Collections/hashmap.md)\n* [Linked list](/Collections/linked-list.md)\n* [Priority queue](/Collections/priority-queue.md)\n* [QuadTree](/Collections/quadtree.md)\n* [Queue](/Collections/queue.md)\n* [Segment tree](/Collections/segment-tree.md)\n* [Stack](/Collections/stack.md)\n* [Tree](/Collections/tree.md)\n* [Trie](/Collections/trie.md)\n* [Data structure design](/Collections/design-data-structure.md)\n### Tricks\n* [Averaging from total and count](/Collections/averaging-from-total-and-count.md)\n* [Dynamic update of left and right neighbours](/Collections/dynamic-update-of-left-and-right-neighbours.md)\n* [Offline query processing](/Collections/offline-query-processing.md)\n* [Precomputation to answer queries efficiently with delta](/Collections/precomputation-to-answer-queries-efficiently-with-delta.md)\n* [Process in unusual order](/Collections/process-in-unusual-order.md)\n* [Process multiple vectors together](/Collections/process-multiple-vectors-together.md)\n* [Range updates using prefix sum](/Collections/range-updates-using-prefix-sum.md)\n* [Search by iterative bound improvement](/Collections/search-by-iterative-bound-improvement.md)\n* [Time reversed simulation](/Collections/time-reversed-simulation.md)\n* [Unique/duplicate element finding with bizarro algorithms](/Collections/unique-duplicate-element-finding-with-bizarro-algorithms.md)\n### Problem types\n* [Concurrency](/Collections/concurrency.md)\n* [Construction](/Collections/construction.md)\n* [Counting elements in array](/Collections/counting-elements-in-array.md)\n* [Encoding and decoding](/Collections/encoding-and-decoding.md)\n* [Flattening](/Collections/flattening.md)\n* [Formatted output](/Collections/formatted-output.md)\n* [Integer operations on strings](/Collections/integer-operations-on-strings.md)\n* [Matrix](/Collections/matrix.md)\n* [Majority element](/Collections/majority-element.md)\n* [Number transformations based on mathematical rules](/Collections/number-transformations-based-on-mathematical-rules.md)\n* [Permutations](/Collections/permutation.md)\n* [Pointers](/Collections/pointers.md)\n* [Points in 2D plane](/Collections/points-in-2d-plane.md)\n* [Simple implementation](/Collections/simple-implementation.md)\n* [Two player games](/Collections/two-player-games.md)\n* [Valid subarray counting](/Collections/valid-subarray-counting.md)\n* [Unique elements in subarray](/Collections/unique-elements-in-subarray.md)\n### Other\n* [ChatGPT-generated](/Collections/chatgpt.md)\n* [Untagged problems](/Collections/untagged.md) (Help me!)\n* [Non-conforming solutions](/Collections/fraud.md)\n* [Suboptimal solutions](/Collections/suboptimal-solution.md)\n\n## Footnote\n* All are AC solutions\n* Very few will have comments, because I wrote them for myself, often during contests. But raise an issue if you want to understand more about a solution, and I will add an explanation\n* There is a small chance that a handful of solutions are not mine, because I sometimes submit solutions that my students ask me to debug. Raise an issue and I will remove it\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frazimantv%2Fleetcode-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frazimantv%2Fleetcode-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frazimantv%2Fleetcode-solutions/lists"}