Problem Statement:
You are given 3 types of parentheses (),{},[]. Now you are supposed to check whether a given string containing some parentheses is closed or not.
algorithm
Knight Tour Problem (Graph – Breadth First Search)
Knight Tour Problem : Given a chess board of size n x n, initial position of knight and final position of knight. We need to find the minimum number of steps required to reach final … Read More
Find next greater number with same set of digits
Given a number n, find the smallest number that has same set of digits as n and is greater than n. If x is the greatest possible number with its set of digits, then print
Implement a generic binary search algorithm for Integer Double String etc
A Simple Binary Search for Integers
BinarySearch(A[0..N-1], value)
{
low = 0
high = N - 1
while (low <= high) {
mid = low + ((high - low) / 2)
if (A[mid] > value)