{"id":18258879,"url":"https://github.com/akazad13/leetcode","last_synced_at":"2025-04-08T23:26:58.456Z","repository":{"id":245473004,"uuid":"814256915","full_name":"akazad13/leetcode","owner":"akazad13","description":"I will provide explanations for LeetCode problems in this repository.","archived":false,"fork":false,"pushed_at":"2024-07-27T04:22:38.000Z","size":208,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-14T18:20:51.126Z","etag":null,"topics":["cpp","graph-algorithms","greedy-algorithms","leetcode","leetcode-cpp","leetcode-solutions","linked-list","sliding-window"],"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/akazad13.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":"2024-06-12T16:35:08.000Z","updated_at":"2024-07-27T04:22:40.000Z","dependencies_parsed_at":"2024-06-22T09:26:47.080Z","dependency_job_id":"63e29fbe-34d0-4537-a211-6b92034cd33c","html_url":"https://github.com/akazad13/leetcode","commit_stats":null,"previous_names":["akazad13/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akazad13%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akazad13%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akazad13%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akazad13%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/akazad13","download_url":"https://codeload.github.com/akazad13/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247944901,"owners_count":21022651,"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":["cpp","graph-algorithms","greedy-algorithms","leetcode","leetcode-cpp","leetcode-solutions","linked-list","sliding-window"],"created_at":"2024-11-05T10:35:12.412Z","updated_at":"2025-04-08T23:26:58.430Z","avatar_url":"https://github.com/akazad13.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode Problems Solution\n\n## Daily Challenges\n1. [2037. Minimum Number of Moves to Seat Everyone](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2037.%20Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone.md)\n2. [945. Minimum Increment to Make Array Unique](https://github.com/akazad13/leetcode/blob/main/daily-challenges/945.%20Minimum%20Increment%20to%20Make%20Array%20Unique.md)\n3. [502. IPO](https://github.com/akazad13/leetcode/blob/main/daily-challenges/502.%20IPO.md)\n4. [330. Patching Array](https://github.com/akazad13/leetcode/blob/main/daily-challenges/330.%20Patching%20Array.md)\n5. [633. Sum of Square Numbers](https://github.com/akazad13/leetcode/blob/main/daily-challenges/633.%20Sum%20of%20Square%20Numbers.md)\n6. [826. Most Profit Assigning Work](https://github.com/akazad13/leetcode/blob/main/daily-challenges/826.%20Most%20Profit%20Assigning%20Work.md)\n7. [1482. Minimum Number of Days to Make m Bouquets](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1482.%20Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets.md)\n8. [1552. Magnetic Force Between Two Balls](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1552.%20Magnetic%20Force%20Between%20Two%20Balls.md)\n9. [1052. Grumpy Bookstore Owner](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1052.%20Grumpy%20Bookstore%20Owner.md)\n10. [1248. Count Number of Nice Subarrays](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1248.%20Count%20Number%20of%20Nice%20Subarrays.md) :soon:\n11. [1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1438.%20Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit.md)\n12. [995. Minimum Number of K Consecutive Bit Flips](https://github.com/akazad13/leetcode/blob/main/daily-challenges/995.%20Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips.md) :soon:\n13. [1038. Binary Search Tree to Greater Sum Tree](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1038.%20Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree.md)\n14. [1382. Balance a Binary Search Tree](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1382.%20Balance%20a%20Binary%20Search%20Tree.md)\n15. [1791. Find Center of Star Graph](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1791.%20Find%20Center%20of%20Star%20Graph.md)\n16. [2285. Maximum Total Importance of Roads](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2285.%20Maximum%20Total%20Importance%20of%20Roads.md)\n17. [2192. All Ancestors of a Node in a Directed Acyclic Graph](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2192.%20All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph.md)\n18. [1579. Remove Max Number of Edges to Keep Graph Fully Traversable](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1579.%20Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable.md)\n19. [1550. Three Consecutive Odds](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1550.%20Three%20Consecutive%20Odds.md)\n20. [350. Intersection of Two Arrays II](https://github.com/akazad13/leetcode/blob/main/daily-challenges/350.%20Intersection%20of%20Two%20Arrays%20II.md)\n21. [1509. Minimum Difference Between Largest and Smallest Value in Three Moves](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1509.%20Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves.md)\n22. [2181. Merge Nodes in Between Zeros](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2181.%20Merge%20Nodes%20in%20Between%20Zeros.md)\n23. [2058. Find the Minimum and Maximum Number of Nodes Between Critical Points](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2058.%20Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points.md)\n24. [2582. Pass the Pillow](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2582.%20Pass%20the%20Pillow.md)\n25. [1518. Water Bottles](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1518.%20Water%20Bottles.md)\n26. [1823. Find the Winner of the Circular Game](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game.md)\n27. [1701. Average Waiting Time](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1701.%20Average%20Waiting%20Time.md)\n28. [1598. Crawler Log Folder](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1598.%20Crawler%20Log%20Folder.md)\n29. [1190. Reverse Substrings Between Each Pair of Parentheses](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1190.%20Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses.md)\n30. [1717. Maximum Score From Removing Substrings](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1717.%20Maximum%20Score%20From%20Removing%20Substrings.md) :soon:\n31. [2751. Robot Collisions](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2751.%20Robot%20Collisions.md) :soon:\n32. [726. Number of Atoms](https://github.com/akazad13/leetcode/blob/main/daily-challenges/726.%20Number%20of%20Atoms.md) :soon:\n33. [2196. Create Binary Tree From Descriptions](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2196.%20Create%20Binary%20Tree%20From%20Descriptions.md) :soon:\n34. [2096. Step-By-Step Directions From a Binary Tree Node to Another](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2096.%20Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another.md) :soon:\n35. [912. Sort an Array]()\n36. [1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1334.%20Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance.md)\n37. [2976. Minimum Cost to Convert String I](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2976.%20Minimum%20Cost%20to%20Convert%20String%20I.md)\n\n## Grind75 Solution\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fakazad13%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fakazad13%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fakazad13%2Fleetcode/lists"}