🚀 Day 19/50 – LeetCode Challenge (Python) Continuing the challenge with an array problem focused on in-place marking and efficient space usage. 📌 Problem: Find All Numbers Disappeared in an Array (Easy) 🧠 Approach: Mark visited indices in the array to track missing numbers without extra space ✨ Key Learning: In-place techniques can replace additional data structures while keeping complexity optimal Staying consistent and learning new patterns. #LeetCode #Python #DSA #Consistency #LearningInPublic

📘 Python with DSA – Day 66 ✅ Topic: Basic Bit Manipulation Today, I focused on understanding the fundamentals of Bit Manipulation using Python. Learned how binary representation works and how bitwise operators help solve problems efficiently. 🔹 Topics covered: Binary representation of numbers Bitwise operators: &, |, ^, <<, >> Checking even/odd using bits Power of 2 logic using n & (n-1) Importance of XOR in problem solving 🔹 LeetCode Problem Solved: Single Number (Easy) Used XOR to find the unique element in an array where every other element appears twice. #Python #DSA #BitManipulation #LeetCode #CodingJourney #SDE #ProblemSolving

🚀 Wrote a Hugging Face BPE Tokenizer visualizer library in python! Tokenization is the heart of modern LLMs, but looking at raw lists of integer IDs isn't exactly intuitive. That's why I created a lightweight Python library to help you visually inspect how Byte-Pair Encoding tokenizer break down your text. ✅ Easy to use ✅ Integrates seamlessly with Hugging Face tokenizers ✅ Perfect for debugging, model building, or just learning how BPE works under the hood! 📦 Try it out: pip install hf-tokenizer-visualizer 🔗 Github and Package links are in the comments #huggingface #tokenizer #deeplearning #python

🚀 Solved Today’s POTD (23 Feb 2026): Union of Arrays with Duplicates on GeeksforGeeks using Python 🐍 Problem: Given two arrays, return the union of both arrays containing only distinct elements. Approach: Used Python’s Set data structure: • Converted both arrays into sets (automatically removes duplicates) • Used set union operation to combine elements • Returned the result as a list This problem reinforced the importance of choosing the right data structure for cleaner and more efficient solutions. 💡 Time Complexity: O(n + m) Small problems, strong fundamentals 💪 Consistency continues! #day8 #geekstreak60 #npci #geeksforgeeks #dsa #python #learning #problemsolving #codingjourney

🚀 Solved Today’s POTD (23 Feb 2026): Union of Arrays with Duplicates on GeeksforGeeks using Python 🐍 Problem: Given two arrays, return the union of both arrays containing only distinct elements. Approach: Used Python’s Set data structure: • Converted both arrays into sets (automatically removes duplicates) • Used set union operation to combine elements • Returned the result as a list This problem reinforced the importance of choosing the right data structure for cleaner and more efficient solutions. 💡 Time Complexity: O(n + m) Small problems, strong fundamentals 💪 Consistency continues! #day8 #geekstreak60 #npci #geeksforgeeks #dsa #python #learning #problemsolving #codingjourney

🚀 Day 38/50 – LeetCode Challenge (Python) Continuing the 50-day challenge with a bit manipulation problem that focuses on binary representation and shifting operations. 📌 Problem: Reverse Bits 🧠 Approach: Extract each bit using bitwise operations and rebuild the number in reverse order ✨ Key Learning: Understanding binary operations makes low-level optimizations much clearer and more intuitive. Bit manipulation might look tricky, but patterns make it powerful. 💪 #LeetCode #Python #DSA #BitManipulation #Consistency #LearningInPublic

Day 59 of 365 Days of code Couldn't solve problems properly in an optimized way, never mind, i still managed to solve it using a slow and a fast pointer. Qn 1) find the duplicate number The array will contain a duplicate element, we must find the element which has duplicate, without using an hashset. sounds scary :(. Approach: fast and slow pointers Gd nit #365daysOfCode #NeetCode #leetcode #DSA #python #LeetCode #ProblemSolving #Algorithms #365dayschallenge

LeetCode #98 – Validate Binary Search Tree | Python Implementation I implemented a recursive DFS approach with boundary tracking to validate BST properties. Core Insight: BST validation requires tracking allowable ranges, not just comparing immediate children. Each recursive call narrows the valid interval, ensuring global ordering throughout the entire subtree. Time: O(n) | Space: O(h) where h = tree height (recursion stack) #LeetCode #DataStructures #Python #BinarySearchTree #Recursion #DFS #CodingInterview #SoftwareEngineering

💡 A small Python lesson from LeetCode While solving LeetCode #8 (String to Integer – atoi), I wrote two solutions that were both O(n) and logically identical. But one was faster. The reason? Not the algorithm but the way the code was written. Using elif instead of multiple if checks and avoiding extra branching made a noticeable difference. In Python, fewer condition checks = fewer instructions = better runtime. Nice reminder that Big-O isn’t everything, especially in interpreted languages. Learning moments like these are why I enjoy solving problems 😄 #Python #LeetCode #LearningInPublic #SoftwareEngineering #ProblemSolving