## Number of unique permutations starting with 1 of a Binary String

Given a binary string composed of 0’s and 1’s. The task is to find the number of unique permutation of the string which starts with… Read More »

Given a binary string composed of 0’s and 1’s. The task is to find the number of unique permutation of the string which starts with… Read More »

Given two unsorted arrays of same size, the task is to check if two arrays are permutations of each other or not. Examples: Input: arr1[]… Read More »

Given a string where, . Assume that all the characters in are unique. The task is to compute the minimum length of a string which… Read More »

Given N, the number of persons. The task is to arrange N person around a circular table. Examples: Input: N = 4 Output: 6 Input:… Read More »

Given a large number N and the task is to check if any permutation of a large number is divisible by 8. Examples: Input: N… Read More »

Given two numbers N and M. Construct maximal number by permuting (changing order) the digits of N, not exceeding M. Note : It is allowed… Read More »

Given a number x, find it’s palindromic selfie number according to selfie multiplicative rule. If such a number doesn’t exist, then print “No such number… Read More »

This was a pool campus conducted by amazon for internship. Online Round: There were 20 mcq(+1 for each) and 2 coding questions(+30 for each). MCQ had… Read More »

Round 1: Online Round(90 minutes) There were 20 MCQs and two coding questions. MCQs were mostly logical reasoning, running time and DS/Algo. There were also… Read More »

We need to make a string of size n. Each character of the string is either ‘R’, ‘B’ or ‘G’. In the final string there… Read More »

Given two integers n and k. Consider first permutation of natural n numbers, P = “1 2 3 … n”, print a permutation “Result” such… Read More »

It was a very good experience to face interview at Qualcomm (Hyderabad-2016) I have attended the interview for a position of Software Engineer and My… Read More »

Given an array, an inversion is defined as a pair a[i], a[j] such that a[i] > a[j] and i < j. We are given two… Read More »

Given n distinct digits (from 0 to 9), find sum of all n digit numbers that can be formed using these digits. It is assumed… Read More »

Given two strings in lowercase, find the longest string whose permutations are subsequences of given two strings. The output longest string must be sorted. Examples:… Read More »