Remove Duplicate Numbers by using a Hash Map
Given a list of integers nums, remove numbers that appear multiple times in the list, while maintaining order of the appearance in the original list. It should use O(k) …
Count Multiset Sum (Knapsacks) by Dynamic Programming Algorithm
March 31, 2021
algorithms, c / c++, dynamic programming, Dynamic Programming, Knapsack Problems, math
No Comments
Given a list of unique positive integers nums and a positive integer k, return the number of unique combinations that sum up to k. You may reuse numbers when …
Teaching Kids Programming – Longest Consecutive Run of 1s in Binary
Teaching Kids Programming: Videos on Data Structures and Algorithms Given a non-negative integer n, return the length of the longest consecutive run of 1s in its binary representation. Constraints …
Count Multiset Sum (Knapsacks) by Recursive BackTracking Algorithm
March 30, 2021
algorithms, c / c++, DFS, Dynamic Programming, Knapsack Problems, math, recursive
No Comments
Given a list of unique positive integers nums and a positive integer k, return the number of unique combinations that sum up to k. You may reuse numbers when …
Teaching Kids Programming – Breadth First Search Algorithm to Check the Completeness of a Binary Tree
Teaching Kids Programming: Videos on Data Structures and Algorithms Given the root of a binary tree, determine if it is a complete binary tree. In a complete binary tree, …
Teaching Kids Programming – Depth First Search Algorithm to Find the Only Child in Binary Tree
Teaching Kids Programming: Videos on Data Structures and Algorithms Given a binary tree root, return the number of nodes that are an only child. A node x is an …