Designing Time-Based Key-Value Store with Efficient Lookups

Day 43 – Finding a Substring in a String: Today’s task focused on checking whether a given substring exists within a string using logical conditions instead of complex methods. This exercise reinforced understanding of string comparison, user input handling, and conditional statements, which are essential for basic text search and validation tasks. GitHub Code: https://lnkd.in/gSvGR_NZ #Day43 #100DaysOfCode #Python #StringManipulation #LogicBuilding #ProblemSolving #DailyCoding #Consistency

Today I practiced the concept of Lists in Python by building a small menu-driven program to: • Add marks • Display all marks • Calculate total and average • Find highest and lowest marks Understanding how lists store and manage multiple values made me realize how powerful simple data structures are. Small concepts → Strong foundation. #Python #LearningJourney #CodingPractice

Day 44 – Replacing a Substring in a String: Today’s task focused on replacing a specific substring within a given string using a clean and structured approach. This exercise strengthened understanding of string functions, user input handling, and text transformation, which are commonly used in data cleaning and text-processing tasks. GitHub Code: https://lnkd.in/gWerhXEC #Day44 #100DaysOfCode #Python #StringManipulation #LogicBuilding #TextProcessing #DailyCoding #Consistency

Problem: Contains Duplicate (LeetCode #217) 💡 Concept Learned: Today I practiced a simple LeetCode problem: Contains Duplicate using Python. At first, I tried the brute-force approach by comparing each element with every other element using nested loops. It works, but it’s slow when the list becomes large. Then I learned a better way using a set. A key insight: If an element is already present in the set while traversing the array, a duplicate exists. 🎯 Key Takeaway: Choosing the right data structure makes a huge difference. A Hash Set helps reduce the time complexity from O(n²) to O(n) by enabling constant-time lookups. 📈 Slowly building confidence by solving one problem at a time and learning from mistakes. #DSA #LeetCode #100DaysOfCode #HashTable #Set #ProblemSolving #Python #CodingJourney #LearningInPublic #CodeNewbie

A chord diagram is a fun way to visualize connections in a dataset. It can show both which values are most connected and which have the fewest/most connections across the data. Python's holoviews library makes this fairly simple to create, though it requires a few additional steps, such as correctly orienting the text. Holoviews supports multiple backends, such as matplotlib and Bokeh, so it can export to a variety of formats, even interactive charts via HTML/JS. In a recent guide, I walk through how to create a chord diagram using a Pandas dataframe. Check it out: https://lnkd.in/g8t_-8F7 #DataAnalysis #DataVisualization #Python

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

Python Tip of the Day 🐍 range() and slicing may look similar — both use start : stop : step — but they serve different purposes. 🔹 range() generates numbers for iteration. 🔹 Slicing extracts elements from existing data. One creates. One selects. Understanding the difference makes your logic clearer and your code more intentional. Day 14 of building Python basics #PythonDaily #Python #LearningPython #DataAnalytics

Day 01 Today I focused on the building blocks of Python: 🔹 Data Types – Define the type of data (int, float, string, list, tuple, set, dict) 🔹 Variables – Store and reuse values in your program 🔹 Identifiers – Names given to variables, functions, and objects (must follow rules) 🔹 Type Casting – Convert one data type to another using int(), float(), str() Strong fundamentals create strong programmers 💻 One step at a time — let’s keep learning and growing! #Python #ProgrammingBasics #LearningJourney #BeginnerFriendly #CodingLife #Students

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

Stop using for loops to process data in Python. Do this instead. Day 6/47: Calculating Batting Strike Rates! 🏏 Processing millions of rows with a standard Python loop will freeze your system. The fix? Vectorization. Instead of looping row-by-row, NumPy aligns arrays in memory, executing math (runs / balls) * 100 instantly in parallel. Standard Lists = Slow & Iterative. NumPy Arrays = C-Speed & Parallel. 🔊 Watch my 43-second animated Masterclass to see the data flow! Ever crashed a notebook with a bad loop? Let me know! 👇 #DataScience #NumPy #Python #MachineLearning #CodingJourney #BSCIT