{"id":24772531,"url":"https://github.com/dominiks01/leetcode","last_synced_at":"2025-07-18T12:38:35.082Z","repository":{"id":274619239,"uuid":"919667275","full_name":"dominiks01/leetcode","owner":"dominiks01","description":"Daily Leetcode Progress Tracker. ","archived":false,"fork":false,"pushed_at":"2025-01-29T09:58:54.000Z","size":35,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-20T07:49:50.123Z","etag":null,"topics":["algorithms-and-data-structures","c","cpp","learning","leetcode"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/dominiks01/","language":"C","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/dominiks01.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":"2025-01-20T19:31:39.000Z","updated_at":"2025-01-29T09:58:38.000Z","dependencies_parsed_at":"2025-01-28T12:28:04.533Z","dependency_job_id":"5b73b22a-e2cf-4dec-9f61-632368cc7d69","html_url":"https://github.com/dominiks01/leetcode","commit_stats":null,"previous_names":["dominiks01/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/dominiks01/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dominiks01%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dominiks01%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dominiks01%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dominiks01%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dominiks01","download_url":"https://codeload.github.com/dominiks01/leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dominiks01%2Fleetcode/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":264740398,"owners_count":23656774,"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-and-data-structures","c","cpp","learning","leetcode"],"created_at":"2025-01-29T04:23:15.342Z","updated_at":"2025-07-11T05:37:15.941Z","avatar_url":"https://github.com/dominiks01.png","language":"C","readme":"## Leetcode problems \n\n| LeetCode | Code | Description | Solution | Code | \n| -------- | ---- | ---- | ---------- | --- |\n| [3sum-closest](https://leetcode.com/problems/3sum-closest/description/) | 16 |Find Three intigers in `array` such that the sum is colosest to `target` | [C](./16/main.c) | Iterating over array + Two Pointers O(N\u003csup\u003e2\u003c/sup\u003e) | \n| [4sum](https://leetcode.com/problems/4sum/description/) | 18 | Find all the unique quadruplets `nums[a]`, `nums[b]`, `nums[c]`, `nums[d]` such that `nums[a] + nums[b] + nums[c] + nums[d] == target` |  [C](./18/main.c) |Double-loop over array + Two Pointers O(N\u003csup\u003e3\u003c/sup\u003e) |\n| [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | 24 |Given a linked list, swap every two adjacent nodes and return its head. | [C](./24/main.c) |Simple Linked List Swap|\n| [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | 29 |Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator.| [C](./29/main.c) |Bit Manipulation O(log(a)) Time and O(1) Space |\n| [Min Stack](https://leetcode.com/problems/min-stack/description/) | 155 |Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.| [C++](./155/main.cpp) | State Encoding. Each new min-val is encoded as: `2 * new-min-value - min-val`, and retrived in same way: `pop()` -\u003e `if(stack.top() \u003c min-value)` -\u003e `min-val = 2 * min-val - stack.top()` |\n| [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii/description/) | 407 | Given an `m x n` integer matrix heightMap representing the height of each unit cell in a `2D` elevation map, return the volume of water it can trap after raining | [C++](./407/main.cpp) | MinHeap, water bounded with min values. |\n| [Redundant Connection](https://leetcode.com/problems/redundant-connection/) | 684 | Return an edge that can be removed so that the resulting graph is a tree of n nodes. If there are multiple answers, return the answer that occurs last in the input. | [C++](./684/main.cpp) | Kruskal MST |\n| [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states/description/) | 802 | There is a directed graph of n nodes with each node labeled from 0 to n - 1. The graph is represented by a 0-indexed 2D integer array graph where graph[i] is an integer array of nodes adjacent to node i, meaning there is an edge from node i to each node in graph[i]. | [C++](./802/main.cpp) | Topological Sort on reversed Graph |\n| [Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/description/) | 1267 | You are given a map of a server center, represented as a m * n integer matrix grid, where 1 means that on that cell there is a server and 0 means that it is no server. Two servers are said to communicate if they are on the same row or on the same column. | [C++](./1267/main.cpp) | Finding isolated island (i is isolated if row[i].count() == 1 \u0026\u0026 col[i].count() == 1) |\n| [Minimum Cost to Make at Least One Valid Path in a Grid](https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/description/) | 1368 | You will initially start at the upper left cell (0, 0). A valid path in the grid is a path that starts from the upper left cell (0, 0) and ends at the bottom-right cell (m - 1, n - 1) following the signs on the grid. The valid path does not have to be the shortest. | [C++](./1368/main.cpp) | Dijkstra Algorithm with 'virtual' edges with cost 1 where virtual means that edge was not in the graph at the begining |\n| [Course Schedule IV](https://leetcode.com/problems/course-schedule-iv/) | 1462 | There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course ai first if you want to take course bi. | [C++](./1462/main.cpp) | Topological sort with Prerequisites propagation |\n| [Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/description/) | 1765 | Return an integer matrix height of size m x n where height[i][j] is cell (i, j)'s height. If there are multiple solutions, return any of them. | [C++](./1765/main.cpp) | - |\n| [Grid Game](https://leetcode.com/problems/grid-game/) | 2017 | You are given a 0-indexed 2D array grid of size 2 x n, where grid[r][c] represents the number of points at position (r, c) on the matrix. Two robots are playing a game on this matrix. The first robot wants to minimize the number of points collected by the second robot. | [C++](./2017/main.cpp) | Two pointer sum maximizing (first row vs second row) |\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdominiks01%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdominiks01%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdominiks01%2Fleetcode/lists"}