LeetCode Challenge: Find Missing Numbers in Array

🚀 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

✨ Day 24 of #30DaysOfCode ✨ Today I explored how Python handles calculations. Turns out, it follows the same rules we learned back in school, BODMAS (Brackets, Orders, Division , Multiplication, Addition, Subtraction). Simple, but powerful. One step at a time, I’m building confidence in how code translates logic into results. 🚀 #Python #LearningJourney #CodingChallenge #30DaysOfCode #nxtwave #Nxtwave #CCBP #ccbp NxtWave #intensive3point0

💡 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

📅 Day 22 of Learning Python – Matrices 🧮 Today, I explored Matrices in Python using lists. A matrix is simply a list of lists, commonly used to represent: Rows & Columns Real-world data like scores, images, etc. 📌 Key Learnings: Indexing starts from 0 l[i] gives a full row l[i][j] gives a single element Nested loops help traverse rows and columns Feeling more confident with loops + matrices today 💪 Step by step, moving forward 🚀 #Python #LearningPython #Matrices #CodingJourney #Day22 #ProgrammingBasics #Consistency

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 30/50 – LeetCode Challenge (Python) Halfway to 50 with a classic medium-level problem that combines sorting and two-pointer techniques. 📌 Problem: 3Sum (Medium) 🧠 Approach: Sort the array and use two pointers to find unique triplets that sum to zero ✨ Key Learning: Sorting simplifies complex combinations and helps eliminate duplicates efficiently 30 days of consistency. Onward. #LeetCode #Python #DSA #Consistency #LearningInPublic

🚀 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

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