KAMALESHKUMAR S’ Post

Day 45 / #120DaysOfCode – LeetCode Challenge ✅ Problem Solved: • Maximum Distance Between Two Different Colors 💻 Language: Python 📚 Key Learnings: • Applied greedy observation-based approach • Learned to compare elements with first and last values • Avoided unnecessary nested loops → kept solution O(n) • Improved thinking in terms of distance maximization • Reinforced writing simple and efficient code Not every problem needs complexity — smart thinking matters 💯 🔗 LeetCode Profile: https://lnkd.in/gbeMKcv5 #LeetCode #Python #DSA #Greedy #Algorithms #CodingJourney #120DaysOfCode

Day 35 / #120DaysOfCode – LeetCode Challenge ✅ Problem Solved: • Minimum Distance Between Equal Elements 💻 Language: Python 📚 Key Learnings: • Used HashMap (defaultdict) to store indices of elements • Learned how to track positions efficiently • Applied distance calculation between indices • Improved understanding of index-based problems • Practiced optimizing solution using O(n) approach Consistency + Practice = Progress 📈 🔗 LeetCode Profile: https://lnkd.in/gbeMKcv5 #LeetCode #Python #DSA #HashMap #Algorithms #CodingJourney #Consistency #120DaysOfCode

Day 37 / #120DaysOfCode – LeetCode Challenge ✅ Problem Solved: • Search a 2D Matrix 💻 Language: Python 📚 Key Learnings: • Applied Binary Search on a 2D matrix • Learned how to treat matrix as a flattened sorted array • Practiced converting 1D index → 2D index (row, col) • Improved understanding of search space reduction • Strengthened logarithmic time complexity (O(log n)) thinking Better logic → Faster execution 🚀 🔗 LeetCode Profile: https://lnkd.in/gbeMKcv5 #LeetCode #Python #DSA #BinarySearch #Algorithms #CodingJourney #Consistency #120DaysOfCode

Day 48/100 – #100DaysOfCode 🚀 Solved LeetCode #13 – Roman to Integer (Python). Today I practiced string processing and mapping logic to convert Roman numerals into integers. Approach: 1) Create a dictionary to map Roman symbols to their integer values. 2) Traverse the string from left to right. 3) If the current value is less than the next value, subtract it. 4) Otherwise, add it to the total. 5) Return the final result. Time Complexity: O(n) Space Complexity: O(1) Understanding pattern-based problems in strings 💪 #LeetCode #Python #DSA #Strings #ProblemSolving #100DaysOfCode

Day 32 / #120DaysOfCode – LeetCode Challenge Today’s focus: Arrays & Majority Voting Algorithm ✅ Problem Solved: • Majority Element II 💻 Language: Python 📚 Key Learnings: • Applied Boyer-Moore Voting Algorithm (extended version) • Learned how to track two candidates for n/3 majority • Understood the importance of validation step after candidate selection • Improved ability to handle edge cases in frequency problems Consistency builds confidence 🚀 Every day = 1% better 💪 🔗 LeetCode Profile: https://lnkd.in/gbeMKcv5 #LeetCode #Python #DSA #Arrays #Algorithms #Consistency #CodingJourney #120DaysOfCode

From Code to Combat 💥 Who says programming can't be a little "supercharged"? I spent some time building a real-time gesture recognition tool in Python. By tracking hand coordinates and calculating the velocity of movement, I’ve managed to turn code into energy. It’s one thing to build a backend system, but seeing your logic manifest as a visual blast is a different kind of win. So you got to know an animie fan..hehehe #Python #OpenCV #DragonBallZ #CreativeCoding #MachineLearning #TechDemo

🚀 Day 13/30 – Python Challenge Diving into string operations in Python! 🐍 🔹 Key Concepts Covered: * String methods like upper() and lower() * Finding length using len() * Replacing text using replace() * String slicing 💻 Mini Task: Worked with a string to perform multiple operations like changing case, finding length, replacing words, and extracting specific parts of the text. 🎯 Learning Outcome: Learned how powerful string operations are in Python and how they help in processing and manipulating text efficiently. Understanding text handling step by step 💡 #Python #CodingChallenge #LearningJourney #Strings #StudentDeveloper #Day13

🚀 Solved: Find a String (Substring Count) Challenge Just solved another problem on HackerRank under the Python Strings section! ✅ 🧠 Problem Overview: Count how many times a substring appears in a string — including overlapping occurrences. 🔍 Key Learnings: Practiced string traversal techniques Understood why built-in methods like count() may not always work (no overlapping support) Strengthened concepts of slicing and iteration in Python 💡 Example Insight: For string "ABCDCDC" and substring "CDC", the answer is 2 (overlapping counts matter!). ⚡ Approach Used: Iterated through the string Compared substrings using slicing Counted valid matches efficiently 📈 Problems like this help build strong fundamentals in string manipulation, which is crucial for coding interviews and real-world applications. #Python #HackerRank #Coding #Strings #ProblemSolving #DSA #LearningJourney #AI link of #Solution :- https://lnkd.in/gtqcy8fX

#MachineLearning #Python #AI #DataScience #Pickle After building your AI model, the training phase can take a long time, and you may close VSCode. It is not logical to train the model again every time you run your code. This is where Python’s pickle module becomes invaluable. It allows us to serialize (save) and deserialize (load) Python objects, including our AI model. With model.pickle, we don’t need to train the model again next time — we just load it and use it directly.

🚀 Day 6/30 – Python Challenge Exploring loops in Python today! 🐍 🔹 Key Concepts: * for loop using range() * while loop execution * Iteration and repetition in programs 💻 Mini Task: Printed numbers from 1 to 5 using both for loop and while loop to understand their working. 🎯 Learning Outcome: Learned how loops help automate repetitive tasks and make code more efficient. Consistency + practice = improvement 📈 #Python #CodingChallenge #LearningJourney #AI #StudentDeveloper #Day6