Linear Algorithm to Check If All 1’s Are at Least Length K Places Away
Given an array nums of 0s and 1s and an integer k, return True if all 1’s are at least k places away from each other, otherwise return False. …
Tag: coding exercise
Finding the Lucky Numbers in a Matrix
Given a m * n matrix of distinct numbers, return all lucky numbers in the matrix in any order. A lucky number is an element of the matrix such …
Using Depth First Search Algorithm to Delete Tree Nodes with Sum Zero in the Sub Tree
A tree rooted at node 0 is given as follows: The number of nodes is nodes; The value of the i-th node is value; The parent of the i-th …
How to Compute the Product of Last K elements in Array using the Prefix Product Algorithm?
Implement the class ProductOfNumbers that supports two methods: 1. add(int num) Adds the number num to the back of the current list of numbers. 2. getProduct(int k) Returns the …
Depth First Search Algorithm to Delete Insufficient Nodes in Root to Leaf Paths in Binary Tree
Given the root of a binary tree, consider all root to leaf paths: paths from the root to any leaf. (A leaf is a node with no children.) A …
