Topic:competitive programming

Given a binary tree, we have to design an algorithm that will create a linked list of all the nodes at each depth or level. For example, if we have a tree with depth D, then there...

Sieve of Eratosthenes is an algorithm to find all prime numbers up to a given range. This concept is very important when it comes to competitive programming because it is the most efficient way to find all primes smaller...

We have to write an algorithm to print all possible combinations of the balanced valid parenthesis for n pairs of parenthesis. A valid parenthesis is one that is properly opened and closed. Example->  n...

A permutation is an act of rearranging or reordering elements of a set or string etc. For n elements, n! (n factorial) permutations are possible. Ex-> Possible permutations of abc are abc, acb, bac, bca, cab, cba. Here, given a string with...

A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a method to Count number of ways to reach the nth stair by climbing 1,...