Day 22/100
Solved LeetCode 1011: Capacity To Ship Packages Within D Days.
Used Binary Search on Answers to find the minimum feasible shipping capacity.
Learning to optimize solutions and understand the logic behind each approach.
#LeetCode#100DaysOfCode
Day 21/100 🔥
Solved Find the Smallest Divisor Given a Threshold on LeetCode.
Practiced Binary Search on Answers and optimized the feasibility check using integer ceiling division.
One problem at a time.
#100DaysOfCode#DSA#LeetCode#CPlusPlus
Day 21/100 🔥
Solved Find the Smallest Divisor Given a Threshold on LeetCode.
Practiced Binary Search on Answers and optimized the feasibility check using integer ceiling division.
One problem at a time.
#100DaysOfCode#DSA#LeetCode#CPlusPlus
Day 20/100 of #100DaysOfCode
Solved Minimum Number of Days to Make Bouquets
Practiced Binary Search on Answers and learned to handle feasibility checks and edge cases.
#DSA#LeetCode#CPlusPlus
Day 20/100 of #100DaysOfCode
Solved Minimum Number of Days to Make Bouquets
Practiced Binary Search on Answers and learned to handle feasibility checks and edge cases.
#DSA#LeetCode#CPlusPlus
Day 19/100 of #100DaysOfCode
Solved Koko Eating Bananas
Practiced Binary Search on Answers to find the minimum eating speed within a given time constraint.
Another day of building problem-solving skills, one problem at a time.
#DSA#CPlusPlus#LeetCode
Day 19/100 of #100DaysOfCode
Solved Koko Eating Bananas
Practiced Binary Search on Answers to find the minimum eating speed within a given time constraint.
Another day of building problem-solving skills, one problem at a time.
#DSA#CPlusPlus#LeetCode
Day 18/100 — #100DaysOfCode
Solved the Nth Root of a Number using Binary Search.
Practiced narrowing the search space and applying binary search to find the exact integer root.
#DSA#LeetCode
Day 18/100 — #100DaysOfCode
Solved the Nth Root of a Number using Binary Search.
Practiced narrowing the search space and applying binary search to find the exact integer root.
#DSA#LeetCode
Day 18/100 — #100DaysOfCode
Solved Sqrt(x) using Binary Search today.
Practiced narrowing down the search space and finding the integer square root without relying on built-in functionss
#DSA#LeetCode
Day 18/100 — #100DaysOfCode
Solved Sqrt(x) using Binary Search today.
Practiced narrowing down the search space and finding the integer square root without relying on built-in functionss
#DSA#LeetCode
Day 17/100 — #100DaysOfCode
Practiced modified binary search and learned to identify the sorted half to narrow down the search space.
One problem at a time. Building consistency. 🚀
#DSA#LeetCode
Day 17/100 — #100DaysOfCode
Practiced modified binary search and learned to identify the sorted half to narrow down the search space.
One problem at a time. Building consistency. 🚀
#DSA#LeetCode
Day 16/100..
Worked on binary search today, solving Find Peak Element and understanding how slope-based decisions make the search more efficient.
Small improvements, stronger fundamentals. Consistency over everything.
#100DaysOfCode#DSA#LeetCode
Day 16/100..
Worked on binary search today, solving Find Peak Element and understanding how slope-based decisions make the search more efficient.
Small improvements, stronger fundamentals. Consistency over everything.
#100DaysOfCode#DSA#LeetCode
Day 15/100
Solved LeetCode 540: Single Element in a Sorted Array.
Practiced binary search with edge cases and optimized the solution to O(log n) time and O(1) space.
One problem at a time. Staying consistent.
Day 15/100
Solved LeetCode 540: Single Element in a Sorted Array.
Practiced binary search with edge cases and optimized the solution to O(log n) time and O(1) space.
One problem at a time. Staying consistent.
Day 14/100
Solved 3 problems on rotated sorted arrays:
Search I, Search II, and Find Minimum.
Getting more comfortable with the patterns behind Binary Search.
#DSA#LeetCode#100DaysOfCode
Day 14/100
Solved 3 problems on rotated sorted arrays:
Search I, Search II, and Find Minimum.
Getting more comfortable with the patterns behind Binary Search.
#DSA#LeetCode#100DaysOfCode
Day 13/100 — Binary Search: First & Last Occurrence + Count of Occurrences.
Used lower_bound and upper_bound to find the range efficiently in a sorted array. ..O(log n)
#DSA#100DaysOfCode#LeetCode
Day 13/100 — Binary Search: First & Last Occurrence + Count of Occurrences.
Used lower_bound and upper_bound to find the range efficiently in a sorted array. ..O(log n)
#DSA#100DaysOfCode#LeetCode
Day 12/100 — Upper Bound
Practiced implementing Upper Bound using STL’s upper_bound() and understood how to get the first element greater than a given value in a sorted array.
Slowly getting more comfortable with binary search patterns, including LC 35.