Issues

• 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++

  akgmage/data-structures-and-algorithms#1789 · Filter by author akgmage opened on Nov 18, 2023

• 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

  akgmage/data-structures-and-algorithms#1788 · Filter by author akgmage opened on Nov 18, 2023

• 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

  Heap
  akgmage/data-structures-and-algorithms#1747 · Filter by author akgmage opened on Oct 15, 2023

• 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

  Heap
  akgmage/data-structures-and-algorithms#1746 · Filter by author akgmage opened on Oct 15, 2023

• 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

  Heap
  akgmage/data-structures-and-algorithms#1745 · Filter by author akgmage opened on Oct 15, 2023

• 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++

  Heap
  akgmage/data-structures-and-algorithms#1744 · Filter by author akgmage opened on Oct 15, 2023

• 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

  Heap
  akgmage/data-structures-and-algorithms#1743 · Filter by author akgmage opened on Oct 15, 2023

• 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

  Dynamic ProgrammingMatrix
  akgmage/data-structures-and-algorithms#1742 · Filter by author akgmage opened on Oct 14, 2023

• 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

  Dynamic ProgrammingMatrix
  akgmage/data-structures-and-algorithms#1741 · Filter by author akgmage opened on Oct 14, 2023
  2

  

• 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

  Dynamic ProgrammingMatrix
  akgmage/data-structures-and-algorithms#1740 · Filter by author akgmage opened on Oct 14, 2023

• 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++

  Dynamic ProgrammingMatrix
  akgmage/data-structures-and-algorithms#1739 · Filter by author akgmage opened on Oct 14, 2023

• 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

  Dynamic ProgrammingMatrix
  akgmage/data-structures-and-algorithms#1738 · Filter by author akgmage opened on Oct 14, 2023

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

  ArrayHeap
  akgmage/data-structures-and-algorithms#1728 · Filter by author akgmage opened on Oct 6, 2023
  2

  

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

  ArrayHeap
  akgmage/data-structures-and-algorithms#1727 · Filter by author akgmage opened on Oct 6, 2023

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

  ArrayHeap
  akgmage/data-structures-and-algorithms#1726 · Filter by author akgmage opened on Oct 6, 2023

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

  ArrayHeap
  akgmage/data-structures-and-algorithms#1725 · Filter by author akgmage opened on Oct 6, 2023
  2

  

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

  ArrayHeap
  akgmage/data-structures-and-algorithms#1724 · Filter by author akgmage opened on Oct 6, 2023