Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/brenoepics/algorithm-challenges
A collection of coding challenges, can you solve them?
https://github.com/brenoepics/algorithm-challenges
algoexpert algorithms bigonotation challange collaborate github jetbrains leetcode leetcode-solutions lintcode math
Last synced: 3 months ago
JSON representation
A collection of coding challenges, can you solve them?
- Host: GitHub
- URL: https://github.com/brenoepics/algorithm-challenges
- Owner: brenoepics
- License: mit
- Created: 2024-01-26T15:04:17.000Z (12 months ago)
- Default Branch: main
- Last Pushed: 2024-04-07T17:50:50.000Z (10 months ago)
- Last Synced: 2024-04-07T18:42:42.805Z (10 months ago)
- Topics: algoexpert, algorithms, bigonotation, challange, collaborate, github, jetbrains, leetcode, leetcode-solutions, lintcode, math
- Homepage:
- Size: 12.7 KB
- Stars: 7
- Watchers: 1
- Forks: 1
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- Contributing: CONTRIBUTING.md
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
Awesome Lists containing this project
README
# Algorithm Challenges
> [!IMPORTANT]
> This repository contains a collection of coding challenges with solutions, including links to LeetCode and LintCode problems. Whether you're a beginner or an experienced coder, these challenges are designed to enhance your problem-solving skills and algorithmic thinking.## Getting Started
- Each challenge is categorized by difficulty: Easy, Medium, or Hard.
- Click on the LeetCode or LintCode links to access the problem statement and submit your solution.
- Solutions are provided in this repository (resources folder) to help you learn and compare your approach. (if missing, feel free to open an issue or pull request)
## Challenges Table| Name | Link | Difficulty | Resolution |
|------|------|------------|------------|
| 1. Two Sum | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/two-sum) | easy | [Two Sum Solution](https://leetcode.com/problems/two-sum/solutions/4988795/two-sum) by @Kjur0
| 2. Add Two Numbers | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/add-two-numbers) | medium |
| 4. Median of Two Sorted Arrays | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/median-of-two-sorted-arrays) | hard |
| 5. Longest Palindromic Substring | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/longest-palindromic-substring) | medium |
| 7. Reverse Integer | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/reverse-integer) | medium | [Reverse Integer Solution](https://leetcode.com/problems/reverse-integer/solutions/4989071/reverse-integer) by @Kjur0
| 11. Container With Most Water | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/container-with-most-water) | medium |
| 12. Integer to Roman | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/integer-to-roman) | medium |
| 13. Roman to Integer | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/roman-to-integer) | easy |
| 14. Longest Common Prefix | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/longest-common-prefix) | easy |
| 15. 3Sum | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/3sum) | medium |
| 18. 4Sum | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/4sum) | medium |
| 20. Valid Parentheses | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/valid-parentheses) | easy |
| 21. Merge Two Sorted Lists | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/merge-two-sorted-lists) | easy |
| 22. Generate Parentheses | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/generate-parentheses) | medium |
| 23. Merge k Sorted Lists | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/merge-k-sorted-lists) | hard |
| 25. Reverse Nodes in k-Group | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/reverse-nodes-in-k-group) | hard |
| 27. Remove Element | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/remove-element) | easy |
| 31. Next Permutation | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/next-permutation) | medium |
| 33. Search in Rotated Sorted Array | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/search-in-rotated-sorted-array) | medium |
| 35. Search Insert Position | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/search-insert-position) | easy |
| 48. Rotate Image | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/rotate-image) | medium |
| 52. N-Queens II | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/n-queens-ii) | hard |
| 55. Jump Game | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/jump-game) | medium |
| 56. Merge Intervals | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/merge-intervals) | medium |
| 57. Insert Interval | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/insert-interval) | medium |
| 62. Unique Paths | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/unique-paths) | medium |
| 68. Text Justification | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/text-justification) | hard |
| 78. Subsets | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/subsets) | medium |
| 86. Partition List | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/partition-list) | medium |
| 88. Merge Sorted Array | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/merge-sorted-array) | easy |
| 104. Maximum Depth of Binary Tree | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/maximum-depth-of-binary-tree) | easy |
| 121. Best Time to Buy and Sell Stock | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | easy |
| 128. Longest Consecutive Sequence | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/longest-consecutive-sequence) | medium |
| 136. Single Number | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/single-number) | easy |
| 137. Single Number II | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/single-number-ii) | medium |
| 146. LRU Cache | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/lru-cache) | medium |
| 185. Department Top Three Salaries | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/department-top-three-salaries) | hard |
| 189. Rotate Array | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/rotate-array) | medium |
| 198. House Robber | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/house-robber) | medium |
| 207. Course Schedule | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/course-schedule) | medium |
| 210. Course Schedule II | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/course-schedule-ii) | medium |
| 213. House Robber II | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/house-robber-ii) | medium |
| 217. Contains Duplicate | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/contains-duplicate) | easy |
| 239. Sliding Window Maximum | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/sliding-window-maximum) | hard |
| 253. Meeting Rooms II | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/meeting-rooms-ii) [![Static Badge](https://img.shields.io/badge/LintCode--Link?style=plastic&label=LintCode&labelColor=%2313b4ff&color=%2313b4ff)](https://www.lintcode.com/problem/919) | medium |
| 258. Add Digits | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/add-digits) | easy |
| 283. Move Zeroes | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/move-zeroes) | easy |
| 300. Longest Increasing Subsequence | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/longest-increasing-subsequence) | medium |
| 312. Burst Balloons | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/burst-balloons) | hard |
| 329. Longest Increasing Path in a Matrix | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | hard |
| 359. Logger Rate Limiter | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/logger-rate-limiter) [![Static Badge](https://img.shields.io/badge/LintCode--Link?style=plastic&label=LintCode&labelColor=%2313b4ff&color=%2313b4ff)](https://www.lintcode.com/problem/3620) | easy |
| 384. Shuffle an Array | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/shuffle-an-array) | medium |
| 394. Decode String | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/decode-string) | medium |
| 402. Remove K Digits | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/remove-k-digits) | medium |
| 424. Longest Repeating Character Replacement | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/longest-repeating-character-replacement) | medium |
| 427. Construct Quad Tree | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/construct-quad-tree) | medium |
| 540. Single Element in a Sorted Array | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/single-element-in-a-sorted-array) | medium |
| 542. 01 Matrix | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/01-matrix) | medium |
| 567. Permutation in String | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/permutation-in-string) | medium |
| 685. Redundant Connection II | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/redundant-connection-ii) | hard |
| 692. Top K Frequent Words | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/top-k-frequent-words) | medium |
| 715. Range Module | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries) | hard |
| 759. Employee Free Time | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/employee-free-time) [![Static Badge](https://img.shields.io/badge/LintCode--Link?style=plastic&label=LintCode&labelColor=%2313b4ff&color=%2313b4ff)](https://www.lintcode.com/problem/850) | hard |
| 818. Race Car | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/race-car) | hard |
| 837. New 21 Game | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/new-21-game) | medium |
| 843. Guess the Word | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/guess-the-word) | hard |
| 844. Backspace String Compare | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/backspace-string-compare) | easy |
| 862. Shortest Subarray with Sum at Least K | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | hard |
| 875. Koko Eating Bananas | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/koko-eating-bananas) | medium |
| 934. Shortest Bridge | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/shortest-bridge) | medium |
| 938. Range Sum of BST | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/range-sum-of-bst) | easy |
| 958. Check Completeness of a Binary Tree | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/check-completeness-of-a-binary-tree) | medium |
| 974. Subarray Sums Divisible by K | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/subarray-sums-divisible-by-k) | medium |
| 975. Odd Even Jump | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/odd-even-jump) | hard |
| 1011. Capacity To Ship Packages Within D Days | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days) | medium |
| 1101. The Earliest Moment When Everyone Become Friends | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends) [![Static Badge](https://img.shields.io/badge/LintCode--Link?style=plastic&label=LintCode&labelColor=%2313b4ff&color=%2313b4ff)](https://www.lintcode.com/problem/3670) | medium |
| 1110. Delete Nodes And Return Forest | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/delete-nodes-and-return-forest) | medium |
| 1136. Parallel Courses | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/parallel-courses) [![Static Badge](https://img.shields.io/badge/LintCode--Link?style=plastic&label=LintCode&labelColor=%2313b4ff&color=%2313b4ff)](https://www.lintcode.com/problem/3673) | medium |
| 1148. Article Views I | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/article-views-i) | easy |
| 1207. Unique Number of Occurrences | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/unique-number-of-occurrences) | easy |
| 1249. Minimum Remove to Make Valid Parentheses | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses) | medium |
| 1254. Number of Closed Islands | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/number-of-closed-islands) | medium |
| 1376. Time Needed to Inform All Employees | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/time-needed-to-inform-all-employees) | medium |
| 1480. Running Sum of 1d Array | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/running-sum-of-1d-array) | easy |
| 1514. Path with Maximum Probability | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/path-with-maximum-probability) | medium |
| 1639. Number of Ways to Form a Target String Given a Dictionary | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary) | hard |
| 1672. Richest Customer Wealth | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/richest-customer-wealth) | easy |
| 1768. Merge Strings Alternately | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/merge-strings-alternately) | easy |
| 1803. Count Pairs With XOR in a Range | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/count-pairs-with-xor-in-a-range) | hard |
| 1834. Single-Threaded CPU | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/single-threaded-cpu) | medium |
| 1857. Largest Color Value in a Directed Graph | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/largest-color-value-in-a-directed-graph) | hard |
| 1971. Find if Path Exists in Graph | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/find-if-path-exists-in-graph) | easy |
| 2007. Find Original Array From Doubled Array | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/find-original-array-from-doubled-array) | medium |
| 2101. Detonate the Maximum Bombs | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/detonate-the-maximum-bombs) | medium |
| 2332. The Latest Time to Catch a Bus | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/the-latest-time-to-catch-a-bus) | medium |
| 2402. Metting Rooms III | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/meeting-rooms-iii) | hard |
| 2407. Longest Increasing Subsequence II | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/longest-increasing-subsequence-ii) | hard |
| 2448. Minimum Cost to Make Array Equal | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/minimum-cost-to-make-array-equal) | hard |
| 2458. Height of Binary Tree After Subtree Removal Queries | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries) | hard |
| 2667. Create Hello World Function | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/create-hello-world-function) | easy |
| 2713. Maximum Strictly Increasing Cells in a Matrix | [![Static Badge](https://img.shields.io/badge/LeetCode--Link?style=plastic&logo=leetcode&logoColor=%23FFA116&label=LeetCode&labelColor=%23373737&color=%23373737)](https://leetcode.com/problems/maximum-strictly-increasing-cells-in-a-matrix) | hard |## Contributing
If you'd like to contribute more challenges, solutions, or improvements to the README, feel free to open a pull request. Your contributions are highly appreciated!
Happy coding! 💻✨