Design a Moving Average Class for Data Stream
Given a stream of integers and a window size, calculate the moving average of all integers in the sliding window. Example: MovingAverage m = new MovingAverage(3); m.next(1) = 1 …
Tag: algorithms
Finding the Predecessor and Successor Node of a Binary Search Tree
August 31, 2020
algorithms, Binary Tree, c / c++, C/C++, code, data structure, interviews, Java, programming languages, Python
6 Comments
A Binary Search Tree (BST) is a commonly used data structure that can be used to search for an item in O(LogN) time. A BST has the following characteristics: …
How to Partition a String into Palindromes using DFS Algorithm?
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Example: Input: “aab” Output: , ] …
How to Find Root of N-Ary Tree using the Hash Set?
Given all the nodes of an N-ary tree as an array Node tree where each node has a unique value. Find and return the root of the N-ary tree. …
Can We Make Arithmetic Progression From Sequence of Numbers?
Given an array of numbers arr. A sequence of numbers is called an arithmetic progression if the difference between any two consecutive elements is the same. Return true if …