Longest Palindromic Substring Solution with Expand-Around-Center Technique

Some problems are less about brute force and more about understanding patterns in bits. Day 9/100 — Data Structures & Algorithms Journey Today’s Problem: Gray Code Approach: The task was to generate a sequence where each number differs from the previous one by only a single bit. Instead of manually constructing sequences, I used a bit manipulation technique. For each number from 0 to 2ⁿ − 1, I applied the transformation: gray = i ^ (i >> 1) This ensures that consecutive numbers differ by exactly one bit, which satisfies the Gray Code property. Key Takeaways: - Bit manipulation can simplify complex problems - XOR operations are powerful for pattern-based transformations - Understanding binary representation opens new ways to solve problems efficiently This problem improved my confidence in handling bit-level logic and pattern recognition. #DSA #LeetCode #ProblemSolving #SoftwareEngineering #CodingJourney #100DaysOfCode #TechLearning #DeveloperJourney #Programming #Python #InterviewPreparation #CodingSkills #ComputerScience #JobReady #FutureEngineer #TechCareers #SoftwareDeveloper #LearnInPublic #OpenToWork

🚀 Matrix Multiplication: Code Implementation (Data Structures And Algorithms) This Python code illustrates how to perform matrix multiplication. The function takes two matrices as input and returns their product. It ensures that the matrices are compatible for multiplication (number of columns in the first matrix equals the number of rows in the second). The algorithm iterates through the rows of the first matrix and the columns of the second matrix to compute each element of the resulting matrix. Understanding the nested loops and the dot product calculation is key to understanding matrix multiplication. #Algorithms #DataStructures #CodingInterview #ProblemSolving #professional #career #development

I started solving algorithmic problems daily to improve how I think, not just how I code. So I built this repository: 22+ Python problems → from basic to challenging Focused on logic, patterns, and problem-solving Some examples: Array manipulation String processing Mathematical logic Pattern-based problems This is less about “solutions” and more about building thinking frameworks. 𝗜𝗳 𝘆𝗼𝘂'𝗿𝗲 𝗹𝗲𝗮𝗿𝗻𝗶𝗻𝗴 𝗣𝘆𝘁𝗵𝗼𝗻 𝗼𝗿 𝗽𝗿𝗲𝗽𝗮𝗿𝗶𝗻𝗴 𝗳𝗼𝗿 𝗶𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄𝘀, 𝘁𝗵𝗶𝘀 𝗺𝗶𝗴𝗵𝘁 𝗵𝗲𝗹𝗽. I’m consistently adding more problems and solutions as part of my daily practice. If you want to follow along or use it as a resource, the repo is in the comments. #Python #Algorithms #Coding #DataStructures #Learning

Sometimes, the simplest approach leads to the most effective solution. Day 11/100 — Data Structures & Algorithms Journey Today’s Problem: Longest Common Prefix Approach: I started by taking the first string as a reference prefix. Then, I compared it with the remaining strings one by one. If a string did not match the current prefix, I reduced the prefix step by step until a match was found. This process continued until the prefix matched all strings or became empty. Key Takeaways: - Breaking down the problem into smaller comparisons simplifies logic - Iterative reduction helps handle edge cases effectively - Simple approaches can often lead to clean and efficient solutions This problem reinforced my understanding of string manipulation and pattern-based thinking. #DSA #LeetCode #ProblemSolving #SoftwareEngineering #CodingJourney #100DaysOfCode #TechLearning #DeveloperJourney #Programming #Python #InterviewPreparation #CodingSkills #ComputerScience #JobReady #FutureEngineer #TechCareers #SoftwareDeveloper #LearnInPublic #OpenToWork

Built a Rainfall Prediction model and deployed it live. Here is what actually happened behind the scenes Decision Tree gave me 100% training accuracy. I got excited. Then I checked the test score and realised the model had just memorised the data. It learned nothing real. Naive Bayes gave me 73.9% on both train and test. Consistent That is the one I deployed. 3 models trained. 1 deployed. 1 lesson — a consistent score beats a perfect score every time live app here: https://lnkd.in/d-xaufug Full project and code: https://lnkd.in/d_d2Tx7R Akarsh Vyas Tanishq Vyas #DataScience #MachineLearning #Python #Streamlit #BuildInPublic #MLProject

Some problems don’t have one answer — they require exploring all possibilities. Day 19/100 — Data Structures & Algorithms Journey Today’s Problem: Different Ways to Add Parentheses This problem introduced me to a powerful concept — Divide and Conquer using recursion. Approach: Instead of evaluating the expression directly, I split the expression at every operator. For each split, I recursively solved the left and right parts and then combined the results. This allowed me to generate all possible outcomes based on different ways of placing parentheses. Key Takeaways: - Recursion helps explore multiple possibilities - Divide and Conquer simplifies complex expressions - Breaking problems into smaller parts makes them easier to solve This problem improved my understanding of recursive thinking and expression evaluation. #DSA #LeetCode #Recursion #DivideAndConquer #ProblemSolving #SoftwareEngineering #CodingJourney #100DaysOfCode #TechLearning #DeveloperJourney #Programming #Python #InterviewPreparation #CodingSkills #ComputerScience #JobReady #FutureEngineer #TechCareers #SoftwareDeveloper #LearnInPublic #OpenToWork

Curve fitting is straightforward, until you scale it. In high-throughput settings, fitting 100+ dose–response curves quickly becomes a bottleneck: manual workflows don’t scale, and reproducibility suffers. I’ve been working on automating 4PL curve fitting in Python to make this process faster, consistent, and reusable across datasets. Sharing a short note + code here: https://lnkd.in/gFdJ8U6e #DrugDiscovery #Python #HTS #DataAnalysis

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

🚀 Python Series – Day 7: Lists Data handling ka ek important concept hai — Lists. Aaj humne seekha: 👉 How to store and manage multiple values using lists 📌 Key Highlights: ✔ Ordered collection ✔ Mutable (easy to update) ✔ Supports duplicates ✔ Indexing & slicing available 📌 Practical Use Cases: Data storage Iteration using loops Basic data manipulation 💡 Practice Task: Create a list (names or numbers) Add/remove elements Iterate using loop 📈 Strong fundamentals = better coding skills 🔔 Follow Logic Gurukul for daily learning 💬 Comment "DAY7" for complete roadmap #Python #Programming #DataScience #AI #MachineLearning #Coding #LearnPython #TechSkills #CareerGrowth #LogicGurukul