#leetcode75 ผลการค้นหา
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 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 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 63 of #LeetCode75 Solved Koko Eating Bananas using Binary Search Key ideas I learned: 🔸 Binary search on answer space 🔸 Checking feasibility with a helper function 🔸 Ceiling division trick for hours 🔸 Minimizing speed while staying within time limit
Day 69 of #LeetCode75 – Problem 790 (Domino & Tromino Tiling) Today learned the DP + recurrence relation approach. Interesting formula: T(n) = 2·T(n-1) + T(n-3) Slowly understanding these DP patterns. #DSA #DynamicProgramming #100DaysOfCode #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 45 of #LeetCode75 Challenge – Problem #62 (Unique Paths) Solved using Dynamic Programming to count all possible paths a robot can take from the top-left to the bottom-right of a grid. Time:O(m×n) Space:O(m×n) #Day45 #LeetCode #100DaysOfCode #DSA #CPlusPlus #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
These are My last Contests I am improving gradually but still stucked not able to cross q3 mark please provide some advice how to break this barieer . #leetcode75 #programming #coding #learnInPublic
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 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
Binary Tree - DFS Maximum Depth of Binary Tree #LeetCode75 33/75 #Python #DSA #100DaysOfCode #LeetCode
Binary Tree - BFS Binary Tree Right Side View #LeetCode75 39/75 #Python #DSA #100DaysOfCode #LeetCode
Day #66 Update: - DevOps - Continuing on the Project - LeetCode: Two Coding Problems from Blind 75 #100DaysOfCode #CodinChallenge #leetcode75 #LeetCode #DSA
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 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 69 of #LeetCode75 – Problem 790 (Domino & Tromino Tiling) Today learned the DP + recurrence relation approach. Interesting formula: T(n) = 2·T(n-1) + T(n-3) Slowly understanding these DP patterns. #DSA #DynamicProgramming #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
🔥 Problem of the Day: Merge String Alternately Approach: Language: C++ Difficulty: Easy ✅ Passed all testcases #DSA #LeetCode75
🔥 Problem of the Day: Simplify Path Approach: Language: C++ Difficulty: Easy ✅ Passed all testcases #DSA #LeetCode75
🔥 Problem of the Day: Find The Middle Index In Array Approach: Language: C++ Difficulty: Easy ✅ Passed all testcases #DSA #LeetCode75
“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
🔥 Problem of the Day: Find Pivot Index Approach: Language: C++ Difficulty: Easy ✅ Passed all testcases #DSA #LeetCode75
🔥 Problem of the Day: Find The Highest Altitude Approach: Language: C++ Difficulty: Easy ✅ Passed all testcases #DSA #LeetCode75
🔥 Problem of the Day: Longest Subarray of 1's After Deleting One Element Approach: Language: C++ Difficulty: Medium ✅ Passed all testcases #DSA #LeetCode75
🔥 Problem of the Day: Max Consecutive Ones 3 Approach: Language: C++ Difficulty: Medium ✅ Passed all testcases #DSA #LeetCode75
🔥 Problem of the Day: Decode String Approach: Language: C++ Difficulty: Medium ✅ Passed all testcases #DSA #LeetCode75
Day 66 of #LeetCode75 — Problem 55 (Jump Game). Solved with recursion + memoization: try all jumps from each index and cache results. Time O(n²), Space O(n). Getting better at DP — one problem at a time. #100DaysOfCode #DSA #CPlusPlus #CodingJourney p
🔥 Problem of the Day: Evaluate Reverse Polish Notation Approach: Language: C++ Difficulty: Medium ✅ Passed all testcases #DSA #LeetCode75
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
🔥 Problem of the Day: Determine if Two String Are Closed Approach: Language: C++ Difficulty: Medium ✅ Passed all testcases #DSA #LeetCode75
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
🔥 Problem of the Day: Daily Temperature Approach: Language: C++ Difficulty: Medium ✅ Passed all testcases #DSA #LeetCode75
Day 63 of #LeetCode75 Solved Koko Eating Bananas using Binary Search Key ideas I learned: 🔸 Binary search on answer space 🔸 Checking feasibility with a helper function 🔸 Ceiling division trick for hours 🔸 Minimizing speed while staying within time limit
🔥 Problem of the Day: Final Prices With a Special Discount Approach: Language: C++ Difficulty: Easy ✅ Passed all testcases #DSA #LeetCode75
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 63 of #LeetCode75 Solved Koko Eating Bananas using Binary Search Key ideas I learned: 🔸 Binary search on answer space 🔸 Checking feasibility with a helper function 🔸 Ceiling division trick for hours 🔸 Minimizing speed while staying within time limit
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 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 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 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
These are My last Contests I am improving gradually but still stucked not able to cross q3 mark please provide some advice how to break this barieer . #leetcode75 #programming #coding #learnInPublic
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 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 51 of #LeetCode75 — Problem 162: Find Peak Element Used a binary search approach to find a peak in O(log n) time. Compare mid with mid+1 → move toward the side that must contain a peak. TC: O(log n) SC: O(1) #Day51 #LeetCode #DSA #CPP #CodingJourney
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 69 of #LeetCode75 – Problem 790 (Domino & Tromino Tiling) Today learned the DP + recurrence relation approach. Interesting formula: T(n) = 2·T(n-1) + T(n-3) Slowly understanding these DP patterns. #DSA #DynamicProgramming #100DaysOfCode #CodingJourney
Day #66 Update: - DevOps - Continuing on the Project - LeetCode: Two Coding Problems from Blind 75 #100DaysOfCode #CodinChallenge #leetcode75 #LeetCode #DSA
Day 45 of #LeetCode75 Challenge – Problem #62 (Unique Paths) Solved using Dynamic Programming to count all possible paths a robot can take from the top-left to the bottom-right of a grid. Time:O(m×n) Space:O(m×n) #Day45 #LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney
Binary Tree - DFS Maximum Depth of Binary Tree #LeetCode75 33/75 #Python #DSA #100DaysOfCode #LeetCode
Binary Tree - BFS Binary Tree Right Side View #LeetCode75 39/75 #Python #DSA #100DaysOfCode #LeetCode
Something went wrong.
Something went wrong.
United States Trends
- 1. #Kodezi N/A
- 2. Walter Payton 4,768 posts
- 3. Chronos N/A
- 4. Brian Cole 1,173 posts
- 5. Price 264K posts
- 6. Merry Christmas 67K posts
- 7. Good Thursday 36.5K posts
- 8. #25SilverPagesofSoobin 20.3K posts
- 9. $META 11.7K posts
- 10. #thursdayvibes 2,513 posts
- 11. The FBI 105K posts
- 12. #スビンの存在がMOAの宝物 14K posts
- 13. Yihe N/A
- 14. #WPMOYChallenge 5,306 posts
- 15. Metaverse 7,726 posts
- 16. Dealerships 1,538 posts
- 17. Somali 244K posts
- 18. Happy Friday Eve 1,029 posts
- 19. DNC and RNC 4,815 posts
- 20. Hilux 10.7K posts