Echo's Home

You are given a large integer represented as an integer array digits, where each digits[i] is the i^th digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0‘s.

62. Unique Paths

Posted on 2024-12-23 Edited on 2025-10-25 In Leetcode

62. Unique Paths

Description

There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move either down or right at any point in time.

57. Insert Interval

Posted on 2024-12-22 Edited on 2025-10-25 In Leetcode

57. Insert Interval

Description

You are given an array of non-overlapping intervals intervals where intervals[i] = [start_i, end_i] represent the start and the end of the i^th interval and intervals is sorted in ascending order by start_i. You are also given an interval newInterval = [start, end] that represents the start and end of another interval.

56. Merge Intervals

Posted on 2024-12-22 Edited on 2025-10-25 In Leetcode

56. Merge Intervals

Description

Given an array of intervalswhere intervals[i] = [start<sub>i</sub>, end<sub>i</sub>], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

55. Jump Game

Posted on 2024-12-22 Edited on 2025-10-25 In Leetcode

55. Jump Game

Description

You are given an integer array nums. You are initially positioned at the array’s first index , and each element in the array represents your maximum jump length at that position.