Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an adjacent number…
Browsing: Intermediate
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum…
You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to…
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…
Geek is going for a training program for n days. He can perform any of these activities: Running, Fighting, and Learning Practice. Each activity…
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money…
Consider a rat placed at position (0, 0) in an n x n square matrix mat[][]. The rat’s goal is to reach the…
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any…
Find all valid combinations of k numbers that sum up to n such that the following conditions are true: Return a list of all possible…
Given a array arr of integers, return the sums of all subsets in the list. Return the sums in any order. Here’s…