## Find two non-overlapping pairs having same sum in an array

Given an unsorted array of integers, find two non-overlapping pairs in it having same sum.

Coding made easy

Given an unsorted array of integers, find two non-overlapping pairs in it having same sum.

In Pots of gold game, there are two players A & B and pots of gold arranged in a line, each containing some gold coins. The players can see how many coins are there in each gold pot and each player

Given a binary tree, write an efficient algorithm to print right view of given binary tree.

Given a directed acyclic graph (DAG), print it in Topological order using Kahn’s Topological Sort algorithm. If the DAG has more than one topological ordering, print any of them.

Given an integer, swap adjacent bits of it. In other words, swap bits present at even positions with those present in odd positions.

Given a BST and a valid range of keys, remove nodes from BST that have keys outside the valid range.

Given a sequence of numbers such that the difference between the consecutive terms is constant, find missing term in it in O(log(n)) time.

In this post, we will see how to find all lexicographic permutations of a string where repetition of characters is allowed.

In this post, we will discuss division of two numbers (integer or decimal) using Binary Search Algorithm.

Given an array of integers, find subarrays with given sum in it.

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.