Finding Missing Numbers in an Array with Sets

𝗗𝗮𝘆 𝟯𝟵 𝗼𝗳 #𝟭𝟴𝟬𝗗𝗮𝘆𝘀𝗢𝗳𝗖𝗼𝗱𝗲 Today, I built on the first/last occurrence solution to 𝗰𝗼𝘂𝗻𝘁 𝗼𝗰𝗰𝘂𝗿𝗿𝗲𝗻𝗰𝗲𝘀 𝗼𝗳 𝗮 𝘁𝗮𝗿𝗴𝗲𝘁 𝗶𝗻 𝗮 𝘀𝗼𝗿𝘁𝗲𝗱 𝗮𝗿𝗿𝗮𝘆 𝘄𝗶𝘁𝗵 𝗱𝘂𝗽𝗹𝗶𝗰𝗮𝘁𝗲𝘀. Using the same lower_bound and upper_bound helpers: Lower bound → first index where element ≥ target Upper bound → first index where element > target The count is simply: count = upper_bound - lower_bound This gives an O(log n) solution — much faster than scanning the entire array, especially with many duplicates. It’s a great example of how breaking a problem into reusable pieces leads to clean and efficient code. Perfect for analytics, frequency analysis, and search optimizations! 📊 #Python #Algorithms #BinarySearch #FrequencyCount #Coding #ProblemSolving

🐍 For Loop vs Lambda - The Python Showdown! Two ways to get things done, two very different 𝗽𝗲𝗿𝘀𝗼𝗻𝗮𝗹𝗶𝘁𝗶𝗲𝘀 👇 🔁 For Loop: The “hardworking” one goes 𝘀𝘁𝗲𝗽 𝗯𝘆 𝘀𝘁𝗲𝗽, makes sure everyone gets processed. Readable, reliable, and maybe a bit old-school. ⚡ Lambda Function: The “minimalist” gets the job done in 𝗼𝗻𝗲 𝗹𝗶𝗻𝗲. No drama, no names, just results. When to use what? 𝙐𝙨𝙚 𝙖 𝙛𝙤𝙧 𝙡𝙤𝙤𝙥 𝙬𝙝𝙚𝙣 𝙘𝙡𝙖𝙧𝙞𝙩𝙮 𝙢𝙖𝙩𝙩𝙚𝙧𝙨. 𝙐𝙨𝙚 𝙖 𝙡𝙖𝙢𝙗𝙙𝙖 𝙬𝙝𝙚𝙣 𝙨𝙥𝙚𝙚𝙙 𝙖𝙣𝙙 𝙗𝙧𝙚𝙫𝙞𝙩𝙮 𝙢𝙖𝙩𝙩𝙚𝙧. Both are powerful one’s like writing a story, the other’s like crafting a tweet. #Python #DataScience #CodingLife #Lambda #ForLoop #ProgrammingHumor #Developers #DataMantra

#96day of #100DaysOfCode 🌱 LeetCode 109: Convert Sorted List to Binary Search Tree Today’s challenge was about building balance — literally! Given a sorted linked list, we need to convert it into a height-balanced BST 🌳 🧠 Key Idea: The middle element of the list becomes the root. Left half forms the left subtree, right half forms the right subtree. Use slow–fast pointers to find the middle efficiently. 📈 Complexity: Time: O(n log n) Space: O(log n) (recursion stack) 💬 Learning: Balance matters — in trees, in code, and in life 🌿 Sometimes, the middle point creates the strongest foundation. #LeetCode #DSA #BinarySearchTree #LinkedList #CodingChallenge #Python #Algorithm #LeetCodeDaily #100DaysOfCode

✨ Leetcode #3370: Smallest Number With All Set Bits Today, I solved an interesting bit manipulation problem where the task was to find the smallest number greater than or equal to a given n, such that its binary representation contains only set bits (1s). 🔍 Concept Overview: - This problem beautifully highlights the power of bit manipulation and mathematical insight. - The key lies in observing the pattern of numbers that have all bits set, like 1, 3, 7, 15, 31, etc. - These numbers can be represented in a uniform mathematical form, which makes the solution both elegant and efficient. 💡 Key Learning: - Understanding how bit shifting and logarithmic operations can simplify problems involving binary representations. - Reinforcing the importance of pattern recognition in bit level problems. - Appreciating how a constant time solution can emerge from strong mathematical reasoning. 🧠 Complexity: O(1) A pure logic based solution; concise, optimal, and satisfying! #LeetCode #BitManipulation #Coding #ProblemSolving #Python #LearningEveryday #DataStructuresAndAlgorithms

Just stumbled on tinker-cookbook – a Python repo that shows how to do post‑training tricks with Tinker 🔧. It’s basically a recipe book of fine‑tuning steps, model‑compression hacks and quick eval scripts that save hours of boilerplate. With 1,949 stars the community already loves it 🚀, and the notebooks are super clean. If you’re tinkering with LLMs or any PyTorch model, give it a look – you’ll pick up ready‑made pipelines you can drop into your own code. https://lnkd.in/dnPHDzbJ #Python #Programming #thinking-machines-lab #MachineLearning #AI #Trending

🔹 Day 1 of 30 – LeetCode Challenge: Preorder Traversal of Binary Tree Today, I practiced a fundamental Tree Traversal problem using Python. The task was to return the preorder traversal of a binary tree’s nodes (Root → Left → Right). 🧩 Problem Statement: Given the root of a binary tree, return the preorder traversal of its nodes’ values. Example: Input: root = [1, null, 2, 3] Output: [1, 2, 3] 💡 Concept: In preorder traversal, we visit: Root node Left subtree Right subtree This can be solved either recursively or iteratively using a stack. I implemented the recursive approach, which is straightforward and elegant. 🕒 Complexity: Time Complexity: O(n) Space Complexity: O(h), where h = height of the tree 🏆 Result: ✅ All test cases passed 🚀 Runtime: 0 ms (Beats 100%) 💾 Memory: 12.41 MB (Beats 62.16%) 💬 Learning: Understanding tree traversal is a must for mastering recursion and data structures. This problem helped me revise depth-first traversal concepts efficiently. #30DaysOfCode #LeetCode #Python #DataStructures #Algorithms #BinaryTree #Recursion #MTech #CodingChallenge #PreorderTraversal

🚀Day 80 of #100DaysOfDSA 🚀 Solved LeetCode 451 — Sort Characters By Frequency 🔹 Problem: Sort a string based on the frequency of its characters in descending order. 🔹 Approach: Used Hash Map + Sorting 1️⃣ Count frequency of each character using a dictionary 2️⃣ Sort characters by their frequency (descending) 3️⃣ Rebuild the string by repeating characters based on count ✨ Key Insight: Hash maps are great for frequency counting, and sorting by values helps in many pattern-based problems. #LeetCode #DSA #Python #ProblemSolving #HashMap #Sorting #CodingJourney #100DaysOfCode 🚀

⏳ Leetcode #1611: Minimum One Bit Operations to Make Integers Zero 🔍 Today I picked up a problem that looked chaotic at first: transforming any integer into zero using very restricted bit-flip rules. Every bit could only flip if the bits below it satisfied certain conditions, making the process feel unpredictable 🧩. But once I dug deeper, something interesting appeared. The pattern wasn’t random at all; it was secretly following Gray Code. That realization turned a confusing sequence of operations into a clean, structured transformation ✨. ✅ Key Insight: The number of operations directly aligns with converting a Gray-Code-like representation of n into its binary form. ✅ Time Complexity: O(log n) ✅ Space Complexity: O(1) These are the moments that make problem solving rewarding: when the “why is this so messy?” suddenly becomes “this is actually lowkey clean” 🧠💡. #DataStructures #LeetCode #CodingChallenge #ProblemSolving #Python #DSA #ComputerScience #learningEveyDay