https://github.com/thammami01/leetcode-solutions
All of LeetCode problems solutions in TypeScript/Java that I participated in, including LeetCode essential & trending 75 plan.
https://github.com/thammami01/leetcode-solutions
java leetcode-75 leetcode-solutions typescript
Last synced: 3 months ago
JSON representation
All of LeetCode problems solutions in TypeScript/Java that I participated in, including LeetCode essential & trending 75 plan.
- Host: GitHub
- URL: https://github.com/thammami01/leetcode-solutions
- Owner: THammami01
- Created: 2022-02-23T06:55:37.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2024-03-16T03:24:16.000Z (about 1 year ago)
- Last Synced: 2025-01-14T05:33:29.902Z (5 months ago)
- Topics: java, leetcode-75, leetcode-solutions, typescript
- Language: Java
- Homepage: https://leetcode.com/THammami01/
- Size: 70.3 KB
- Stars: 3
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Solutions
## LeetCode 75
### Summary
| 
|
:-:
| 75 Essential & Trending Problems
Must-do problem list for interview prep
Best for 1~3 month of prep time |
#### I. Array / String
- [X] [01. Merge Strings Alternately](/LeetCode-75/01-1768.ts)
- [X] [02. Greatest Common Divisor of Strings](/LeetCode-75/02-1071.ts)
- [X] [03. Kids With the Greatest Number of Candies](/LeetCode-75/03-1431.ts)
- [X] [04. Can Place Flowers](/LeetCode-75/04-605.ts)
- [X] [05. Reverse Vowels of a String](/LeetCode-75/05-345.ts)
- [X] [06. Reverse Words in a String](/LeetCode-75/06-151.ts)
- [X] [07. Product of Array Except Self](/LeetCode-75/07-238.ts)
- [X] [08. Increasing Triplet Subsequence](/LeetCode-75/08-334.ts)
- [X] [09. String Compression](/LeetCode-75/09-443.ts)
#### II. Two Pointers
- [X] [10. Move Zeroes](/LeetCode-75/10-283.ts)
- [X] [11. Is Subsequence](/LeetCode-75/11-392.ts)
- [X] [12. Container With Most Water](/LeetCode-75/12-11.ts)
- [X] [13. Max Number of K-Sum Pairs](/LeetCode-75/13-1679.ts)
#### III. Sliding Window
- [X] [14. Maximum Average Subarray I](/LeetCode-75/14-643.ts)
- [X] [15. Maximum Number of Vowels in a Substring of Given Length](/LeetCode-75/15-1456.ts)
- [X] [16. Max Consecutive Ones III](/LeetCode-75/16-1004.ts)
- [X] [17. Longest Subarray of 1's After Deleting One Element](/LeetCode-75/17-1493.ts)
#### IV. Prefix Sum
- [X] [18. Find the Highest Altitude](/LeetCode-75/18-1732.ts)
- [X] [19. Find Pivot Index](/LeetCode-75/19-724.ts)
#### V. Hash Map / Set
- [X] [20. Find the Difference of Two Arrays](/LeetCode-75/20-2215.ts)
- [X] [21. Unique Number of Occurrences](/LeetCode-75/21-1207.ts)
- [X] [22. Determine if Two Strings Are Close](/LeetCode-75/22-1657.ts)
- [X] [23. Equal Row and Column Pairs](/LeetCode-75/23-2352.ts)
#### VI. Stack
- [X] [24. Removing Stars From a String](/LeetCode-75/24-2390.ts)
- [X] [25. Asteroid Collision](/LeetCode-75/25-731.ts)
- [X] [26. Decode String](/LeetCode-75/26-394.ts)
#### VII. Queue
- [X] [27. Number of Recent Calls](/LeetCode-75/27-933.ts)
- [X] [28. Dota2 Senate](/LeetCode-75/28-649.ts)
#### VIII. Linked List
- [X] [29. Delete the Middle Node of a Linked List](/LeetCode-75/29-2095.ts)
- [X] [30. Odd Even Linked List](/LeetCode-75/30-328.ts)
- [X] [31. Reverse Linked List](/LeetCode-75/31-206.ts)
- [X] [32. Maximum Twin Sum of a Linked List](/LeetCode-75/32-2130.ts)
#### IX. Binary Tree - DFS
- [X] [33. Maximum Depth of Binary Tree](/LeetCode-75/33-104.ts)
- [X] [34. Leaf-Similar Trees](/LeetCode-75/34-872.ts)
- [X] [35. Count Good Nodes in Binary Tree](/LeetCode-75/35-1448.ts)
- [X] [36. Path Sum III](/LeetCode-75/36-437.ts)
- [X] [37. Longest ZigZag Path in a Binary Tree](/LeetCode-75/37-1372.ts)
- [X] [38. Lowest Common Ancestor of a Binary Tree](/LeetCode-75/38-236.ts)
#### X. Binary Tree - BFS
- [X] [39. Binary Tree Right Side View](/LeetCode-75/39-199.ts)
- [X] [40. Maximum Level Sum of a Binary Tree](/LeetCode-75/40-1161.ts)
#### XI. Binary Search Tree
- [X] [41. Search in a Binary Search Tree](/LeetCode-75/41-700.ts)
- [X] [42. Delete Node in a BST](/LeetCode-75/42-450.ts)
#### XII. Graphs - DFS
- [ ] 43. Keys and Rooms
- [ ] 44. Number of Provinces
- [ ] 45. Reorder Routes to Make All Paths Lead to the City Zero
- [ ] 46. Evaluate Division
#### XIII. Graphs - BFS
- [ ] 47. Nearest Exit from Entrance in Maze
- [ ] 48. Rotting Oranges
#### XIV. Heap / Priority Queue
- [ ] 49. Kth Largest Element in an Array
- [ ] 50. Smallest Number in Infinite Set
- [ ] 51. Maximum Subsequence Score
- [ ] 52. Total Cost to Hire K Workers
#### XV. Binary Search
- [ ] 53. Guess Number Higher or Lower
- [ ] 54. Successful Pairs of Spells and Potions
- [ ] 55. Find Peak Element
- [ ] 56. Koko Eating Bananas
#### XVI. Backtracking
- [ ] 57. Letter Combinations of a Phone Number
- [ ] 58. Combination Sum III
#### XVII. DP - 1D
- [ ] 59. N-th Tribonacci Number
- [ ] 60. Min Cost Climbing Stairs
- [ ] 61. House Robber
- [ ] 62. Domino and Tromino Tiling
#### XVIII. DP - Multidimensional
- [ ] 63. Unique Paths
- [ ] 64. Longest Common Subsequence
- [ ] 65. Best Time to Buy and Sell Stock with Transaction Fee
- [ ] 66. Edit Distance
#### XIX. Bit Manipulation
- [ ] 67. Counting Bits
- [ ] 68. Single Number
- [ ] 69. Minimum Flips to Make a OR b Equal to c
#### XX. Trie
- [ ] 70. Implement Trie (Prefix Tree)
- [ ] 71. Search Suggestions System
#### XXI. Intervals
- [ ] 72. Non-overlapping Intervals
- [ ] 73. Minimum Number of Arrows to Burst Balloons
#### XXII. Monotonic Stack
- [ ] 74. Daily Temperatures
- [ ] 75. Online Stock Span
## LeetCode 150
### Summary
| 
|
:-:
| 150 Original & Classic Questions
Covers comprehensive interview topics
Best for 3+ months of prep time |