Check If an Array Represents a Max Heap (Danny Heap Algorithm)
Given a list of integers nums, return whether it represents a max heap. That is, for every i we have that: nums ≥ nums if 2*i + 1 is …
Author: ACMer
Teaching Kids Programming – Recursion in Five Minutes
Teaching Kids Programming: Videos on Data Structures and Algorithms The factorial function f(n) implemented in Python using Recursion: def f(n): if n == 1: return 1 return n * …
Counting Maximal Value Roots in Binary Tree using Depth First Search Algorithm
Given a binary tree root, count and return the number of nodes where its value is greater than or equal to the values of all of its descendants. For …
Find the Minimum Cost to Sort the Array in Ascending or Descending Order
Given a list of integers nums, return the minimum cost of sorting the list in ascending or descending order. The cost is defined as the sum of differences between …
Binary Search Algorithm to Find the Inverse of a Monotone Increasing Function
Given a Monotone Increasing Function f(x) and if y=f(x) is known, find the value of x. Find the x by Binary Search Algorithm Because function f(x) is monotone increasing …