Day 26 of 50 days of LeetCode The Problem: Best Time to Buy and Sell Stock. The Mistake: My initial logic used global max() and min() functions. This failed because it didn't account for time—you can't sell a stock before you've actually bought it! The Correction: I refactored the code to a single-pass approach. By tracking the min_price seen so far and updating the max_profit dynamically, I ensured the "buy" always happens before the "sell" while keeping the efficiency at O(n). #LeetCode #Python #ProblemSolving #CodingJourney #CSDesign

🚀 Excited to share my latest project: a robust Movie Ticket Booking API built with FastAPI! I developed this backend to handle the core logic of a cinema booking system, focusing on clean code and efficient data handling. Key features include: ✅ User authentication and management. ✅ Dynamic movie and theater listings. ✅ Seamless seat selection and booking flow. ✅ Full CRUD operations with high-performance endpoints. Building this helped me dive deeper into asynchronous programming in Python and API structuring. Check out the repository here: https://lnkd.in/gr7Ahu6N Innomatics Research Labs #FastAPI #Python #BackendDevelopment #WebDevelopment #CodingProject #RESTAPI

🚀 Day 32/60 — LeetCode Discipline Problem Solved: Find the Index of the First Occurrence in a String Difficulty: Easy Today’s problem was about locating a substring within a string — a classic example of pattern searching. Using a straightforward approach, I iterated through the string and checked each possible starting point where the substring could match. This reinforces how simple logic, when applied cleanly, can be highly effective. 💡 Focus Areas: • Strengthened understanding of string traversal • Practiced substring comparison • Improved handling of boundary conditions • Learned importance of index-based iteration • Focused on writing clean and readable code ⚡ Performance Highlight: Achieved 0 ms runtime (100% performance) Sometimes the answer isn’t hidden deep — it’s right there… waiting for a careful eye to notice it. #LeetCode #60DaysOfCode #100DaysOfCode #DSA #Strings #Algorithms #ProblemSolving #CodingJourney #SoftwareEngineering #Python #Developers #Consistency #TechGrowth

#MorningReflections I revisited an old codebase and realized I had built a CLI I didn’t even remember. As part of my internal tooling process, argparse makes creating functional CLIs almost automagical—you set options, and it handles the heavy lifting. Don’t be a fool like me, always keep learning. 😂 #Python #InternalTools #CLIDevelopment

🚀 Day 35/60 — LeetCode Discipline Problem Solved: Remove Nth Node From End of List Difficulty: Medium Today’s challenge was about linked lists and efficient traversal. Instead of calculating the length first, I used the two-pointer approach to remove the target node in a single pass. 💡 Focus Areas: • Two-pointer technique (fast & slow pointers) • Linked list traversal optimization • Handling edge cases (removing head node) • Use of dummy node for cleaner logic • Writing efficient O(n) solutions ⚡ Performance Highlight: Achieved 0 ms runtime (100% performance) Two pointers… one moving ahead, one following behind— like time and memory walking together. And at the right moment… one node quietly disappears, as if it was never meant to stay. #LeetCode #60DaysOfCode #100DaysOfCode #DSA #LinkedList #TwoPointers #CodingJourney #ProblemSolving #Python #Developers #TechGrowth #Consistency

🚀 Day 172 of My LeetCode Journey 🚀 44. Wildcard Matching 🫧 In this problem, I had to check if a given string matches a pattern that can contain special characters like ‘?’ and ‘*’. ▪️ The ‘?’ can match any single character, and ‘*’ can match any sequence of characters (even empty). ▪️ I used dynamic programming with recursion (memoization) to solve this. I compared the string and pattern from the end and tried to match them step by step. ▪️ If both characters match or if the pattern has a ‘?’, I move both pointers one step back. ▪️ If the pattern has '*,' I have two choices: 🔹 Treat as matching one character and move the string pointer 🔹 Or treat it as empty and move the pattern pointer ▪️ If the characters don’t match, then that path becomes invalid. ▪️ I also handled edge cases carefully. For example, if the string becomes empty, the pattern should still contain only ‘*’ to match. ▪️ To avoid recomputation, I stored results in a DP table. #LeetCode #DynamicProgramming #Strings #Python #CodingJourney #Day172 🔥

🚀 Day 168 of My LeetCode Journey 🚀 583. Delete Operation for Two Strings 🫧 In this problem, we are given two strings and need to find the minimum number of deletions required to make both strings the same. ▪️ Since we are only allowed to delete characters, the idea is to keep the characters that are common in both strings and remove the rest. ▪️ So first, I found the LCS between the two strings. The LCS represents the longest sequence of characters that appears in both strings in the same order. ▪️ I used dynamic programming to build a table where dp[i][j] stores the length of the LCS for the first i characters of word1 and the first j characters of word 2. ▪️ If the characters at the current positions match, we extend the subsequence by adding 1 to the previous result. ▪️ If they do not match, we take the maximum result from the previous possibilities. ▪️ After filling the table, we get the length of the LCS. ▪️ Finally, the minimum deletions needed are: (length of word1 − LCS) + (length of word2 − LCS) ▪️ This works because we keep the common characters and delete everything else from both strings. #LeetCode #DynamicProgramming #Strings #Python #CodingJourney #Day168 🔥

Day 36- Strings in Focus Today I explored Python's string methods, sharpening my ability to handle text with precision and clarity. Case Conversion - lower(), upper(), capitalize(), title(), swapcase() taught me how presentation shapes readability. Trimming & Replacing - strip(), Istrip(), rstrip(), replace() showed the importance of clean inputs and adaptability. ⚫ Searching & Finding - find(), rfind(), index(), count(), startswith(), endswith() strengthened my pattern detection and validation skills. Reflection - Strings may look simple, but they're everywhere: from user inputs to APIs. Mastering these methods builds the foundation for scalable, real-world solutions. Thanks to Rudra Sravan Kumar sir, Mounika M mam, and the 10000 Coders team for guiding us to think like developers - focusing on clarity, efficiency, and adaptability. Day 36 was about turning text into logic, and logic into confidence. #Day36 #Python #StringMethods #CodingJourney #10000Coders #GrowthMindset

Topic 10/100 🚀 🧠 Topic 10 — Partial Functions What if you could pre-fill some arguments of a function and reuse it later? 🤯 👉 What is it? Partial functions allow you to fix a few arguments of a function and generate a new function with fewer parameters. 👉 Use Case: Used in real-world applications for: Pre-configuring functions Simplifying repeated function calls Building reusable utilities 👉 Why it’s Helpful: Reduces repetition Makes code cleaner Improves readability 💻 Example: from functools import partial def multiply(x, y): return x * y double = partial(multiply, 2) print(double(5)) # Output: 10 🧠 What’s happening here? We fixed the value of x = 2, creating a new function (double) that only needs one argument. ⚡ Pro Tip: Use partial functions when you find yourself passing the same arguments repeatedly. 💬 Follow this series for more Topics #Python #BackendDevelopment #100TopicOfCode #SoftwareEngineering #LearnInPublic

🚀 Day 169 of My LeetCode Journey 🚀 1092. Shortest Common Supersequence 🫧 In this problem, we are given two strings, and we need to build the shortest string that contains both of them as subsequences. ▪️ The key idea is related to the Longest Common Subsequence. If both strings share some common characters in order, we should include those characters only once in the final string. ▪️ First, I built a DP table to find the LCS length between the two strings. This helps us understand which characters are common between them. ▪️ After filling the DP table, I traversed it backwards to construct the final string. ▪️ If characters in both strings match, I add that character once to the result and move diagonally in the table. ▪️ If they don’t match, I move in the direction that gave the larger LCS value and add that character to the result. ▪️ If one string finishes before the other, I simply added the remaining characters from the other string. ▪️ In the end, I reversed the collected characters to get the shortest common supersequence, which contains both strings while keeping the length as small as possible. #LeetCode #DynamicProgramming #Strings #Python #CodingJourney #Day169 🔥