#leetcode75 kết quả tìm kiếm
Day 24 of #LeetCode75 Problem:104.Maximum Depth of Binary Tree Idea: Depth = 1+max(depth of left, depth of right). Base case→if root is NULL, return 0. Time:O(n) Space: O(h)(stack space) #LeetCode #75DaysChallenge #Day24 #DSA #BinaryTree #Recursion #CPlusPlus #CodingJourney
Day 27 of #LeetCode75 Problem: 872. Leaf-Similar Trees Approach: Use DFS to store all leaf values of each tree. Compare both vectors at the end. Time:O(n) Space:O(n) #LeetCode #75DaysChallenge #Day27 #DSA #BinaryTree #Recursion #CPlusPlus #CodingJourney #KeepCoding
Day 23 of #LeetCode75 Problem:328.Odd Even Linked List Idea: 1.Separate nodes into odd and even positions. 2.Connect odd nodes first, then even. Time:O(n) Space:O(1) Sometimes,you’ve to reorder to keep the chain organized. #LeetCode #75DaysChallenge #Day23 #DSA #LinkedList
Day 25 of #LeetCode75 Problem: 1448. Count Good Nodes in BT Idea: Use DFS and track the max value seen so far. Increment count whenever the current node is“good.” Time: O(n) Space: O(h) #LeetCode #75DaysChallenge #Day25 #DSA #BinaryTree #Recursion #CPlusPlus #CodingJourney
Day 17 of #LeetCode75 🔹 Problem: Unique Number of Occurrences (LC 1207) 🔹 Approach: Used sorting + unordered map to count occurrences and verify uniqueness. 🔹 Time O(n log n). #LeetCode #75DaysChallenge #DSA #Coding #100DaysOfCode #CPlusPlus
Day 19 of #LeetCode75 Problem: 735. Asteroid Collision Idea: Use a stack. If it’s moving right, push it. If it’s moving left, check collisions. Pop smaller ones until collision is resolved. Time: O(n) Space: O(n) #LeetCode #75DaysChallenge #Day19 #DSA #ProblemSolving
Day 18 of #LeetCode75 Problem: 2390. Removing Stars From a String Idea: Use a string as a stack. If it’s a normal character → push it. If it’s a * →pop the last character. Return the final string. Time: O(n) Space: O(n) #LeetCode #Day18 #DSA #ProblemSolving #CodingJourney
Day 27 of #LeetCode75 Problem: 872. Leaf-Similar Trees Approach: Use DFS to store all leaf values of each tree. Compare both vectors at the end. Time:O(n) Space:O(n) #LeetCode #75DaysChallenge #Day27 #DSA #BinaryTree #Recursion #CPlusPlus #CodingJourney #KeepCoding
Day 25 of #LeetCode75 Problem: 1448. Count Good Nodes in BT Idea: Use DFS and track the max value seen so far. Increment count whenever the current node is“good.” Time: O(n) Space: O(h) #LeetCode #75DaysChallenge #Day25 #DSA #BinaryTree #Recursion #CPlusPlus #CodingJourney
Day 24 of #LeetCode75 Problem:104.Maximum Depth of Binary Tree Idea: Depth = 1+max(depth of left, depth of right). Base case→if root is NULL, return 0. Time:O(n) Space: O(h)(stack space) #LeetCode #75DaysChallenge #Day24 #DSA #BinaryTree #Recursion #CPlusPlus #CodingJourney
🧵 LeetCode 75 — Day 11: Smallest Infinite Set Implement a set of positive integers with 3 operations: popSmallest() → removes & returns the smallest number addBack(num) → adds a number back if removed Initialize with all numbers 1…∞ #LeetCode75 #Java #100DaysOfCode
🧵 LeetCode 75 — Day 11: Rotting Oranges Given a grid of oranges: 0 = empty 1 = fresh orange 2 = rotten orange Every minute, rotten oranges rot adjacent fresh ones. Find the minimum minutes until all oranges rot, or -1 if impossible. #LeetCode75 #Java #BFS #100DaysOfCode
Day 23 of #LeetCode75 Problem:328.Odd Even Linked List Idea: 1.Separate nodes into odd and even positions. 2.Connect odd nodes first, then even. Time:O(n) Space:O(1) Sometimes,you’ve to reorder to keep the chain organized. #LeetCode #75DaysChallenge #Day23 #DSA #LinkedList
Stop watching random tutorials. Start learning smart. LeetCode 75 in C++ — clean explanations, efficient logic, interview focus. 🔥 Full playlist: youtube.com/playlist?list=… #LeetCode #leetcode75 @lanacademy #Problemsolved
🧵 LeetCode 75 — Day 10 (Part 3): Nearest Exit in a Maze Given a maze with walls (+) and open paths (.), find the minimum steps from the entrance to any exit. #LeetCode75 #Java #BFS #100DaysOfCode #LeetCode
📘 LeetCode 75 — Day 10 (Stack) Problem: 2390. Removing Stars From a String For every *, remove it and the character immediately before it. Return the final string after all operations. #LeetCode75 #Stack #Java #100DaysOfCode
📘 LeetCode 75 — Day 10 (Binary Search II) Problem: 2300. Successful Pairs of Spells and Potions Each spell s and potion p form a successful pair if s * p >= success. Find how many potions form successful pairs for every spell. #LeetCode75 #BinarySearch #Java #100DaysOfCode
LeetCode 1071 – Greatest Common Divisor of Strings (C++) Can you find the pattern that divides both strings? Let’s solve it step by step — clear logic, clean code, and smart reasoning. 🎓 Part of the #LeetCode75 series by LAN Academy. 👉 youtu.be/ixQNtYInIvo #LeetCode
New video 🎬 LeetCode 1768 – Merge Strings Alternately (C++) Learn how to approach, analyze & solve this classic interview problem — step by step, clearly explained. Part of the #LeetCode75 series by LAN Academy. 👉 Watch here: youtu.be/bjOIHdit6U0 #CPP #DSA #LANAcademy
New Episode in the LeetCode 75 Series LeetCode 1768 – Merge Strings Alternately (C++) In this video, I explain the complete thought process behind solving this popular interview question youtu.be/bjOIHdit6U0 #LeetCode75 #CodingInterview #Algorithms #DSA #LANAcademy
📘 LeetCode 75 — Day 9 (Binary Search) Problem: 162. Find Peak Element Find an index i such that nums[i] is greater than its neighbors. #LeetCode75 #BinarySearch #Java
🌳 LeetCode 75 — Day 8: Maximum Level Sum of a Binary Tree Find the level in a binary tree that has the maximum sum of node values. #LeetCode #LeetCode75 #BinaryTree #BFS #Java #100DaysOfCode #DSA #ProblemSolving
🌳 LeetCode 75 — Day 8: Binary Tree Right Side View Given a binary tree, return the nodes you can see when looking at it from the right side. #LeetCode #LeetCode75 #BinaryTree #BFS #Java #100DaysOfCode
Day 19 of #LeetCode75 Problem: 735. Asteroid Collision Idea: Use a stack. If it’s moving right, push it. If it’s moving left, check collisions. Pop smaller ones until collision is resolved. Time: O(n) Space: O(n) #LeetCode #75DaysChallenge #Day19 #DSA #ProblemSolving
📅 LeetCode 75 – Day 8 Problem: Single Number Given an array where every element appears twice except one, find that single one. #LeetCode75 #DSA #Java #Coding
Day 27 of #LeetCode75 Problem: 872. Leaf-Similar Trees Approach: Use DFS to store all leaf values of each tree. Compare both vectors at the end. Time:O(n) Space:O(n) #LeetCode #75DaysChallenge #Day27 #DSA #BinaryTree #Recursion #CPlusPlus #CodingJourney #KeepCoding
Binary Tree - BFS Binary Tree Right Side View #LeetCode75 39/75 #Python #DSA #100DaysOfCode #LeetCode
Day 25 of #LeetCode75 Problem: 1448. Count Good Nodes in BT Idea: Use DFS and track the max value seen so far. Increment count whenever the current node is“good.” Time: O(n) Space: O(h) #LeetCode #75DaysChallenge #Day25 #DSA #BinaryTree #Recursion #CPlusPlus #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
Binary Tree - DFS Maximum Depth of Binary Tree #LeetCode75 33/75 #Python #DSA #100DaysOfCode #LeetCode
Day 24 of #LeetCode75 Problem:104.Maximum Depth of Binary Tree Idea: Depth = 1+max(depth of left, depth of right). Base case→if root is NULL, return 0. Time:O(n) Space: O(h)(stack space) #LeetCode #75DaysChallenge #Day24 #DSA #BinaryTree #Recursion #CPlusPlus #CodingJourney
Binary Tree - BFS Binary Tree Right Side View #LeetCode75 40/75 slowly moving closer to the goal, 40 days completed. #Python #DSA #100DaysOfCode #LeetCode
Binary Tree - DFS Longest ZigZag Path in a Binary Tree #LeetCode75 37/75 #Python #DSA #100DaysOfCode #LeetCode
Day 23 of #LeetCode75 Problem:328.Odd Even Linked List Idea: 1.Separate nodes into odd and even positions. 2.Connect odd nodes first, then even. Time:O(n) Space:O(1) Sometimes,you’ve to reorder to keep the chain organized. #LeetCode #75DaysChallenge #Day23 #DSA #LinkedList
Binary Tree - DFS Count Good Nodes in Binary Tree #LeetCode75 36/75 #Python #DSA #100DaysOfCode #LeetCode
Binary Tree - DFS Lowest Common Ancestor of a Binary Tree #LeetCode75 38/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 9 of #LeetCode75 Solved 1679. Max Number of K-Sum Pairs Approach: Sort the array Use two pointers (start & end) If sum == k → count++ and move both Else adjust pointers accordingly Time: O(n log n) Space: O(1) #100DaysOfCode #LeetCode #DSA #ProblemSolving #Day8
Day 13 of #LeetCode75 Solved 1493. Longest Subarray of 1's After Deleting One Element Approach: Sliding Window / 2 Pointers Track consecutive 1’s with at most one deletion Update max length as we move Time: O(n) Space: O(1) #100DaysOfCode #LeetCode #DSA #ProblemSolving
Day 11 of #LeetCode75 Solved 1456. Maximum Number of Vowels in a Substring of Given Length Approach: Sliding Window technique. Count first k. Slide the window across string, updating count efficiently. Time: O(n) Space: O(1) #100DaysOfCode #LeetCode #DSA #ProblemSolving #Dsa
🧠 Day 12 – LeetCode 75: Sort Colors Used Dutch National Flag 🏳️ algo (3 pointers: low, mid, high). 0ms ⏱️ | Beats 100% 🔥 In-place, one-pass, no sorting — just clean logic. JS all the way 💻 #LeetCode75 #100DaysOfCode #StriverSheet #JavaScript #DSA #DevJourney #CleanCode
Something went wrong.
Something went wrong.
United States Trends
- 1. Good Wednesday 22.7K posts
- 2. #LoveYourW2025 139K posts
- 3. #wednesdaymotivation 5,082 posts
- 4. TAEHYUNG AT LOVE YOUR W 81.7K posts
- 5. Hump Day 8,867 posts
- 6. Markey N/A
- 7. And the Word 77.6K posts
- 8. #GenV 3,613 posts
- 9. #15Oct 2,917 posts
- 10. Happy Hump 5,399 posts
- 11. Raila Odinga 163K posts
- 12. #LeeKnowXGucci 6,559 posts
- 13. LEE KNOW FOR HARPERS BAZAAR 5,868 posts
- 14. Young Republicans 91K posts
- 15. Tami 5,150 posts
- 16. cate 4,739 posts
- 17. Baba 130K posts
- 18. George Floyd 37.5K posts
- 19. Yamamoto 52K posts
- 20. Lucia 58.8K posts