Dimitris Ntantakas

Results 2 comments of


                                            Dimitris Ntantakas

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

I will try to solve it

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

I will try solving it!