### Find minimum path sum in a triangle-shaped matrix

Given a right-angled triangle-shaped matrix, find the shortest path sum from the top element to any element in the last row of the matrix.

Ace your Coding Interview

Get hired by top tech companies with our comprehensive interview preparation.

Get StartedGiven a right-angled triangle-shaped matrix, find the shortest path sum from the top element to any element in the last row of the matrix.

Given an integer array, find all distinct increasing subsequences of length two or more.

Given a row-wise and column-wise sorted square matrix and a positive integer `k`

, find the kth smallest number in the matrix.

Insert the specified interval into a collection of non-overlapping intervals that has been organized by the start time of each interval. If the new interval causes intervals to overlap, merge the overlapped intervals.

Given a linked list containing a cycle, return the starting node of the cycle without modifying the list. Report if there are no cycles in the linked list.

Given the string representation of a non-negative integer and an integer `k`

, find the smallest number that remains after taking out `k`

digits from it.

Given an array of distinct positive integers, find the total number of distinct permutations that add up to a given target, where each array element may be used any number of times.

Given four integer arrays, count the number of quadruplets with a zero sum, including exactly one element from each array.

Given a binary tree, where each node stores a value between 0 and 9, calculate the sum of the numbers created by the paths from root to leaf.

Given a positive integer `n`

and a target, find all combinations of distinct numbers in the interval `[1,9]`

of length `n`

that add up to the target.

Given an integer array, find the length of the longest subsequence with alternate low and high elements in the array.

An Eulerian trail (or Eulerian path) is a path in a graph that visits every edge exactly once. Given a directed graph, check whether it has an Eulerian path or not.