Echo's Home

65. Valid Number

Posted on 2025-01-18 Edited on 2025-06-14 In Leetcode

65. Valid Number

Description

Given a string s, return whether s is a valid number.

986. Interval List Intersections

Posted on 2025-01-17 Edited on 2025-06-14 In Leetcode

986. Interval List Intersections

Description

You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [start_i, end_i] and secondList[j] = [start_j, end_j]. Each list of intervals is pairwise disjoint and in sorted order .

38. Count and Say

Posted on 2025-01-17 Edited on 2025-06-14 In Leetcode

38. Count and Say

Description

The count-and-say sequence is a sequence of digit strings defined by the recursive formula:

31. Next Permutation

Posted on 2025-01-17 Edited on 2025-06-14 In Leetcode

31. Next Permutation

Description

A permutation of an array of integers is an arrangement of its members into a sequence or linear order.

3419. Minimize the Maximum Edge Weight of Graph

Posted on 2025-01-17 Edited on 2025-06-14 In Leetcode

3419. Minimize the Maximum Edge Weight of Graph

Description

You are given two integers, n and threshold, as well as a directed weighted graph of n nodes numbered from 0 to n - 1. The graph is represented by a 2D integer array edges, where edges[i] = [A_i, B_i, W_i] indicates that there is an edge going from node A_i to node B_i with weight W_i.

3418. Maximum Amount of Money Robot Can Earn

Posted on 2025-01-17 Edited on 2025-06-14 In Leetcode

3418. Maximum Amount of Money Robot Can Earn

Description

You are given an m x n grid. A robot starts at the top-left corner of the grid (0, 0) and wants to reach the bottom-right corner (m - 1, n - 1). The robot can move either right or down at any point in time.