Difficulty - Medium

Program to check whether x ( 2 <= x <= 10^100) is divisible by y ( 2 <= y <= 10^6)


Given a number, return the next multiple of 64 that follows it, using bit operations and no loops. e.g input = 90, return 128.


Implement an algorithm to print all valid combination of n – pairs of parentheses properly opened and closed.


Non-Recursive implementation of Preorder Traversal in a binary Tree / BST.


Non-Recursive implementation of Inorder Traversal of Binary Tree/ BST.


Non-Recursive Implementation of Post order traversal in BInary Tree/ BST.


Given a character array as input. Array contains only three types of characters 'R', 'G' and 'B'. Sort the array such that all 'R's comes before 'G's and all 'G's comes before 'B's. Constraint: - No extra space allowed (except O(1) space like variables) and minimize the time complexity. You can only traverse the array once.

ROBOT MEET PROBLEM.


Given an array of arbitrary integers, count the no. of inversion pairs where inversion pair is defined as A[i] > A[j] and i < j .


Boundary traversal or printing border nodes of a binary tree.

Given 2 sorted arrays of size m and n+m(with n elements) , merge them into the latter.

A sorted array is rotated right by some number. Find the smallest element in O(log n).

Remove all occurrences of a string from another string.

Reverse words of a string without using extra space. 

Without using extra space place all zeroes to left and 1's to right from an array of Zero's and 1's as below 011001 ans. 000111

Find 2 elements in an array such that their sum is equal to a given number. o(nlogn)

Given a number and its permutation, how can we find out the number of transformations by which the number could be transformed into its permutation ? eg: 2315 and 5213 are given. 2315 can be transformed into 5213 in a series of 2 transformations.

Calculate a to the power of b in o(log b) complexity.

Reverse a linked list recursively (reverse function) Reverse a linked list iteratively (i_reverse function).

Reverse first k elements of linked list.

Inorder and Preorder tree traversal without recursion.

Find 3 numbers in the given array such that their sum is equal to a given number.