Data Structures and Algorithms

[BVishal-Geek]

Solved 2 problems on Sqrt using Binary Search, and Pow problems.

[BVishal-Geek]

Solved 2 binary search problems - Division and number search problem.

[BVishal-Geek]

Solved duplicate number, peak number, First bad number using binary search.

[BVishal-Geek]

Solved median of two sorted arrays:

class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: merge = nums1 + nums2 merge.sort()

    left, right = 0, len(merge)

    mid = left + (right-left)//2

    if len(merge)%2==0:
        return (merge[mid] + merge[mid-1])/2

    else: 
        return merge[mid]

Solved in O(m+n) log(m+n) but need to find next optimal code with only O(m+n)

[BVishal-Geek]

11. Contain Most Water:

Trying to solve it through brute force method -> 29 / 62 testcases passed

class Solution: def area(l,b): return l*b def maxArea(self, height: List[int]) -> int: highest_num = 0 largest_area = 0 index = 0 for i in range(len(height)):

        if highest_num<height[i]:
            highest_num = height[i]
            index = i

    for j in range(len(height)): 

        if highest_num == height[j]:
            largest_area = max(largest_area, self.area(highest_num, abs(index - j)))

        else: 
            largest_area = max(largest_area, self.area(height[j], abs(index - j)))

    return largest_area