With Chinmay Murugkar

Tag: machine-learning

  • Merge Intervals

    Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input. Example 1: Input: intervals = [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlap, merge them into [1,6]. Example 2: Input: intervals = [[1,4],[4,5]] Output: [[1,5]] Explanation: Intervals [1,4]…

  • Binary Tree Vertical Order Traversal

    Given the root of a binary tree, return the vertical order traversal of its nodes’ values. (i.e., from top to bottom, column by column). If two nodes are in the same row and column, the order should be from left to right. Input: root = [3,9,20,null,null,15,7]Output: [[9],[3,15],[20],[7]]Input: root = [3,9,8,4,0,1,7]Output: [[4],[9],[3,0,1],[8],[7]] Vertical Order Traversal Algorithm Explained The vertical order traversal…