Remove Duplicate Letters with Monotonic Stack on LeetCode

Binary tree right side view Approach: - Keep a level variable - If level == result.size(), add current node (first node of that level) - Traverse right first, then left Time: O(n) Space: O(h) (worst: O(n), best: O(log n)) #Algorithms #DSA #LeetCode #coding #Programming

Day 97/100 – DSA Challenge 🚀 Topic: Z algorithm Key Learning: One powerful yet underrated technique is the Z Algorithm. What is the Z Algorithm? The Z Algorithm is a linear-time string matching algorithm that constructs a Z-array, where each element represents the length of the longest substring starting from that position that matches the prefix of the string. GitHub: <https://lnkd.in/dtek96E3> #100DaysOfDSA #ProblemSolving #LinkedInLearning #clanguage #coding #programming #developer #softwareengnieer #datastructure

Q. All Nodes at distance K in binary tree Approach: Do level order traversal create a function which mark parents of each nodes create a visited hash map move outwards direction every time - (towards the parent, left, right) of node at any point if distance is equal to K -- break if not then repeat for next element in queue At the end - store remaining elements of queue in vector and return TC : O(N) -- overall SC : O(N) -- overall #DSA #programming #coding #binarytree #buildinpublic #leetcode

LCA - Lowest Common Ancestor of binary tree Approach: If current node is null, return null If current node is p or q, return current node Recursively search left and right If both sides return non-null → current node is LCA Otherwise → return the non-null side TC = O(n) SC = O(h) - depends on tree height (recursion stack) O(logn) - balanced tree O(n) - skewed tree #dsa #leetcode #consistency #coding #programming

🚀 Day 93 of #100DaysOfCode Challenge Today’s problem was all about identifying “Beautiful Strings” 🔢✨ A numeric string is called beautiful if: ✔️ It can be split into a sequence of increasing numbers ✔️ Each number is exactly +1 from the previous ✔️ No leading zeros allowed 💡 What I Learned Today: How to break strings into valid sequences Handling large numbers using long long Importance of string comparison vs integer operations Edge cases like: Leading zeros ❌ Single digit strings ❌ Invalid increments ❌ 🧠 Approach: Try all possible starting numbers Generate the sequence dynamically (x, x+1, x+2…) Match the built string with the original If matched → ✅ YES x Else → ❌ NO 💻 Example: 👉 Input: 91011 👉 Output: YES 9 ⚡ Key Takeaway: Sometimes brute force with smart validation is the best approach! 📅 Consistency is the real game changer. On to Day 94 💪 #Coding #Programming #CProgramming #DataStructures #ProblemSolving #100DaysOfCode #DeveloperJourney #LearningEveryday

In LeetCode 867 – Transpose Matrix Today I worked on a basic but important matrix problem: transposing a matrix. The idea is simple — convert rows into columns. Understanding matrix traversal helps build a strong foundation for more complex problems. #LeetCode #DSA #Coding #Programming #ProblemSolving #100DaysOfCode #DeveloperJourney #CodeNewbie #Tech #Learning #CodingLife #ComputerScience #Algorithms #Matrix #Consistency

Cycle Sort is not just another sorting algorithm, it is provably impossible to do fewer writes. Period. Cycle Sort follows where each element belongs, places it, picks up the displaced one, and follows that element. It continues chain after chain until every cycle closes. This is group theory disguised as a sorting algorithm. By minimizing writes to memory, Cycle Sort achieves the theoretical lower bound, making it optimal for scenarios where write operations are expensive, such as flash memory or EEPROM storage. Every element moves directly to its final position with no unnecessary swaps, proving that sometimes the most elegant solution is also the most mathematically efficient. #CycleSort #Programming #CodingLife #TechEducation #Algorithms #SortingAlgorithm #GroupTheory #OptimalAlgorithm #MemoryEfficient #ComputerScience #WriteOptimized #AlgorithmDesign #Coding #Developer #TechLearning #DataStructures #ProgrammingLife #CodeSmart #AlgorithmArt #ProvablyOptimal

Solved LeetCode: Merge Sorted Array using Two Pointer Approach Learned how to efficiently merge two sorted arrays into one without using extra space. Used two pointers starting from the end to avoid overwriting elements. Optimized solution with: Time Complexity: O(m + n) Space Complexity: O(1) This problem helped me understand in-place array manipulation, two-pointer technique, and edge case handling https://lnkd.in/gzXXyEUr GitHub Repo: https://lnkd.in/gg4daDpn #day12 #DSA #Cpp #LeetCode #Coding #Programming #Learning #ProblemSolving #TwoPointers #Arrays

📌 Day 1/100 – #100DaysOfDSA Started my journey today with a classic problem from LeetCode: 🔍 Problem: Remove Duplicates from Sorted Array 🧠 What I learned: How to use the two-pointer technique efficiently Instead of extra space, we can modify the array in-place Helps reduce time complexity to O(n) and space to O(1) ✅ Solution Approach: Used two pointers — one to track unique elements and another to traverse the array 👣 Whenever a new unique element is found, it gets placed in the correct position. 💡 Key Insight: When the array is sorted, duplicates are always adjacent — making this problem much simpler! ⚡ Takeaway: Two-pointer technique is powerful for array problems — definitely a pattern to remember. Excited to stay consistent and improve every day 🚀 If you're also doing #100DaysOfDSA, let’s connect and grow together 🤝 #100DaysOfDSA #DataStructures #Algorithms #Programming #SoftwareEngineering #CodingChallenge #LeetCode #DeveloperJourney #TechJourney #ComputerScience #ProblemSolving #Coding

Back in my early college days, I came up with a simple trick to convert decimal to binary — I call it the Bit Inversion method. Super easy and quick for 8-bit numbers. Thought of sharing it now — hope you find it useful! 😊 #Programming #Coding #ComputerScience #BitManipulation #DataStructures #Algorithms