Print Power Set of a Set of character.
Power Set Power set P(S) of a set S is the set of all subsets of S. For example S = {a, b, c} then P(s) =
Adobe Interview Questions
Maximum difference between two elements s.t larger element appears after the smaller number
Find maximum profit if you can buy & sell share just once.
Given an array of integers, find out the difference between any two elements such that larger element appears after the smaller number.
Examples: … Read More
‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.
A building has n steps. A person can take 1,2 or 3 steps. In how many ways can a person reach top of building.
In order to build logic, lets think from first step
If … Read More
How strtok() Works
strtok() : Split string into tokens
Syntax :
char * strtok ( char * str, const char * delimiters );
Parameters
str C string to truncate.Notice that this string is modified by being broken into … Read More
Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech
Couple of years ago when me and my friends appeared for campus interviews in IITs, NITs and BITs we faced many challenging interview questions like N petrol bunks arranged in a city, Sort Stack … Read More
Difference between a LinkedList and a Binary Search Tree BST
Pointers
In a linked list, the items are linked together through a single next pointer.
Next Nodes
In a binary tree, each node can have 0, 1 or 2 subnodes, where (in case of a … Read More
Check if an array has duplicate numbers in O(n) time and O(1) space
We have array a[ ]= {1, 2, 3, 4, 5, 6, 7, 8, 4, 10};
And we need to find a number which is duplicate in O(n) and Space complexity O(1)
Method 1 ) Sorting
Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?
you have 100 doors in a row that are all initially closed. you make 100 passes by the doors starting with the first door every time. the first time through you visit every door and
… Read More N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?
Consider above question with specific input.
Consider a series in which 8 teams are participating. Each team plays twice with all other teams.
4 of them will go to the semi final.
Minimum and Maximum
… Read More Consider a series in which 8 teams are participating. Each team plays twice with all other teams.
4 of them will go to the semi final.
Minimum and Maximum
Given a sorted array and a number x, find the pair in array whose sum is closest to x
Given a sorted array and a number x, find a pair in array whose sum is closest to x.
Examples:
Input: arr[] = {10, 22, 28, 29, 32, 40}, x = 54
Output: 22 and