Replacing Substring in String with Python

Day 9 | Problem-Solving Practice Today I practiced a few foundational problems to strengthen logic and flow: • Sum of digits of a number • Prime number check and primes in a given range • Leap year validation using divisibility rules Focused on writing clear logic and understanding time complexity for each approach. Solutions have been pushed to GitHub for tracking progress. GitHub: https://lnkd.in/g35tV9Gj #ProblemSolving #Python #LearningInPublic

LeetCode | Longest Common Prefix 🔤 🔹 Approach: Sorting + Compare first & last strings 🔹 Key idea: Common prefix must match between smallest and largest 🔹 Time Complexity: O(n log n + m) 🔹 Space Complexity: O(1) Daily DSA practice to improve problem-solving skills 🚀 After sorting, the common prefix of the first and last string gives the answer #LeetCode #DSA #Strings #Python #CodingJourney #LearningInPublic

🚀 Day 5 of #GeekStreak60 Today’s Problem of the Day focused on finding the Union of Two Arrays. 🧠 Problem Statement Given two arrays, return all distinct elements present in either of them. 💡 Approach ✔️ Combined both arrays ✔️ Utilized a set to automatically eliminate duplicates ✔️ Returned the unique elements ✨ A simple yet insightful problem that highlights the efficiency of Python’s built-in data structures, especially sets, for handling duplicates. 📈 Consistency > Motivation 🔗 #GeeksforGeeks #GeekStreak60 #NPCI #Day5 #ProblemSolving #Python #CodingJourney

feb-23-26 LeetCode 1461 – Check If a String Contains All Binary Codes of Size K Solved today’s Daily Question! ✅ The problem asks to determine whether a binary string s contains all possible binary codes of length k as substrings. 🧠 Complexity: Time: O(n) Space: O(2^k) Simple logic + efficient implementation using hashing 🔥 #LeetCode #DailyCoding #Python #ProblemSolving #DataStructures #SlidingWindow #CodingJourney

If you’re working with Python and want to master data validation, schemas, and FastAPI-ready models, this video is for you. Clear concepts. Practical examples. Zero confusion. Level up your backend skills with Pydantic Framework https://lnkd.in/gRGSqNmv #Python #Pydantic #FastAPI #BackendDevelopment #aiwiththiru

feb-22-26 LeetCode 762 – Prime Number of Set Bits in Binary Representation Solved today’s problem! ✅ The task is to count numbers in a given range [left, right] whose number of set bits (1s in binary form) is a prime number. ⚡ Complexity: Time: O(n log n) Space: O(1) A simple yet powerful problem combining binary operations and number theory 🔥 #LeetCode #DailyCoding #BitManipulation #Python #ProblemSolving #CodingJourney

Day 49 of Python with DSA 🚀 Today’s problem helped me deeply understand how linked lists differ from arrays. When asked to splice nodes, the goal is not to create new data — it’s to manipulate pointers and reuse existing memory. The more I practice, the more I improve at writing efficient, interview-ready solutions. Discipline + consistency = growth 💪 #Day49 #Python #DSA #LinkedList #ProblemSolving #SDE#CodingJourney

Day 58 – Removing Common Elements from Lists Day 58 focused on removing common elements between two lists using set operations. This exercise enhanced understanding of list manipulation, type conversion, and efficient comparison techniques in Python, along with handling dynamic user inputs for practical implementation. GitHub Code: https://lnkd.in/gFwDgBBN #Day58 #100DaysOfCode #Python #Lists #SetOperations #LogicBuilding #DailyCoding #Consistency

LeetCode | Remove Nth Node From End 🔗 By keeping one pointer n steps ahead, we can locate the node to remove in one pass 🔹 Approach: Two Pointers 🔹 Key idea: Maintain n-step gap between pointers 🔹 Time Complexity: O(n) 🔹 Space Complexity: O(1) Daily DSA practice to improve problem-solving skills 🚀 #LeetCode #DSA #LinkedList #TwoPointers #Python #CodingJourney #LearningInPublic

Solved leetcode problem: Longest Substring Without Repeating Characters Approach: Use a set to maintain unique characters in the current window. Expand with r. If duplicate appears → shrink from l until valid. Track max window length. Consistent pattern practice > memorizing solutions. #LeetCode #SlidingWindow #Python #DSA #CodingInterview