#dsa #Coding.Today is learn Binary search,in sorted Array, this lecture was like incredible,now my BinarySearch concept is Literally in sky just because of my fav @rohit_negi9 bhaiya ❤️, thank you so much GOAT of DSA as well as CS. Now work is done, it's time to sleeping time😉.

Solved “First and Last Position in Sorted Array” using 3 approaches:. 1️⃣ Linear Search: O(n).2️⃣ Lower & Upper Bound: O(log n).3️⃣ Binary Search (from scratch): O(log n).Mastering search techniques one step at a time! 🧠⚡.#DSA #Java #BinarySearch #CodingNinjas #CodeNewbie

Anybody takes crazy notes like me?? @NotionHQ and @excalidraw are the best combo for making digital notes. #notesTaking #notion #excalidraw #binarysearch #dsa

#DSA #leetcode #Coding.Solved BinarySearch problem on leetcode, this was incredible for me, because it's run and submit in 1st code 😊, DSA is like awesome,now the BinarySearch concept is printed in my mind,like how it works 😲, Thanks to my fav @rohit_negi9 bhaiya❤️. #coderarmy

last 48h .• binary search on LC — stuck on O(N log N), finally optimized to O(log N).• chess app:. – start game service . – Room/Game schema, user schema. – rate-limiter and auth middleware to WebSocketService.• LC150 BinarySearch section grind this week.• b’day w/ fam ❤️

Day 1. Did revision of previously DSA topics.Participated in @codechef contest Starters 194 – solved 3 problems. Started learning Binary Search. Introduction to Binary Search ✅.Lower Bound & Upper Bound ✅.Floor & Ceil in a Sorted Array ✅. #DSA #Python #binarysearch #Leetcode

Solved: “Kth Smallest Product of Two Sorted Arrays” on LeetCode!. 🧠 Used binary search on value space + smart counting with signs in mind. #LeetCode #BinarySearch #Cplusplus #DSA #CodingChallenge #TechTwitter #100DaysOfCode

🚀 Day 337 of Code 🚀. Solved :. ✅ 2040. Kth Smallest Product of Two Sorted Arrays (POTD). #Day337 #LeetCode #DSA #BinarySearch #TwoPointers #KthSmallest #ProblemSolving #Algorithms #100DaysOfCode

Day 10 of #100DaysOfDSA. 🔍 Binary Search. A super-fast algorithm for finding elements in sorted arrays. It works by halving the search space each time - way quicker than Linear Search. #Java #BinarySearch #DSA #100DaysOfCode #Algorithms @kenyanJug

Day 34 ✅ | #gfg160 Challenge @geeksforgeeks .Solved → 📚 Allocate Minimum Pages. 📌 T: O(N * log(Sum of Pages)) | S: O(1). Used binary search on the answer space to find the min-max pages per student, with greedy allocation. #DSA #BinarySearch #Greedy #geekstreak2025

✅ Problem: Next Greatest Letter (LeetCode).💡 Used: Binary Search.⚡ Result: 0ms (Top 100%), 44MB (Top 82%).📘 Learned:.Binary search for next-greater element. Modulo trick for circular arrays. Thanks @kunalstwt . One more step forward 🚀.#LeetCode #Java #BinarySearch

Day 39 ✅ | #gfg160 Challenge @geeksforgeeks .Solved → 🎯 Search in a Row-wise Sorted Matrix.📌 T: O(N log M) | S: O(1). 🛠️ Used Binary Search in Rows → Checked if x can be in a row, then applied binary search inside that row. #DSA #BinarySearch #Matrix #geekstreak2025

Day - 6.Today I explored #BinarySearch:.✅ Read theory, time & space complexity.✅ Solved:.1⃣Search with target.2⃣Lower/Upper Bound.3⃣Floor & Ceil value problems.🗃️ In #DBMS: Practiced table creation + data insertion in SQL.#DSA #100DaysOfCode #Coding #PlacementPrep

Solved “Lower Bound” problem on @CodingNinjasOff using 2 approaches:. 1️⃣ Linear Search – O(n).2️⃣ Binary Search – O(log n) ✅.Goal: Find the smallest index i such that arr[i] >= x. #DSA #LeetCode #Java #BinarySearch #CodeNewbie #ProblemSolving

🔥 Day 267 of DSA Series 🚀. Solved 1 LeetCode problem!. 1️⃣ Kth Smallest Element in a Sorted Matrix 🔢📊💡⚙️.#100DaysOfCode #LeetCode #DSA #Heap #BinarySearch #Matrix #CodingChallenge

Solved Floor & Ceil problem using Binary Search in a sorted array!. 📌 Floor(x): Largest ≤ x.📌 Ceil(x): Smallest ≥ x.Efficient logic with O(log n) time 🔥. #DSA #BinarySearch #Java #ProblemSolving #CodeNewbie #CodingNinjas

💡 Find Minimum in Rotated Sorted Array 🔁. Lets connect to learn together !!💪. ⏱️ Time Complexity: O(log n).📦 Space Complexity: O(1).🧵 Code is in the post 👇. algorithm is in the comment .#LeetCode #DSA #BinarySearch #TUF #Coding #Cpp

Day 28 ✅ | #gfg160 Challenge.Solved → Number of Occurrence 🔍.Started with brute force, then optimized using Binary Search with lower_bound() & upper_bound() for efficient counting in a sorted array. 📌T: O(log N) | S: O(1). #DSA #BinarySearch #geekstreak2025 @geeksforgeeks

DSA Learning journey!.Binary Search isn’t limited to 1D. Converting the index mathematically saves space and makes the search efficient. Time complexity: O(log (m * n)) . #BinarySearch #LeetCode #DSA #Cplusplus #ProblemSolving #CodingJourney #TechLearning