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 32

Generate next palindrome number

Several Companies like MS, Amazon and Flipkart has started asking this question to generate next number which is palindrome.

Say K is given, Generate N such that N is palindrome and N > K.

Implement LRU Cache

Generally Interviewer can ask you simply to implement LRU cache, first explain which data structure you will use and why.

Its well known coding question being asked by all Tech giants like Amazon , Flipkart, Microsoft. 

LRU (Least Recently Used) Cache holds Page numbers which are recently used and throws out old or least recently used page number or entries.

Get Minimum element in O(1) from input numbers

Question : Get Minimum element in O(1) from input numbers..

- With any traditional way we can't get minimum element in O(1)
- so we need to come up with different data structure.
- As its very old and famous question We are directly explaining logic

CodeChef Code SGARDEN

This time Sheriff gathered all the bandits in his garden and ordered them to line up. After the whistle all bandits should change the order in which they stand.
Sheriff gave all the bandits numbers from 1 to N. For each place i he determined the unique position j. After whistling the bandit staying on position i should run to the j-th position. Sheriff loved seeing how the bandits move around, and he continued whistling until the evening. He finished the game only when he noticed that the bandits are in the same order in which they were standing originally.
Now the Sheriff asks the question: How many times has he whistled?

Printing each word in string backwards

Below is the code to print each word backward
Example if Input is "This is Sparta"
Out put should be  "sihT si atrapS"

Find next greater number with same set of digits

Given a number n, find the smallest number that has same set of digits as n and is greater than n. If x is the greatest possible number with its set of digits, then print “not possible”.

Find the kth number with prime factors 3, 5 and 7

Find the kth number with prime factors 3, 5 and 7

Design an algorithm such that we have to find the k th element in the array such that their only prime factors are 3,5 an 7.
Example: Array will contain 1,3,5,7,9,15,21,25,...
We have to return the kth element in array

Print vertical sum of all the axis in the given binary tree

Print Vertical Sum of all the axis in the given binary Tree.

Most of times in written test , you will encounter this very good question.

given a binary tree.

(most of times a complete binary tree with all leaf node at same height will be given)

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it.

25 horses 5 tracks Find 3 fastest puzzle

Suppose you have 25 horses, and you want to pick the fastest 3 horses out of those 25. In each race, only 5 horses can run at the same time in a race because there are only 5 tracks. What is the minimum number of races required to find the 3 fastest horses without using a stopwatch?

Write a function flatten() which flattens this link list with each node down sorted link list to a single link list with all the elements in sorted order

Write a function flatten() which flattens this link list with each node down sorted link list to a single link list with all the elements in sorted order.

We have given Two methods in O(n^2) here.
for different linked list.

Length of the longest substring without repeating characters

Length of the longest substring without repeating characters

Method 1 (Brute Force Method)
We can consider all substrings.
One by one and check for each substring whether it contains all unique characters or not. 
There will be n*(n+1)/2 substrings. 

Amazon Interview On-Campus For Internship - 1

Amazon Interview On-Campus For Internship - 1  

Online Round Coding Question:

Q1. Given a float number 7.64, convert it into the string WITHOUT using any inbuilt function/library.
for eg:
input
float no.: 7.64
output
string: 7.64
Answer : Click here 

Q2. Given the inorder and preorder traversals of a Binary Tree, output the postorder traversal of it.
Answer : Click here

Get K Max and Delete K Max in stream of incoming integers

Get K Max and Delete K Max in stream of Incoming Integers 

Solution 1 : Using Min Heap

Algorithm :

1) Keep a Min & Max Heap of K size
2) Store first K elements in them.
3) If a new element comes with smaller or larger than root then reorder   heap.

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Given n stairs, how many number of ways can you climb if u use either 1, 2 or 3 at a time?

When you find any difficult problem first step is to reduce it to very small problem with example

Consider 3 steps. you can take only one at a time. Then number of ways are 1: ie {(1,1,1)}

Consider 2 steps. you can take 1 or 2 at a time. Then number of ways are 2: ie {(1,1), (2)}

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Given an array A[] and a number x, check for pair in A[] with sum as x

Write a C program that, given an array A[] of n numbers and another number x, determines whether or not there exist two elements in S whose sum is exactly x.

There can be several ways to do, what we found are two methods.

1 ) Using Sort input Array                                           2) Using Hash Map

strtok()

Function Strtok

char * strtok ( char * str, const char * delimiters );                                   

What it does : Split string into tokens

A sequence of calls to this function split str into tokens, 

which are sequences of contiguous characters separated by any of 

the characters that are part of delimiters

Example

ADOBE Aptitude C Language Written Test

Section 1 : Aptitude .
Section 2 : C Language and WAP.

Aptitude

George adores classical music. He always prefers Beethoven to Bartok and Mahler to Mozart. He prefers
Haydn to Hindernith and Hlitdeiulth to Mozart. He always prefers Mahler to any whose name begins with B,
except Beethoven, and he always chooses to listen to a he prefers.

Adobe Interview 8 month Exp (Off-Campus)

Adobe Off-Campus Interview Set 1

For Experience : 8 months

First Round :
Held on interview street Aptitude + Technical (standard pattern and questions)
See Sample : Click Here

Second Round (f2f): 
Started of with the discussion of trees. Like what is a tree/BST ?

Implement insertion in tree (Java).

Answer :Click Here