#leetcode75 search results
Day 75 of #LeetCode75 Solved 739. Daily Temperatures Using a Monotonic Stack Track index of temperatures in a stack. Whenever we find a warmer day → pop & compute the wait time. Time:O(n) Space:O(n) #Day75 #LeetCode #DSA #Stack #MonotonicStack #CPlusPlus #CodingJourney
Day 70 of #LeetCode75 Today’s problem was really tough for me — Evaluate Division. Tried multiple times, got stuck, got frustrated… But didn’t give up. I understood and solved it with the help of YouTube Not my cleanest day, but definitely a learning day. Progress is progress.
Day 54 of #LeetCode75 — Problem2336: Smallest Number in Infinite Set This one was tricky, learned it with help and understood the logic behind maintaining: A pointer (cur) to the next smallest number A min-heap to store numbers that were added back #Day54 #LeetCode #DSA #CPP
Day 73 of #LeetCode75 452. Minimum Number of Arrows to Burst Balloons Key idea: Shoot one arrow for all overlapping intervals by minimizing the end range. Time: O(n log n) Space: O(1) #Day73 #LeetCode #DSA #GreedyAlgorithm #Intervals #CPlusPlus #CodingJourney #100DaysOfCode
Day 74 of #LeetCode75 Learned to Solved 72. Edit Distance Used recursion + memoization to handle: Time: O(n*m) Space: O(n*m)#Day74 #LeetCode #DSA #DynamicProgramming #Recursion #CPlusPlus #CodingJourney #100DaysOfCode
Day 65 of #LeetCode75 – Problem 62 (Unique Paths) Solved Unique Paths using Recursion + Memoization (Top-Down DP) Complexity: Time: O(m × n) Space: O(m × n) #Day64 #LeetCode #DSA #DynamicProgramming #CPlusPlus #100DaysOfCode #CodingJourney
Day 52 of #LeetCode75 — Problem 547: Number of Provinces Converted the adjacency matrix into an adjacency list and used DFS to count connected components. Each DFS run = one province. TC: O(n²) SC: O(n) #Day52 #LeetCode #DSA #CPP #CodingJourney
Day 56 of #LeetCode75 — Problem 208: Implement Trie (Prefix Tree) Today I implemented a Trie — a tree-based data structure used for fast word insertions, searches & prefix lookups. Key concepts: Node structure with 26 child pointers Recursion for insert/search Dictionary
Day 64 of #LeetCode75 – Problem #1143 (Longest Common Subsequence) Solved using memoized recursion (Top-Down DP) to efficiently compute LCS between two strings. Complexity: Time: O(n × m) Space: O(n × m) #Day64 #LeetCode #DSA #DynamicProgramming #CPlusPlus #CodingJourney
Day 72 of #LeetCode75 – Non-overlapping Intervals (Greedy + Sorting) Sort by end time Count non-overlapping intervals Remove the rest Time:O(nlog n) Space:O(1) #LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney
Day 58 of #LeetCode75 Worked on Rotting Oranges (BFS) today. I wrote most of the solution myself (~60%), but needed some guidance to fix the BFS logic and boundary handling. #100DaysOfCode #LeetCode #DSA #codingjourney
Day 60 of LeetCode 75 Solved 1137. N-th Tribonacci Number 🔢 Practiced: • Recurrence → DP • Clean base cases • Space-optimized tabulation (3 variables) Simple problem, but great for building DP intuition. #LeetCode75 #Day60 #DSA #DynamicProgramming #100DaysOfCode #cpp
Day 53 of #LeetCode75 — Problem 215: Kth Largest Element in an Array Used a max-heap (priority queue) to extract the k-th largest efficiently—no sorting needed. T:O(n log n) SC:O(n) #Day53 #LeetCode #DSA #CPP #100DaysOfCode #CodingJourney
Day 68 of #LeetCode75 – Problem 649: Dota2 Senate Didn’t solve this one on my own today. I explored the queue-based solution to understand how the banning simulation works. Not my solution, but definitely my learning. #LeetCode #DSA #CodingJourney #100DaysOfCode #CPlusPlus
Day 46 of #LeetCode75 Challenge Problem #334 (Increasing Triplet Subsequence) Used a greedy approach with two variables tracking smallest and second-smallest elements to detect an increasing triplet. Time: O(n) Space: O(1) #Day46 #LeetCode #100DaysOfCode #DSA #CPlusPlus #Coding
Day 48 of #LeetCode75 Challenge: Decode String I explored a stack-based solution in C++ to handle nested brackets and repeated strings. Learned how to manage numbers and strings with stacks Great practice for understanding string & stack logic #100DaysOfCode #DSA #CodingJourney
“Today’s LeetCode Blind 75: Container With Most Water. Funny how the whole problem collapses once you realize one thing: Move. The. Shorter. Side. Most of y’all fighting O(n²) demons while I’m out here cruising with two pointers.” #Leetcode #leetcode75
Day 50 of #LeetCode75 Challenge – Problem #841 (Keys and Rooms) Solved using Depth-First Search (DFS) to explore all reachable rooms starting from room 0. Time:O(n + k) Space:O(n) #Day50 #LeetCode #DSA #CPlusPlus #CodingJourney #100DaysOfCode #GraphTheory
Something went wrong.
Something went wrong.
United States Trends
- 1. The Plasma 91.6K posts
- 2. FINALLY DID IT 573K posts
- 3. Smear 16.6K posts
- 4. Kyle Whittingham N/A
- 5. Donte 2,637 posts
- 6. Chelley 9,533 posts
- 7. Bannon 41K posts
- 8. Animal Farm 3,288 posts
- 9. #FursuitFriday 15.6K posts
- 10. #NXXT_28YearFlow N/A
- 11. Woody Allen 9,640 posts
- 12. Ebro 1,532 posts
- 13. Trunk 5,563 posts
- 14. Jarry 11.1K posts
- 15. Skinner 12K posts
- 16. Warsh N/A
- 17. Nicki 54.9K posts
- 18. Julian Love N/A
- 19. Miss Universe 2,963 posts
- 20. DATEABLES 1,381 posts