data-structures-and-algorithms

data-structures-and-algorithms copied to clipboard

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

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.

akgmage

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

2

akgmage

akgmage

akgmage

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,...

akgmage

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,...

akgmage

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,...

akgmage

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,...

akgmage

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,...

akgmage

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.

akgmage