Abhisek Kumar Gupta

icon location India, Bangalore icon location Always Learning~

Results 18 issues of Abhisek Kumar Gupta

Dynamic Programming: Suppose we have a m by n matrix filled with non-negative integers, find a path from top left corner to bottom right corner which minimizes the sum of all numbers along its path in Javascript

Example: Input: [ [1,3,1], [1,5,1], [4,2,1] ] Output: 7 Explanation: Because the path 1 → 3 → 1 → 1 → 1 minimizes the sum.

Dynamic Programming
Matrix

Dynamic Programming: Suppose we have a m by n matrix filled with non-negative integers, find a path from top left corner to bottom right corner which minimizes the sum of all numbers along its path in Java

Example: Input: [ [1,3,1], [1,5,1], [4,2,1] ] Output: 7 Explanation: Because the path 1 → 3 → 1 → 1 → 1 minimizes the sum.

Dynamic Programming
Matrix

Dynamic Programming: Suppose we have a m by n matrix filled with non-negative integers, find a path from top left corner to bottom right corner which minimizes the sum of all numbers along its path in C++

Example: Input: [ [1,3,1], [1,5,1], [4,2,1] ] Output: 7 Explanation: Because the path 1 → 3 → 1 → 1 → 1 minimizes the sum.

Dynamic Programming
Matrix

Dynamic Programming: Suppose we have a m by n matrix filled with non-negative integers, find a path from top left corner to bottom right corner which minimizes the sum of all numbers along its path in Go

Example: Input: [ [1,3,1], [1,5,1], [4,2,1] ] Output: 7 Explanation: Because the path 1 → 3 → 1 → 1 → 1 minimizes the sum.

Dynamic Programming
Matrix

Heap: Given an integer array nums and an integer k, return the k most frequent elements in C++

2 comment

Heap
Array

Heap: Given an integer array nums and an integer k, return the k most frequent elements in Go

Heap
Array

Heap: Given an integer array nums and an integer k, return the k most frequent elements in Java

Heap
Array

Heap: Given an integer array nums and an integer k, return the k most frequent elements in Javascript

Heap
Array