https://github.com/harsh971/leetcode-solutions
Here you will get All Solutions for Topics from LeetCode Platform which i Solve on Regular Basic
https://github.com/harsh971/leetcode-solutions
c cpp java leetcode leetcode-cpp leetcode-solutions solutions
Last synced: 3 months ago
JSON representation
Here you will get All Solutions for Topics from LeetCode Platform which i Solve on Regular Basic
- Host: GitHub
- URL: https://github.com/harsh971/leetcode-solutions
- Owner: Harsh971
- Created: 2022-08-25T05:56:15.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2023-01-06T18:35:21.000Z (over 2 years ago)
- Last Synced: 2023-03-05T08:23:04.591Z (over 2 years ago)
- Topics: c, cpp, java, leetcode, leetcode-cpp, leetcode-solutions, solutions
- Language: C++
- Homepage:
- Size: 156 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode_Solutions
Here you will get All Solutions for Topics from LeetCode Platform which i Solve on Regular Basic
## 🛠Skills Used in this Repository...
 Â
## Sections... (Click on these to View Solutions of them Individually...)
- [LeetCode 75 Study Plan to Ace Interview Level 1](https://github.com/Harsh971/LeetCode-Solutions/tree/main/LeetCode%2075%20Study%20Plan%20to%20Ace%20Interview%20Level%201)
- [LeetCode 75 Study Plan to Ace Interview Level 2](https://github.com/Harsh971/LeetCode-Solutions/tree/main/LeetCode%2075%20Study%20Plan%20to%20Ace%20Interview%20Level%202)
- [All Practice Problems](#all-practice-problems)
## All Practice Problems
| | Problem Name |Difficulty Level|Solution|Time Complexity|Space Complexity|
| :-: | :-: |:-:| :-: | :-:|:-:|
| 1 | Two Sum | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Two-Sum.java)|O(n)|O(n)|
| 9 | Palindrome Number | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Palindrome-Number.cpp)|O(log n)|O(log n)|
| 13 | Roman to Integer | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Roman-to-Integer.cpp)|O(n)|O(1)|
| 16 | 3Sum Closest | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/3Sum-Closest.cpp)|O(n^n)|O(ans)|
| 21 | Merge Two Sorted Lists | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Merge-Two-Sorted-Lists.cpp)|O(n1+n2)|O(n1+n2)|
| 62 | Unique Paths | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Unique-Paths.cpp)|O(m*n)|O(n)|
| 70 | Climbing Stairs | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Climbing-Stairs.cpp)|O(n)|O(1)|
| 98 | Validate Binary Search Tree | Medum|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Validate-Binary-Search-Tree.cpp)|O(n)|O(h)|
| 102 | Binary Tree Level Order Traversal | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Binary-Tree-Level-Order-Traversal.cpp)|O(n)|O(n)|
| 110 | Balanced Binary Tree | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Balanced-Binary-Tree.cpp)|O(n log n)|O(h)|
| 121 | Best Time to Buy and Sell Stock | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Best-Time-to-Buy-and-Sell-Stock.cpp)|O(n)|O(1)|
| 142 | Linked List Cycle 2 | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Linked-List-Cycle-2.cpp)|O(n)|O(1)|
| 173 | Balanced Search Tree Iterator | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Binary-Search-Tree-Iterator.cpp)|O(h)|O(h)|
| 199 | Binary Tree Right Side View | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Binary-Tree-Right-Side-View.cpp)|O(n)|O(n)|
| 200 | Number of Islands | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Number-of-Islands.cpp)|O(m*n)|O(min(m,n))|
| 205 | Isomorphic Strings | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Isomorphic-Strings.cpp)|O(n)|O(1)|
| 206 | Reverse Linked List | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Reverse-Linked-List.cpp)|O(n)|O(1)|
| 227 | Basic Calculator 2 | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Basic-Calculator-II.cpp)|O(n)|O(1)|
| 278 | First Bad Version | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/First-Bad-Version.cpp)|O(log n)|O(1)|
| 235 | Lowest Common Ancestor of a Binary Search Tree | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Lowest-Common-Ancestor-of-a-Binary-Search-Tree.cpp)|O(h)|O(h)|
| 299 | Bulls and Cows | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Bulls-and-Cows.cpp)|O(n)|O(1)|
| 322 | Coin Change | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Coin-Change.cpp)|O(m*n)|O(m)|
| 392 | Is Subsequence | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Is-SubSequence.cpp)|O(n)|O(1)|
| 394 | Decode String | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Decode-String.cpp)|O(n)|O(n)|
| 409 | Longest Palindrome | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Longest-Palindrome.cpp)|O(n)|O(1)|
| 424 | Longest Repeating Character Replacement | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Longest-Repeating-Character-Replacement.cpp)|O(n)|O(1)|
| 438 | Find All Anagrams in a String | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Find-All-Anagrams-in-a-String.cpp)|O(n)|O(1)|
| 509 | Fibonacci Number | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Fibonnaic-Number.cpp)|O(n)|O(1)|
| 589 | N-ary-Tree-Preorder-Traversal | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/N-ary-Tree-Preorder-Traversal.cpp)|O(n)|O(n)|
| 629 | Top K Frequent Words | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Top-K-Frequent-Words.cpp)|O(n)|O(n)|
| 704 | Binary Search | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Binary-Search.cpp)|O(log n)|O(1)|
| 724 | Find Pivot Index | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Find-Pivot-Index.cpp)|O(n)|O(1)|
| 733 | Flood Fill | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Flood-Fill.cpp)|O(n^2)|O(n^2)|
| 735 | Asteroid Collision | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Asteroid-Collision.cpp)|O(n)|O(n)|
| 746 | Min Cost Climbing Stairs | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Min-Cost-Climbing-Stairs.cpp)|O(n)|O(1)|
| 815 | Bus Routes | Hard|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Bus-Routes.cpp)|O(n^2)|O(n^2)|
| 844 | Backspace String Compare | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Backspace-String-Compare.cpp)|O(n)|O(1)|
| 876 | Middle of the Linked List | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Middle-of-the-Linked-List.cpp)|O(n)|O(1)|
| 1046 | Last Stone Weight | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Last-Stone-Weight.cpp)|O(n log n)|O(n)|
| 1480 | Running Sum of 1d Array | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Running-Sum-of-1d-Array.cpp)|O(n)|O(1)|
## Feedback
If you have any feedback, please reach out to us at [email protected]
## 
Connect with Me
 Â
 Â
