## Generate Binary Strings of length N using Branch and Bound

The task is to generate a binary string of length N using branch and bound technique Examples: Input: N = 3 Output: 000 001 010… Read More »

- Why companies like Amazon, Microsoft, Google focuses on Data Structures and Algorithms : Answered
- Design a Chess Game
- Coin Change | BFS Approach
- Live Classes for Data Structures and Algorithms: Interview Preparation Focused Course
- Complexity Analysis of Binary Search
- Count of integers of length N and value less than K such that they contain digits only from the given set
- Find maximum meetings in one room
- Rearrange characters in a string such that no two adjacent are same using hashing
- Merge two BSTs with constant extra space
- Program to generate all possible valid IP addresses from given string | Set 2
- Count number of ways to reach destination in a maze
- Find a triplet in an array whose sum is closest to a given number
- Rearrange numbers in an array such that no two adjacent numbers are same
- Lexicographically Smallest Topological Ordering
- Playfair Cipher with Examples
- Maximum Length Chain of Pairs | Set-2
- Sort an array of strings based on the frequency of good words in them
- Print a given matrix in spiral form using direction tracking method
- Flatten Binary Tree in order of Level Order Traversal
- Algorithms Sample Questions | Set 3 | Time Order Analysis
- Count of triplets that satisfy the given equation
- Maximum number of nodes which can be reached from each node in a graph.
- Check whether an array can be made strictly decreasing by modifying at most one element
- Reverse tree path using Queue
- Find maximum path sum in a 2D matrix when exactly two left moves are allowed
- Maximum Sequence Length | Collatz Conjecture
- Program to Calculate e^x by Recursion
- Cartesian tree from inorder traversal | Segment Tree
- Implementation of BFS using adjacency matrix
- Find maximum and minimum element in binary tree without using recursion or stack or queue

The task is to generate a binary string of length N using branch and bound technique Examples: Input: N = 3 Output: 000 001 010… Read More »

Given an array arr[] of N elements where each arr[i] is the cumulative sum of the subarray P[0…i] of another array P[] where P is… Read More »

Given two integers N and K, the task is to find the count of set bits in the Kth number in the Odd-Even sequence made… Read More »

Given two integers A and B, the task is to find an integer X such that (X XOR A) is minimum possible and the count… Read More »

Given three integers P, Q and N where P < Q, the task is to compute the fraction value of P / Q and find… Read More »

Given N dependencies of the form X Y, where X & Y represents two different tasks. The dependency X Y denotes dependency of the form… Read More »

Given a tree with N vertices numbered from 0 to N – 1 and Q queries containing nodes in the tree, the task is to… Read More »

Given a tree with N vertices numbered from 0 to N – 1 and Q query containing nodes in the tree, the task is to… Read More »

Given a number N, the task is to form N (from 0) by adding 1 or 2 in the minimum number of operations X such… Read More »

Given an array arr[] of N integers where arr[i] is the height of the ith chocolate and all the chocolated are 1 unit wide, the… Read More »

Given a number N, the task is to set, clear and toggle the K-th bit of this number N. Setting a bit means that if… Read More »

Given a matrix, the task is to convert the given Matrix into sorted Spiral Matrix. Examples: Input: y[][] = { { 2, 5, 12 },… Read More »

Given a number n, the task is to determine whether n can be a factorial of some number x Examples: Input: N = 24 Output:… Read More »

Given an array arr[] of N integers, the task is to find the maximum mod value for any pair (arr[i], arr[j]) from the array. Examples:… Read More »

Given two arrays A[] and B[]. The second array B[] contains all the elements of A[] except for 1 extra element. The task is to… Read More »