Category: greedy algorithm
Teaching Kids Programming: Videos on Data Structures and Algorithms Given two integer arrays pushed and popped each with distinct values, return true if this could have been the result …
Teaching Kids Programming: Videos on Data Structures and Algorithms Given a 0-indexed integer array nums, return true if it can be made strictly increasing after removing exactly one element, …
Teaching Kids Programming: Videos on Data Structures and Algorithms Given an integer num, return the number of steps to reduce it to zero. In one step, if the current …
Teaching Kids Programming: Videos on Data Structures and Algorithms You are given an integer array nums and an integer k. You want to find a subsequence of nums of …
Teaching Kids Programming: Videos on Data Structures and Algorithms Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence is a sequence that …
