Here you'll find the Leetcode Questions with Optimized java solutions.
Each question having it's leetcode question number. By using this number you can nevigae this question on the leetcode.
Try to solve the questions if Need help then this repo is for you.
Levels:
🟢 - Easy
🟡 - Medium
🔴 - Hard
Question No. | Difficulty | Question | Solution |
---|---|---|---|
1 | 🟢 | Two Sum | Answer |
26 | 🟢 | Remove Duplicates from Sorted Array | Answer |
35 | 🟢 | Search Insert Position | Answer |
94 | 🟢 | Binary Tree Inorder Traversal | Answer |
125 | 🟢 | Valid Palindrome | Answer |
136 | 🟢 | Single Number | Answer |
144 | 🟢 | Binary Tree Preorder Traversal | Answer |
145 | 🟢 | Binary Tree Postorder Traversal | Answer |
225 | 🟢 | Implement Stack using Queues | Answer |
268 | 🟢 | Missing Number | Answer |
278 | 🟢 | First Bad Version | Answer |
292 | 🟢 | Nim Game | Answer |
349 | 🟢 | Intersection of Two Arrays | Answer |
374 | 🟢 | Guess Number Higher or Lower | Answer |
501 | 🟢 | Guess Number Higher or Lower | Answer |
1380 | 🟢 | Lucky Numbers in a Matrix | Answer |
1544 | 🟢 | Make The String Great | Answer |
1614 | 🟢 | Maximum Nesting Depth of the Parentheses | Answer |
2000 | 🟢 | Reverse Prefix of Word | Answer |
2441 | 🟢 | Largest Positive Integer That Exists With Its Negative | Answer |
2485 | 🟢 | Find Mode in Binary Search Tree | Answer |
2540 | 🟢 | Minimum Common Value | Answer |
2605 | 🟢 | Form Smallest Number From Two Digit Arrays | Answer |
Question No. | Difficulty | Question | Solution |
---|---|---|---|
102 | 🟡 | Binary Tree Level Order Traversal | Answer |
162 | 🟡 | Find Peak Element | Answer |
238 | 🟡 | Product of Array Except Self | Answer |
452 | 🟡 | Minimum Number of Arrows to Burst Balloons | Answer |
678 | 🟡 | Valid Parenthesis String | Answer |
791 | 🟡 | Custom Sort String | Answer |
930 | 🟡 | Binary Subarrays With Sum | Answer |
1038 | 🟡 | Binary Search Tree to Greater Sum Tree | Answer |
1171 | 🟡 | Remove Zero Sum Consecutive Nodes from Linked List | Answer |
1382 | 🟡 | Balance a Binary Search Tree | Answer |
1759 | 🟡 | Count Number of Homogenous Substrings | Answer |
1845 | 🟡 | Seat Reservation Manager | Answer |
1921 | 🟡 | Eliminate Maximum Number of Monsters | Answer |
2849 | 🟡 | Determine if a Cell Is Reachable at a Given Time | Answer |
Question No. | Difficulty | Question | Solution |
---|---|---|---|
4 | 🔴 | Median of Two Sorted Arrays | Answer |
41 | 🔴 | First Missing Positive | Answer |