#leetcode75 검색 결과
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 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 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 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
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 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 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 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 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 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 71 of #LeetCode75 Solved Problem 2235 – Add Two Integers. A simple one today Time Complexity:O(max (m,n)) Space Complexity: O(1) #LeetCode #DSA #100DaysOfCode #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
Daily coding challenge July 2k25 @LeetCode badge 📛 #LeetCode #leetcode75 #codinglife #CodingJourney #CodingChallenge #DCC2025
✅ Day 111 of #GfG160 Solved: Longest String Chain 🔗 @geeksforgeeks #GeekStreak2025 #LeetCode75 Also knocked out LC: 🔢 Unique Number of Occurrences (C++ & JS) #LeetCode #Tech
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. #UFC323 98.4K posts
- 2. Indiana 98.1K posts
- 3. Mendoza 37.8K posts
- 4. Ohio State 59.3K posts
- 5. Roach 28.7K posts
- 6. Petr Yan 14.5K posts
- 7. Merab 27.8K posts
- 8. Pantoja 30.8K posts
- 9. Bama 82.9K posts
- 10. Joshua Van 8,438 posts
- 11. Curt Cignetti 9,005 posts
- 12. Heisman 18K posts
- 13. Manny Diaz 2,552 posts
- 14. #iufb 7,965 posts
- 15. Miami 295K posts
- 16. The ACC 34.9K posts
- 17. Virginia 46K posts
- 18. James Madison 6,203 posts
- 19. James Madison 6,203 posts
- 20. #Big10Championship 2,086 posts