Find Missing Binary String in Array

42 of #100DaysOfCode Solved LeetCode 930 – Binary Subarrays With Sum 💡 Today’s problem was a great example of how powerful Prefix Sum + HashMap can be when dealing with subarrays. 🔹 Approach Used: Instead of checking all subarrays (which would be inefficient), I used a running prefix sum and stored its frequency in a hashmap. This reduces the time complexity to O(n) — much more efficient than brute force! ⚡ 🔹 What I Learned: Prefix sum helps convert subarray problems into lookup problems HashMap optimizes repeated computations Always think: “Can I store previous results to save time?” #LeetCode #DSA #CodingJourney #Programming #Cpp #SoftwareEngineering #ProblemSolving #LearnToCode

LeetCode Parctice: Problem no.217 (Contains Duplicate) Statement- A array is given , we have to return true if any value appears at least twice in the array, and return false if every element is distinct. Approach- Brute Force Key Idea: - I used sets data structure for this problem as set only store unique elements. -While traversing the array, I check whether the current element already exists in the set. If the element is already present → it means a duplicate exists, so return true. Otherwise, insert the element into the set and continue checking. Time Complexity = O(n) Space Complexity = O(n) #DSA #CodingPractice #Cpp #Programming #ProblemSolving

k-th Lexicographical Happy String of Length n🪢 Given n and k, return the k-th lexicographical happy string of length n. Thought process Brute force idea: Generate all possible happy strings of length n, Sort them, Return the string at k-1 index Optimization Instead of generating everything and sorting later, we can control the order while generating. During backtracking: Try characters in order → a, b, c Skip if the current character is the same as the previous one This way strings are already generated in lexicographical order, so we can directly return the k-th string. #leetcode #thoughtProcess #problemSolving #programming #recursion #backtracking

LeetCode Practice: Today I solved Problem no.328(Odd Even Linked List) Statement- We are given the head of a singly linked list , group all the node with odd indices together followed by the node of even indices , and return the reordered list. Approach(Brute Force) Key Idea: I used ana auxiliary array to store the node values 1-Traverse the list by using temp->next->next starting from head to collect the odd indexed nodes 2-Then temp=head->next and traverse it using temp->next->next to collect the even indexed nodes 3-This ensures that all the odd index were stored first followed by even indexed nodes 4- Finally convert the array into the linked list. Time Complexity: O(N) Space Complexity: O(N) (due to the extra array) #LeetCode #DataStructures #LinkedList #CodingPractice #DSA #Programming #ProblemSolving

🔑 Ever wondered why Ruby developers swear by Hashes? It's not just convenient syntax—it's a masterpiece of computer science hiding in plain sight. In this breakdown, I'm peeling back the layers of how Hashes actually work under the hood, from lightning-fast O(1) lookups to collision handling, and why symbols beat strings every single time. #Ruby #Programming #DataStructures #SoftwareDevelopment #BackendDevelopment #RubyOnRails #CodePerformance

#Day58 Solved: Longest Substring Without Repeating Characters(Leetcode 3) Worked on one of the most asked string problems that really tests problem-solving and optimization skills. Problem: Find the length of the longest substring without repeating characters. Approach: Used the sliding window technique to efficiently track a valid substring. Instead of checking all possible substrings (which is slow), I dynamically adjusted the window: Expanded when characters were unique Shrunk when a duplicate appeared Key Learning: The biggest takeaway was understanding how to maintain a valid window rather than restarting every time a duplicate is found. Complexity: Optimized the solution from O(n²) to O(n) using the right approach. This problem strengthened my understanding of: Sliding Window Two Pointer Technique Optimizing brute force solutions #leetcode #dsa #programming #coding #slidingwindow #problemSolving

Solved a Gray Code problem in C++ today. The task was to generate bit patterns from 0 to 2^n - 1 such that every consecutive pattern differs by only one bit, while always starting from 0. I used the Gray code formula: gray = i ^ (i >> 1) This makes the solution clean and efficient, and guarantees that adjacent codes differ by exactly one bit. Example for n = 2: 00 -> 01 -> 11 -> 10 What I like about this problem is how a simple bit manipulation formula can solve what looks like a complex sequence-generation challenge. Concepts practiced: Bit Manipulation Binary Representation Pattern Generation C++ Problem Solving #cpp #coding #programming #datastructures #algorithms #problemsolving #bitmanipulation #leetcode #geekforgeeks

When you miss a base case🧠 What is the best way to check it, what do you guys think??💬 When working with recursion, the most important step is often the simplest one: 💻Define your base case first. Before thinking about the recursive calls, pause and ask, like what’s the worst or simplest condition where the function should stop? Most of the time, that’s your base case. A small reminder from experience: 👉 Start with the base case 👉 Think about edge conditions first 👉 Then build the recursive flow Strong foundations make complex problems manageable. You can also check out✨, and learn CPP from the basics💻: https://lnkd.in/gdPC4D6f #Recursion #Programming #CPP #DSA #problemSolving #leetcode #basecase #lpu

📚 New article just published on SYUTHD! 🔖 Mastering Discriminated Unions in C# 14: Clean Error Handling and Type Safety in .NET 10 🏷️ Category: C# Programming 📖 Full article → https://lnkd.in/gbFR5qNn 👉 Follow our page for more tech tutorials: https://lnkd.in/gsJDptPM 💬 Telegram: https://t.me/nisethtechno 👍 Facebook: https://lnkd.in/gsKv3Dyn #CProgramming #Tech #Tutorial #Programming #TechBlog #2026

📚 New article just published on SYUTHD! 🔖 Clean Architecture in .NET 10: Mastering C# 14 Discriminated Unions for Type-Safe Error Handling 🏷️ Category: C# Programming 📖 Full article → https://lnkd.in/g6DJeM36 👉 Follow our page for more tech tutorials: https://lnkd.in/gsJDptPM 💬 Telegram: https://t.me/nisethtechno 👍 Facebook: https://lnkd.in/gsKv3Dyn #CProgramming #Tech #Tutorial #Programming #TechBlog #2026