Abhisek Kumar Gupta

India, Bangalore Always Learning~

Results 18 issues of


                                            Abhisek Kumar Gupta

add repository's path in lexicographic order

1

comment

#### ℹ️ Repository information [Repository's Issues Link](https://github.com/akgmage/data-structures-and-algorithms/issues) **The repository has**: - [x] At least three issues with the `good first issue` label. - [x] At least 10 contributors. - [x]...

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

2

comment

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 Python

2

comment

Heap

Array

Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level) in C++

Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level) in Go

Heap: Given a n x n matrix where each of the rows and columns are sorted in ascending order, findthe kth smallest element in the matrix in Python

Note that it is the kth smallest element in the sorted order, not the kth distinct element. Example: Input: matrix = [ [ 1, 5, 9], [10, 11, 13], [12,...

Heap

Heap: Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix in Javascript

Note that it is the kth smallest element in the sorted order, not the kth distinct element. Example: Input: matrix = [ [ 1, 5, 9], [10, 11, 13], [12,...

Heap

Heap: Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix in Java

Note that it is the kth smallest element in the sorted order, not the kth distinct element. Example: Input: matrix = [ [ 1, 5, 9], [10, 11, 13], [12,...

Heap

Heap: Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix in C++

Note that it is the kth smallest element in the sorted order, not the kth distinct element. Example: Input: matrix = [ [ 1, 5, 9], [10, 11, 13], [12,...

Heap

Heap: Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix in Go

Note that it is the kth smallest element in the sorted order, not the kth distinct element. Example: Input: matrix = [ [ 1, 5, 9], [10, 11, 13], [12,...

Heap

1
2
›