Jon Bonso’s Post

🔗 Delete Node in a Linked List – CodeQuest Free Lesson Strengthen your understanding of linked lists by solving a classic node deletion problem while reinforcing pointer handling and core data structure fundamentals. ⌨️ Try it out: https://lnkd.in/g2NrQEzW #codequest #tutorialsdojo #coding #programming #learntocode

🚀 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

Variables are the backbone of every program They store data, bring flexibility, and power problem-solving in coding. Mastering variables is the first step toward becoming a great developer #Programming #CodingBasics #Variables #LearnToCode #SoftwareDevelopment #CodingLife #TechSkills #DeveloperJourney #ComputerScience #ProgrammingConcepts #augusitsolutions

Flatten Binary tree to linked list Approach: Do kind of post-order traversal ( right -> left -> root ) maintain a previous node go right (recursively) go left (recursively) make root->right point to previous and root->left point to null and update previous to root TC: O(N) SC: O(N) - recursive stack #DSA #programming #coding #buildinpublic #Technology #ProblemSolving #LeetCode #LearnInPublic  #Consistency

Solved LeetCode 151: Reverse Words in a String Today, I worked on reversing the order of words in a string while handling extra spaces efficiently. I learned how to: Remove leading, trailing, and multiple spaces Extract words correctly Reverse their order using clean logic and STL I implemented an optimized solution with: Time Complexity: O(n) Space Complexity: O(n) This problem helped me improve my understanding of string manipulation, edge case handling, and clean coding practices https://lnkd.in/getBKFiE GitHub Repo: https://lnkd.in/gg4daDpn #day18 #DSA #Cpp #LeetCode #Coding #Programming #Learning #ProblemSolving #Strings

Variables are the backbone of every program They store data, bring flexibility, and power problem-solving in coding. Mastering variables is the first step toward becoming a great developer. #Programming #CodingBasics #Variables #LearnToCode #SoftwareDevelopment #CodingLife #TechSkills #DeveloperJourney #ComputerScience #ProgrammingConcepts #OibreTechnologies

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

Leetcode daily - Day 3 🧠 Problem: (Isomorphic Strings) Check if two strings are isomorphic (one-to-one character mapping with order preserved). 💡 Approach: Used two hash maps to maintain mapping: s → t t → s If any mismatch occurs → return false, else true. 🔑 Key Learning: One-to-one mapping (bijection) HashMap usage in strings ⏱ Time Complexity : O(n) 💾 Space Complexity : O(1) ✨ Consistency is the key to mastering DSA! #LeetCode #DSA #CodingJourney #ProblemSolving #Consistency #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

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