#leetcode75 hasil pencarian

Day 48 of #LeetCode75 Challenge: Decode String I explored a stack-based solution in C++ to handle nested brackets and repeated strings. Learned how to manage numbers and strings with stacks Great practice for understanding string & stack logic #100DaysOfCode #DSA #CodingJourney

Day 47 of #LeetCode75 Challenge Problem #2390 (Removing Stars From a String) Used a stack-based approach to simulate charactwrs. Every time a*appears, remove the top element (previous non-star). Time:O(n) Space:O(n) #Day47 #LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney

Day 46 of #LeetCode75 Challenge Problem #334 (Increasing Triplet Subsequence) Used a greedy approach with two variables tracking smallest and second-smallest elements to detect an increasing triplet. Time: O(n) Space: O(1) #Day46 #LeetCode #100DaysOfCode #DSA #CPlusPlus #Coding

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 44 of #LeetCode75 Challenge – Problem714 (Best Time to Buy and Sell Stock with Transaction Fee) Used Dynamic Programming (Top-Down Memoization). Time: O(n) Space: O(n) #Day44 #LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney

Day 42 of #LeetCode75 Challenge – Problem #1137 (N-th Tribonacci Number) Solved using recursion + memoization and then optimized via tabulation (Dynamic Programming). Time: O(n) Space: O(n) #Day42 #LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney

Day 41 of #LeetCode75 Challenge – Problem #198 (House Robber) Used recursion + memoization (Dynamic Programming) to maximize profit without robbing adjacent houses. Time: O(n) Space: O(n) #Day41 #LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney

🏅 LeetCode 75 Completed! Another milestone unlocked on my coding journey 💻✨ Feeling great to have mastered the essential 75 problems that shape a strong DSA foundation! 🚀 #LeetCode #LeetCode75 #CodingJourney #DSA #ProblemSolving #Programmer #CodeEveryday #ConsistencyWins

Day 39 of #LeetCode75 Problem:1318.Minimum Flips to Make a OR b Equal to c Idea: Compare bits of a, b, and c. Flip whenever (a | b) doesn’t match c’s bit. Handle cases where both a & b have 1s but c has 0. Time:O(1) Space: O(1) #100DaysOfCode #LeetCode #DSA #CodingJourney #Cpp

Day 38 of my #LeetCode75 Challenge Problem: Single Number (LeetCode 136) #100DaysOfCode #LeetCode #DSA #CodingJourney #Cplusplus #CodeNewbie

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 48 of #LeetCode75 Challenge: Decode String I explored a stack-based solution in C++ to handle nested brackets and repeated strings. Learned how to manage numbers and strings with stacks Great practice for understanding string & stack logic #100DaysOfCode #DSA #CodingJourney

Binary Tree - DFS Leaf-Similar Trees #LeetCode75 34/75 #Python #DSA #100DaysOfCode #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 - BFS Binary Tree Right Side View #LeetCode75 39/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

Binary Tree - DFS Maximum Depth of Binary Tree #LeetCode75 33/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 46 of #LeetCode75 Challenge Problem #334 (Increasing Triplet Subsequence) Used a greedy approach with two variables tracking smallest and second-smallest elements to detect an increasing triplet. Time: O(n) Space: O(1) #Day46 #LeetCode #100DaysOfCode #DSA #CPlusPlus #Coding

Day 47 of #LeetCode75 Challenge Problem #2390 (Removing Stars From a String) Used a stack-based approach to simulate charactwrs. Every time a*appears, remove the top element (previous non-star). Time:O(n) Space:O(n) #Day47 #LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney

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

Day 39 of #LeetCode75 Problem:1318.Minimum Flips to Make a OR b Equal to c Idea: Compare bits of a, b, and c. Flip whenever (a | b) doesn’t match c’s bit. Handle cases where both a & b have 1s but c has 0. Time:O(1) Space: O(1) #100DaysOfCode #LeetCode #DSA #CodingJourney #Cpp

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

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 42 of #LeetCode75 Challenge – Problem #1137 (N-th Tribonacci Number) Solved using recursion + memoization and then optimized via tabulation (Dynamic Programming). Time: O(n) Space: O(n) #Day42 #LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney

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

Understood intuition behind solution after going through solutions submitted by others 🤓 #Leetcode #Leetcode75

Day 74 of #leetcode75 Problem Solved: 442. Find All Duplicates in an Array

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