Piyush Keshari KeshariPiyush24

Question: 349. Intersection of Two Arrays

Intution:

Time Complexity: $$O(Nlog(M))$$

Space Complexity: $$O(1)$$

Solution:

Question: Row with max 1s

Intution: Not exactly binary search but we can utilize the fact that it the row is sorted. We have to use 2 pointers approach.

Time Complexity: $$O(n + m)$$

Space Complexity: $$O(1)$$

Solution:

Question: Frequency In A Sorted Array

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution:

Question: Implement Lower Bound

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution:

Question: Implement Upper Bound

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution:

Question: 153. Find Minimum in Rotated Sorted Array

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution:

Question: 367. Valid Perfect Square

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution:

Question: 441. Arranging Coins

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution:

Question: 744. Find Smallest Letter Greater Than Target

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution:

Question: 278. First Bad Version

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution: