## Path in a Rectangle with Circles

There is a m*n rectangular matrix whose top-left(start) location is (1, 1) and bottom-right(end) location is (m*n). There are k circles each with radius r.… Read More »

There is a m*n rectangular matrix whose top-left(start) location is (1, 1) and bottom-right(end) location is (m*n). There are k circles each with radius r.… Read More »

Given a binary tree containing n nodes. The problem is to find and print the largest value present in each level. Examples: Input : 1… Read More »

Queue is also an abstract data type or a linear data structure, which follows a particular order in which the operations are performed. The order… Read More »

Priority queues are a type of container adaptors, specifically designed such that the first element of the queue is the greatest of all elements in… Read More »

Given a binary tree containing n nodes. The problem is to check whether the given binary tree is a full binary tree or not. A… Read More »

Queue are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back… Read More »

Given a binary tree containing n nodes. The problem is to get the sum of all the leaf nodes which are at minimum level in… Read More »

Given a Binary Tree, find the deepest leaf node that is left child of its parent. For example, consider the following tree. The deepest left… Read More »

Write a function to print ZigZag order traversal of a binary tree. For the below binary tree the zigzag order traversal will be 1 3… Read More »

Given N boxes and their size in an array. You are allowed to keep a box inside another box only if the box in which… Read More »

Consider lines of slope -1 passing between nodes. Given a Binary Tree, print all diagonal elements in a binary tree belonging to same line. Input… Read More »