Find First and Last Position of Element in Sorted Array with Binary Search

🚀 Cracked “Minimum Distance to Target” with a clean and efficient approach! My thought process was simple and structured: ➡️ First, I iterated through the array to identify all indices where the target element appears. ➡️ For each match, I calculated the absolute distance from the given start index. ➡️ Stored these distances and finally returned the minimum among them. 💡 This approach keeps things intuitive and avoids overcomplication—focus on correctness first, then optimize if needed. ✅ Time Complexity: O(n) ✅ Space Complexity: O(n) (can be optimized further by tracking min on the go) Sometimes the simplest logic gives the best results 🔥 #LeetCode #ProblemSolving #DataStructures #Algorithms #Python #CodingJourney #TechGrowth #Consistency #LearnInPublic #WomenInTech #100DaysOfCode #CodingLife #SoftwareEngineering #PlacementPrep

📌 Problem: Increasing Triplet Subsequence 💡 Approach: Traverse the array while maintaining two variables: first and second, representing the smallest and second smallest values found so far. If the current number is smaller than first, update first Else if it’s smaller than second, update second If a number is greater than both, we’ve found an increasing triplet This ensures an optimal single-pass solution. ⚙️ Key Insight: Track only two values instead of checking all triplets Greedy + optimization approach reduces complexity significantly ⏱️ Time Complexity: O(n) 📦 Space Complexity: O(1) 📚 What I learned: Greedy strategy for subsequence problems Reducing brute-force O(n³) to optimal linear solution #LeetCode #DSA #Algorithms #Coding #ProblemSolving #Python #Greedy #InterviewPreparation #CodingJourney

I've been using AI agents every day for months without actually understanding how they work. A cracked friend built a tool that breaks the whole thing down. No frameworks. ~60 lines of Python. Turns out an agent is just a function. Tools are a dict. Memory is a tool that writes to a file. That's it. Went through all 9 lessons in one sitting. If you've been using LangChain or CrewAI without knowing what's underneath, honestly just start here first. #AIAgents #SoftwareEngineering #BuildingInPublic

🚀 Day 04 of My Machine Learning Journey: NumPy Data Types (dtypes) Today, I learned about NumPy data types (dtypes), which define the type of elements stored in an array. I explored: ✅ Different types like int, float, and bool ✅ How NumPy uses fixed data types for better performance ✅ Why choosing the right dtype helps optimize memory usage Understanding dtypes helps write more efficient and faster code — an important step for Machine Learning. 💡 #MachineLearning #NumPy #Python #LearningJourney #Day04

In quant research, small inefficiencies compound. Most workflows still default to Pandas — not because it’s optimal, but because it’s familiar. We revisited Pandas vs Polars from a pipeline perspective, focusing on execution speed, memory behavior, and scalability. The takeaway is simple: This isn’t a library switch. It’s a shift in how data is processed. Speed, in quant systems, is not just performance — it’s edge. Sharing a short breakdown below. #QuantResearch #DataEngineering #Python #SystemDesign #FinanceTech

🚀 Day 48 – LeetCode Journey Today’s challenge: Substring with Concatenation of All Words ✔️ Solved using sliding window + hashmap ✔️ Processed string in fixed-length chunks ✔️ Tracked word frequency efficiently 💡 Key Insight: Instead of checking every substring blindly, splitting the string into word-sized pieces and using a hashmap helps validate matches efficiently. Sliding window keeps the solution optimized. This problem was a great exercise in string manipulation, hashing, and window techniques 🧠 Consistency is the real game changer 🚀 #LeetCode #Day48 #SlidingWindow #HashMap #Strings #Python #ProblemSolving #CodingJourney #100DaysOfCode https://lnkd.in/gxf4RBT6

Solved Kth Smallest Element in a BST today Used an iterative inorder traversal (DFS with stack) to efficiently find the answer without extra space for storing nodes. Key idea: 👉 Inorder traversal of a BST gives nodes in sorted order 👉 So the k-th visited node is the answer Instead of recursion, I used a stack to simulate traversal: Go left as much as possible Process node Move right Clean, efficient, and interview-friendly ✅ Time: O(H + k) Space: O(H) (stack) Consistent practice is making these patterns feel natural 🚀 #LeetCode #DataStructures #Algorithms #Python #CodingInterview

Subsets: Backtracking with Include/Exclude Decision Tree Generate all 2^n subsets via recursive binary choices — include current element or skip. Base case: processed all elements, save current subset. Backtracking pattern: modify state, recurse, undo modification. Backtracking Pattern: Modify shared state, explore branch, restore state before exploring alternate branch. This template applies to permutations, combinations, constraint satisfaction problems. Time: O(2^n) | Space: O(n) recursion depth #Backtracking #Subsets #DecisionTree #StateRestoration #Recursion #Python #AlgorithmDesign #SoftwareEngineering

Subsets: Classic Backtracking Template Generate all 2^n subsets via binary decision tree — include or exclude each element. Base case: index exceeds array length, save current subset copy. Backtracking: add element, recurse, remove element (backtrack), recurse again. Critical Detail: subset.copy() is essential — without it, all results reference same list, causing incorrect final output. Each subset snapshot must be independent. Time: O(2^n) | Space: O(n) recursion #Backtracking #Subsets #DecisionTree #DeepCopy #Recursion #Python #AlgorithmDesign #SoftwareEngineering

Day 3 Mastering the logic behind the code. 💻 Today’s deep dive: Booleans and Logical Operators. It’s fascinating to see how complex machine decisions are actually just a series of simple True or False evaluations. I’ve been exploring the Boolean data type and how comparison operations drive decision-making in software. It’s not just about 'running code' it's about structuring logic that scales. Progress over perfection. 📈 Moving through the 'Lesson Takeaways' today. There is something so satisfying about seeing a complex scenario broken down into a simple flowchart. What are you currently learning? Let's connect! #BuildInPublic #TechStack #CareerGrowth #ComputerScience #PythonProgramming #TechEducation #Python #LearningToCode #ContinuousImprovement