In this post, we will discuss division of two numbers (integer or decimal) using Binary Search (Divide and Conquer) Algorithm.
Given a M x N binary matrix, fill it with alternating rectangles of 0 and 1.
Find all N-digit binary numbers with equal sum of left and right half. N varies from [1-9] and binary number should not start with 0.
In this post, we will see how to traverse the given directory and list out all files present in it and all its sub-directories.
Given a set S, generate all distinct subsets of it i.e., find distinct power set of set S. A power set of any set S is the set of all subsets of S, including the empty set and S itself.
Given a string, find minimum cuts needed to partition it such that each partition is a palindrome.
Given a binary tree, write an iterative algorithm to print leaf to root path for every leaf node of binary tree. Use of Recursion is prohibited.
Given a sorted array of integers, find floor and ceil of a given number in it. The floor and ceiling map the given number to the largest previous or the smallest following integer, respectively.
Given a binary search tree, find a pair with given sum present in it.
Given a directed acyclic graph (DAG) and a source vertex, find the cost of shortest path from source vertex to all other vertices present in the graph.
Given a binary tree, write an efficient algorithm to compute maximum width of it.
Consider a directed graph where weight of its edges can be one of x, 2x or 3x (x is a given integer), compute the least cost path from source to destination efficiently.