Minimum Window Substring Sliding Window Technique

Sometimes, solving a problem is about managing a window efficiently. Day 17/100 — Data Structures & Algorithms Journey Today’s Problem: Longest Substring Without Repeating Characters Approach: I used the sliding window technique to maintain a substring without duplicate characters. As I expanded the window, I checked for duplicates. If a duplicate was found, I shrank the window from the left until all characters were unique again. This allowed me to efficiently track the maximum length of a valid substring. Key Takeaways: - Sliding window helps optimize substring problems - Managing duplicates efficiently is crucial - Expanding and shrinking dynamically improves performance This problem strengthened my understanding of window-based algorithms. #DSA #LeetCode #SlidingWindow #ProblemSolving #SoftwareEngineering #CodingJourney #100DaysOfCode #TechLearning #DeveloperJourney #Programming #Python #InterviewPreparation #CodingSkills #ComputerScience #JobReady #FutureEngineer #TechCareers #SoftwareDeveloper #LearnInPublic #OpenToWork

Growth in DSA is not just about solving problems, but about learning powerful techniques that simplify them. Day 37/100 — Data Structures & Algorithms Journey Today I’m starting a new topic — Sliding Window Technique. After working on problems like Two Pointers and Trapping Rain Water, I realized how important it is to learn patterns that help optimize solutions. Sliding Window is one such powerful technique that can turn complex nested loops into efficient linear solutions. Today’s Focus: Understanding how sliding windows work Learning when to expand and when to shrink the window Identifying problems where this pattern can be applied Building intuition before jumping into coding Why this matters? Because many array and string problems can be solved efficiently using this technique. Key Takeaways (Starting Phase): Learning patterns helps reduce problem complexity Sliding Window is useful for subarray and substring problems Understanding the concept is the first step to mastering it Strong basics lead to faster problem-solving Excited to dive deeper into this pattern and apply it to real problems 🚀 #Day37 #DSA #LeetCode #ProblemSolving #SoftwareEngineering #CodingJourney #100DaysOfCode #TechLearning #DeveloperJourney #Programming #Python #InterviewPreparation #CodingSkills #ComputerScience #FutureEngineer #TechCareers #SoftwareDeveloper #LearnInPublic #Consistency

🔹 Topic: What is an Array? An Array is a collection of elements stored in contiguous memory locations. 👉 It allows: - Fast access using index (O(1)) - Easy traversal 💡 Example: arr = [10, 20, 30, 40] print(arr[0]) # 10 print(arr[2]) # 30 🎯 Interview Question: Why are arrays fast for accessing elements? 👉 Answer: Because they use index-based access, and memory is contiguous, so address calculation is direct. ⚠️ Limitation: - Fixed size (in some languages) - Insertion/Deletion is costly (O(n)) 💼 Pro Tip: Most problems (sliding window, two pointers) are based on arrays—master this first. 👇 What’s the most difficult array problem you’ve faced? #dsa #arrays #codinginterview #python #programming #developers #learning #tech

Some problems are not about matching values, but about matching them correctly. Day 23/100 — Data Structures & Algorithms Journey Today’s Problem: Bulls and Cows This problem was a great exercise in handling comparisons carefully and avoiding double counting. Approach: I divided the problem into two parts: First, I counted the "bulls" — digits that match in both value and position. Then, for the remaining digits, I used frequency counting to find "cows" — digits that exist but are in the wrong position. By using two arrays to track digit frequencies, I ensured that duplicate values were handled correctly. At each step: Identify exact matches (bulls) Store unmatched digits Count common digits using frequency (cows) Key Takeaways: Separating logic into steps simplifies complex problems Avoiding double counting is crucial in matching problems Frequency arrays are very useful for digit-based problems Clear thinking leads to accurate results This problem improved my understanding of string comparison and counting techniques. #DSA #LeetCode #Strings #ProblemSolving #SoftwareEngineering #CodingJourney #100DaysOfCode #TechLearning #DeveloperJourney #Programming #Python #InterviewPreparation #CodingSkills #ComputerScience #FutureEngineer #TechCareers #SoftwareDeveloper #LearnInPublic #OpenToWork

Day 50: Target Sum Task: Given an array of integers and a target value, find the number of ways to build an expression by assigning either a '+' or '-' to each integer so that they evaluate to the target. Solution: Math Reduction + 1D Dynamic Programming. This looks like a backtracking problem at first, but it can actually be mathematically reduced to the classic "Subset Sum" problem! If we group all the positive numbers into subset S1 and the absolute values of the negative numbers into subset S2, we know two things: S1 - S2 = target S1 + S2 = total_sum By combining these equations, we get 2 * S1 = total_sum + target, meaning the required sum of our positive subset (S1) must be exactly (total_sum + target) / 2! Instead of simulating every single +/- combination (which is extremely slow), this mathematical trick transforms the problem. I just used a 1D DP array to count how many subsets add up to this exact target. This optimizes the time complexity and keeps the auxiliary space super lightweight! #geekstreak60 #npci #codingchallenge #dailylearning #programmer #python #dynamicprogramming #dp #algorithms

Excited to share my Computer Vision project: Smart Lane Detection System 🚗 This project focuses on real-time lane detection using Python, OpenCV, NumPy, Canny Edge Detection, Region of Interest (ROI) masking, and Hough Transform. The system is designed to detect road lane boundaries from video input and highlight lane lines for better road analysis and driving assistance. It demonstrates the practical implementation of Computer Vision and Image Processing techniques in real-time video analysis. 🔹 Key Features: • Real-time lane detection • Edge detection using Canny Algorithm • Lane line detection using Hough Transform • ROI (Region of Interest) masking • Video-based road lane analysis • Lane boundary highlighting 🔹 Technologies Used: Python | OpenCV | NumPy | Computer Vision | Image Processing 🔹 GitHub Repository: https://lnkd.in/dkbfaKvp I built this project as a self-learning initiative to strengthen my practical understanding of Computer Vision, image preprocessing, and real-time video processing. Looking forward to learning more and building advanced Computer Vision solutions. #ComputerVision #Python #OpenCV #NumPy #MachineLearning #ArtificialIntelligence #LaneDetection #ImageProcessing #GitHub #Projects #SoftwareEngineering #Developer

Consistency in DSA beats intensity every single time. Day 39/100 — Data Structures & Algorithms Journey Today I solved Best Time to Buy and Sell Stock, and it gave me a strong introduction to the Sliding Window / Greedy approach. Instead of checking all possible buy-sell pairs, I learned how to track the minimum price and calculate profit efficiently in a single pass. Today’s Focus: Understanding how to track minimum values dynamically Applying a one-pass optimized approach Avoiding brute force (O(n²)) solutions Strengthening problem-solving intuition Why this matters? Because recognizing patterns like this helps reduce complexity and improves performance. Key Takeaways: Optimal solutions often come from simple observations Tracking values efficiently can solve problems faster Sliding Window / Greedy thinking reduces unnecessary work Clarity in approach leads to clean code Learning to simplify problems step by step 🚀 #Day39 #DSA #LeetCode #ProblemSolving #SoftwareEngineering #CodingJourney #100DaysOfCode #TechLearning #DeveloperJourney #Programming #Python #InterviewPreparation #CodingSkills #ComputerScience #FutureEngineer #TechCareers #SoftwareDeveloper #LearnInPublic #Consistency

Turned my webcam into a virtual whiteboard! ✍️💻 I recently went back into a Python hand-tracking script I made for fun and gave it a major practical upgrade. The Updates: ✅ Removed the face tracker to dedicate resources entirely to hand-tracking. ✅ Built a "virtual pen" that tracks index finger movements to draw on the screen. ✅ Programmed an open-palm gesture to act as a quick-clear eraser. Building interactive computer vision projects in Python has been one of the most exciting parts of my I.T. engineering journey so far. Watch the video to see me test out the drawing and erasing gestures in real time! What features would you add to a project like this? Let me know below! 👇 #Python #ComputerVision #Developer #Tech #StudentProject #SoftwareEngineering

Sensitivity analysis: knowing what really matters in your design When performance varies, the real challenge is often simple: 👉 Which parameters actually drive the behavior of my system? With SIMBA + Python, sensitivity analysis makes this explicit. In this example, a simple RLC circuit is analyzed by: -perturbing each component value by ±10% -running transient simulations automatically -extracting a single performance metric (overshoot) -computing normalized sensitivities for each parameter 📊 The result is a clear ranking of parameters, showing immediately where engineering effort should be focused. 💡 Why it matters: -reduce trial‑and‑error -improve design robustness -focus on the parameters that truly impact performance -increase confidence before hardware validation 👉 Sensitivity analysis is not about running more simulations, it’s about making better design decisions. 🔗 Python script and SIMBA model available in the technical resources (link in first comment). #PowerElectronics #Simulation #SensitivityAnalysis #Python #SIMBA #DesignRobustness Jérôme Cornau Emmanuel Rutovic Guillaume Fontes

Sometimes, solving a problem efficiently is about choosing the right direction. Day 15/100 — Data Structures & Algorithms Journey Today’s Problem: Merge Sorted Array Approach: The goal was to merge two sorted arrays into one, without using extra space. Instead of merging from the beginning, I used a two-pointer approach starting from the end of both arrays. By comparing elements from the back and placing the larger one at the last available position, I avoided overwriting existing values and achieved an efficient in-place solution. Key Takeaways: Thinking in reverse can simplify in-place problems Two-pointer technique is powerful for sorted data Avoiding extra space improves efficiency Learning to think differently with each problem. #DSA #LeetCode #ProblemSolving #SoftwareEngineering #CodingJourney #100DaysOfCode #TechLearning #DeveloperJourney #Programming #Python #InterviewPreparation #CodingSkills #ComputerScience #JobReady #FutureEngineer #TechCareers #SoftwareDeveloper #LearnInPublic #OpenToWork