Most beginners ignore this… and regret later LeetCode 191 – Number of 1 Bits (Easy) This one problem teaches you: - Bit manipulation basics - Counting set bits efficiently - A pattern used in many interviews Looks simple… but it’s a foundation builder Explained here: https://lnkd.in/dGD-7HbV 1650+ DSA problems solved… still learning daily 🔥 Consistency > Talent 🚀 #leetcode #dsa #coding #bitmanipulation #programming #beginners

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

Day 88/100 – DSA Challenge 🚀 Topic: Prim’s Algorithm Key Learning: Prim’s Algorithm is a greedy algorithm used to find a Minimum Spanning Tree (MST) of a connected, weighted, undirected graph. A Minimum Spanning Tree is a subset of edges that: Connects all vertices Has no cycles Has the minimum total edge weight GitHub: <https://lnkd.in/dtek96E3> #100DaysOfDSA #ProblemSolving #LinkedInLearning #clanguage #coding #programming #developer #softwareengnieer #datastructure

Day 99/100 – DSA Challenge 🚀 Topic: Variable Window Key Learning: So one of the most powerful techniques in problem-solving especially in DSA is the Variable Window (Dynamic Sliding Window). What is it? A method where we use two pointers to create a window that expands and shrinks dynamically based on a condition. Why is it important? It helps reduce time complexity from O(n²) → O(n) in many problems involving arrays and strings GitHub: <https://lnkd.in/dtek96E3> #100DaysOfDSA #ProblemSolving #LinkedInLearning #clanguage #coding #programming #developer #softwareengnieer #datastructure

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

📅 Date: 10/04/2026 📌 Day 14 Today’s session focused on advanced Object-Oriented Programming (OOP) concepts. 🔹 Topics Covered: • Operator Overloading • Runtime Polymorphism • Virtual Functions This session gave me a deeper understanding of how flexibility and dynamic behavior are achieved in programming. Concepts like runtime polymorphism and virtual functions showed how programs can make decisions during execution, making them more powerful and adaptable. Stepping into more advanced concepts with confidence 🚀 #learning #programming #codingjourney #cse #development #skills #students #growth #consistency #cybernaut #jayasuryagnanavel #sreenidhi

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

Solved LeetCode: Container With Most Water using Two Pointer Approach Implemented an optimal solution using two pointers (left & right) to calculate the maximum water that can be stored between lines. At each step, moved the pointer with smaller height to maximize area efficiently. Optimized from brute force O(n²) to O(n) Time Complexity: O(n) Space Complexity: O(1) This problem helped me strengthen my understanding of two pointers, greedy thinking, and optimization techniques https://lnkd.in/gsCNa3wD GitHub Repo: https://lnkd.in/gg4daDpn #day5 #DSA #Cpp #LeetCode #Coding #Programming #Learning #ProblemSolving #TwoPointers

34 of #100DaysOfCode Solved the classic 3Sum (LeetCode 15) problem today! 💡 🔍 Approach: Used sorting + two-pointer technique to efficiently find all unique triplets that sum to zero. This problem really strengthens understanding of: ✔️ Array manipulation ✔️ Duplicate handling ✔️ Optimized searching (O(n²) instead of O(n³)) 🧠 Key Learning: Sometimes, sorting the array opens the door to powerful techniques like two pointers — making complex problems much simpler! #Day15 #LeetCode #DSA #CodingJourney #TwoPointers #ProblemSolving #Programming #Tech #Learning #Consistency

Solved LeetCode: Power of Two using Bit Manipulation Learned how to efficiently check whether a number is a power of 2 using binary properties. A number is a power of two if it has only one set bit in its binary representation. Used the trick: n > 0 && (n & (n - 1)) == 0 Optimized solution with: Time Complexity: O(1) Space Complexity: O(1) This problem helped me understand bit manipulation, binary concepts, and optimized checking techniques https://lnkd.in/dFdQhMmS GitHub Repo: https://lnkd.in/gg4daDpn #day10 #DSA #Cpp #LeetCode #Coding #Programming #Learning #ProblemSolving #BitManipulation