Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/akazad13/leetcode
I will provide explanations for LeetCode problems in this repository.
https://github.com/akazad13/leetcode
cpp graph-algorithms greedy-algorithms leetcode leetcode-cpp leetcode-solutions linked-list sliding-window
Last synced: 25 days ago
JSON representation
I will provide explanations for LeetCode problems in this repository.
- Host: GitHub
- URL: https://github.com/akazad13/leetcode
- Owner: akazad13
- License: mit
- Created: 2024-06-12T16:35:08.000Z (7 months ago)
- Default Branch: main
- Last Pushed: 2024-07-27T04:22:38.000Z (6 months ago)
- Last Synced: 2024-11-05T10:47:54.142Z (2 months ago)
- Topics: cpp, graph-algorithms, greedy-algorithms, leetcode, leetcode-cpp, leetcode-solutions, linked-list, sliding-window
- Language: C++
- Homepage:
- Size: 203 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# LeetCode Problems Solution
## Daily Challenges
1. [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)
2. [945. Minimum Increment to Make Array Unique](https://github.com/akazad13/leetcode/blob/main/daily-challenges/945.%20Minimum%20Increment%20to%20Make%20Array%20Unique.md)
3. [502. IPO](https://github.com/akazad13/leetcode/blob/main/daily-challenges/502.%20IPO.md)
4. [330. Patching Array](https://github.com/akazad13/leetcode/blob/main/daily-challenges/330.%20Patching%20Array.md)
5. [633. Sum of Square Numbers](https://github.com/akazad13/leetcode/blob/main/daily-challenges/633.%20Sum%20of%20Square%20Numbers.md)
6. [826. Most Profit Assigning Work](https://github.com/akazad13/leetcode/blob/main/daily-challenges/826.%20Most%20Profit%20Assigning%20Work.md)
7. [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)
8. [1552. Magnetic Force Between Two Balls](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1552.%20Magnetic%20Force%20Between%20Two%20Balls.md)
9. [1052. Grumpy Bookstore Owner](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1052.%20Grumpy%20Bookstore%20Owner.md)
10. [1248. Count Number of Nice Subarrays](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1248.%20Count%20Number%20of%20Nice%20Subarrays.md) :soon:
11. [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)
12. [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:
13. [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)
14. [1382. Balance a Binary Search Tree](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1382.%20Balance%20a%20Binary%20Search%20Tree.md)
15. [1791. Find Center of Star Graph](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1791.%20Find%20Center%20of%20Star%20Graph.md)
16. [2285. Maximum Total Importance of Roads](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2285.%20Maximum%20Total%20Importance%20of%20Roads.md)
17. [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)
18. [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)
19. [1550. Three Consecutive Odds](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1550.%20Three%20Consecutive%20Odds.md)
20. [350. Intersection of Two Arrays II](https://github.com/akazad13/leetcode/blob/main/daily-challenges/350.%20Intersection%20of%20Two%20Arrays%20II.md)
21. [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)
22. [2181. Merge Nodes in Between Zeros](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2181.%20Merge%20Nodes%20in%20Between%20Zeros.md)
23. [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)
24. [2582. Pass the Pillow](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2582.%20Pass%20the%20Pillow.md)
25. [1518. Water Bottles](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1518.%20Water%20Bottles.md)
26. [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)
27. [1701. Average Waiting Time](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1701.%20Average%20Waiting%20Time.md)
28. [1598. Crawler Log Folder](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1598.%20Crawler%20Log%20Folder.md)
29. [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)
30. [1717. Maximum Score From Removing Substrings](https://github.com/akazad13/leetcode/blob/main/daily-challenges/1717.%20Maximum%20Score%20From%20Removing%20Substrings.md) :soon:
31. [2751. Robot Collisions](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2751.%20Robot%20Collisions.md) :soon:
32. [726. Number of Atoms](https://github.com/akazad13/leetcode/blob/main/daily-challenges/726.%20Number%20of%20Atoms.md) :soon:
33. [2196. Create Binary Tree From Descriptions](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2196.%20Create%20Binary%20Tree%20From%20Descriptions.md) :soon:
34. [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:
35. [912. Sort an Array]()
36. [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)
37. [2976. Minimum Cost to Convert String I](https://github.com/akazad13/leetcode/blob/main/daily-challenges/2976.%20Minimum%20Cost%20to%20Convert%20String%20I.md)## Grind75 Solution