#leetcode75 результаты поиска

Day 37 of my #LeetCode75 Challenge Problem: Counting Bits (LeetCode 338) Idea: For every number from 0 to n, count the number of 1s in its binary form using simple division and remainder logic. Language: C++ #100DaysOfCode #LeetCode #DSA #CodingJourney #CodeNewbie #Cplusplus

Day 36 of my #LeetCode75 Problem: Greatest Common Divisor of Strings (LeetCode 1071) Idea: If (str1 + str2) != (str2 + str1), no common divisor exists. Otherwise, the answer is the substring of str1 with length equal to gcd(len(str1), len(str2)). #100DaysOfCode #LeetCode #DSA

Day 35 of my #LeetCode75 Problem:Letter Combinations of a Phone Number (LeetCode17) Key Idea: Each digit maps to letters. Use recursion and backtracking to explore every possible letter combination Approach:Backtracking #100DaysOfCode #LeetCode #DSA #CodingJourney #CodeNewbie

Day 33 of #LeetCode75 Problem: 700. Search in a BST BST rule makes searching super simple If val<root→go left If val>root→go right If equal→found it! Time: O(log N) for balanced BST Space: O(1) #LeetCode #Day31 #DSA #BinarySearchTree #CodingInCPlusPlus #100DaysOfCode

Day 32 Of #leetcode75 Problem :450.delete node in a binary search tree. #LeetCode #75DaysChallenge #Day31 #BinaryTree #BFS #DSA #CPl

Day 31 of #LeetCode75 Problem: 1161.Maximum Level Sum Binary Tree Approach: Use Level Order Traversal (BFS) with a queue. Update the result when a higher sum is found. TimeO(n) Spac:O(n) #LeetCode #75DaysChallenge #Day31 #BinaryTree #BFS #DSA #CPlusPlus #CodingJourney #cpp

Day 4 of #LeetCode75 in the books! ✅ Crushed Problem #605: Can Place Flowers 🌷 with a 1ms solution, beating 97.73% of submissions. Let's go! #100DaysOfCode #Coding

Day 30 of #LeetCode75 Problem: 199 Approach: Use DFS. traverse the right subtree first, then the left. If we enter a new level for the first time, record that node’s value. Time:O(n) Space:O(h) #LeetCode #75DaysChallenge #Day30 #DSA #BinaryTree #CodingJourney #KeepLearning

🚀 Day 3 of my #LeetCode75 Challenge! Just cracked Problem #1431 — Kids With the Greatest Number of Candies 🍬 ✅ 103/103 test cases passed Small wins like these fuel the big journey ahead. On to the next challenge! 💪🔥 #LeetCode #CodingJourney #ProblemSolving

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

Day 37 of my #LeetCode75 Challenge Problem: Counting Bits (LeetCode 338) Idea: For every number from 0 to n, count the number of 1s in its binary form using simple division and remainder logic. Language: C++ #100DaysOfCode #LeetCode #DSA #CodingJourney #CodeNewbie #Cplusplus

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

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

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

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

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

Binary Tree - DFS Lowest Common Ancestor of a Binary Tree #LeetCode75 38/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

Day 35 of my #LeetCode75 Problem:Letter Combinations of a Phone Number (LeetCode17) Key Idea: Each digit maps to letters. Use recursion and backtracking to explore every possible letter combination Approach:Backtracking #100DaysOfCode #LeetCode #DSA #CodingJourney #CodeNewbie

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 #66 Update: - DevOps - Continuing on the Project - LeetCode: Two Coding Problems from Blind 75 #100DaysOfCode #CodinChallenge #leetcode75 #LeetCode #DSA

Day 36 of my #LeetCode75 Problem: Greatest Common Divisor of Strings (LeetCode 1071) Idea: If (str1 + str2) != (str2 + str1), no common divisor exists. Otherwise, the answer is the substring of str1 with length equal to gcd(len(str1), len(str2)). #100DaysOfCode #LeetCode #DSA

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 2 of #LeetCode75 Problem: 1431. Kids With the Greatest Number of Candies Time: O(n) Space: O(n) #LeetCode75 #100DaysOfCode #DSA #LeetCode

✅ Day 111 of #GfG160 Solved: Longest String Chain 🔗 @geeksforgeeks #GeekStreak2025 #LeetCode75 Also knocked out LC: 🔢 Unique Number of Occurrences (C++ & JS) #LeetCode #Tech