#leetcode75 نتائج البحث

Day 29 #LeetCode75 Problem: 236. Lowest Common Ancestor Idea: Find the deepest node that’s ancestor of both p & q Return NULL if node is NULL. Return node if it’s p or q. Explore left & right. If both return non-NULL → current node is LCA. #DSA #BinaryTree #CodingJourney #MIET

🚀 Day 2 of my #LeetCode75 Challenge! Just cracked problem #1071 – Greatest Common Divisor of Strings 🔍✨ One more step toward mastering DSA fundamentals 💪 Consistency > Motivation 🔁 #100DaysOfCode #DSA #LeetCode #CodingJourney

🚀 Day 1 of my LeetCode 75 Challenge begins today! Just solved the first problem — #1768: Merge Strings Alternately ✅ One step closer to sharpening my DSA skills 💪 Consistency > Motivation. Let’s keep going! 🔥 #LeetCode #LeetCode75 #CodingJourney #100DaysOfCode

lets see if this gets 50 followers #LeetCode #leetcodeprogress #leetcode75 @LeetCode

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 #LeetCode75 #Java #DataStructures #ProblemSolving #CodingJourney #100DaysOfCode

🧵 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

🚀 Day 2 of my #LeetCode75 Challenge! Just cracked problem #1071 – Greatest Common Divisor of Strings 🔍✨ One more step toward mastering DSA fundamentals 💪 Consistency > Motivation 🔁 #100DaysOfCode #DSA #LeetCode #CodingJourney

Binary Tree - DFS Leaf-Similar Trees #LeetCode75 34/75 #Python #DSA #100DaysOfCode #LeetCode

Binary Tree - BFS Binary Tree Right Side View #LeetCode75 39/75 #Python #DSA #100DaysOfCode #LeetCode

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 29 #LeetCode75 Problem: 236. Lowest Common Ancestor Idea: Find the deepest node that’s ancestor of both p & q Return NULL if node is NULL. Return node if it’s p or q. Explore left & right. If both return non-NULL → current node is LCA. #DSA #BinaryTree #CodingJourney #MIET

Day #66 Update: - DevOps - Continuing on the Project - LeetCode: Two Coding Problems from Blind 75 #100DaysOfCode #CodinChallenge #leetcode75 #LeetCode #DSA

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 Maximum Depth of Binary Tree #LeetCode75 33/75 #Python #DSA #100DaysOfCode #LeetCode

Binary Tree - DFS Longest ZigZag Path in a Binary Tree #LeetCode75 37/75 #Python #DSA #100DaysOfCode #LeetCode

🧠 Day 14 – LeetCode 66: Plus One Input: [9,9,9] → Output: [1,0,0,0] Loop from end, add 1 → if <10 return, else set to 0. If all 9s, return [1, ...digits]. One-pass, clean logic. #LeetCode75 #100DaysOfCode #StriverSheet #JavaScript #CleanCode #DevJourney

Binary Tree - DFS Count Good Nodes in Binary Tree #LeetCode75 36/75 #Python #DSA #100DaysOfCode #LeetCode

Linked List Question. Reverse Linked List #LeetCode75 32/75 #Python #DSA #100DaysOfCode #LeetCode

Binary Tree - DFS Lowest Common Ancestor of a Binary Tree #LeetCode75 38/75 #Python #DSA #100DaysOfCode #LeetCode

lets see if this gets 50 followers #LeetCode #leetcodeprogress #leetcode75 @LeetCode

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 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

Completed my #leetcode75 Challenge! What should I do next ? #LeetCode #CodingChallenge #consistency

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 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 28 of the #Leetcode75 Challenge! 🔸Solved 2 problems using DP 🔸Solved POTD Progress - 61/75 ✅ #LeetCode #CodingJourney #CodingCommunity