Nitin

BAN USER

Software Engineer at Oracle

Questions (5)

Comments (19)

Followers (8)

Reputation 100

0

of 0 votes

17
Answers
You have given two polynomials .. You have to choose a data structure which will be used for addition of both polynomials :-
Condition :-
polynomials are very huge ..(n is very big)
a + bx +cx2 +...... +nxn ..
c + dx +ex2+...... +nxn ..
you have to store the polynomial after sum .
- Nitin in India | Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer
0

of 0 votes

34
Answers
Write a program / Aggorithm to solve generalized M liter and N liter Jug problem which will tell to the user whether K liter is possible or not from the M and N .
For Example :-
M=3 and N=4 and K=5 . Its possible to produce 5 liter with the help of 3 and 4 liter . He wanted to have a running algo/code for the same .
- Nitin in - | Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer
0

of 0 votes

82
Answers
You have given a positive number you have to find a number which is bigger than that by using same digits available in the number .
Example :-
You have given a number 7585 , your output should be 7855 .
- Nitin in India | Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm
0

of 0 votes

5
Answers
design a data structure for a phone address book with 3 fields
name, phone number , address
one must be able to search this phone book on any of the 3 fields
- Nitin in India | Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer
0

of 0 votes

8
Answers
Design a mechanism which can aquire lock on all the objects (More than 1) and attributes of a method with out using Synchronized method , synchronize block or volatile keyword .After that he asked me to implement the same on two two objects i.e. On a multithreaded environment we need to need to send data to printer as well as on screen (It should be in sync ) and if other thread is already using any of the resource then wait till the time when both the resources are available .
- Nitin | Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm

Page:

Comment hidden because of low score. Click to expand.

of 0 vote

Nice 1 :)

- Nitin March 04, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

I don't think so that its O(N) , You are visiting every node N times .. So it will be O(N * N)=O(N2)

- Nitin March 02, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

hey manan we have to store initial ds also its coming in form of stream .

- Nitin January 30, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

ASM :- can you give a idea how will you do it through map ?

- Nitin January 30, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

aclear16 :-
Dude interviewer is mentioning that n is very large so its better to go with the Link list only because u can utilize memory which is scattered .

- Nitin January 30, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

Rakesh u r code will not give a combination more than 2 numbers for example for this mentioned question pairs may be [7,1,2],[5,3,2] etc etc .

- Nitin January 29, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

it will not work for 1221

- Nitin January 24, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

It will give wrong result for 29 .. XXXI but it should be XXIX

- Nitin January 24, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

Take a example of 13283
Your code will 13382 but the answer is 13328 .

- Nitin January 24, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

Second part is a example of zigzag traversal , that can be achieved with the help of 2 stacks !

- Nitin January 13, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

I am agree with you Anon . I think finding GCD is the most suitable problem for this question .

- Nitin September 21, 2011 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

Nice solution !!

- Nitin September 21, 2011 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

wt abt 73741 ??

- Nitin September 21, 2011 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

Nice solution .
But Complexity will be more in this case .

- Nitin September 20, 2011 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

Cinderella ,
Take a example of 7684 ..!!
According to you it should be 7864 but the answer is 7846 !! :)
You are very close to the solution !!

- Nitin September 19, 2011 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

Sorry .. Interviewer told me to use same digits with same number of time, coming in positive integer and if a small number is not possible then we have to return -1

- Nitin September 19, 2011 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

Question mention that immediate bigger number ..

- Nitin September 19, 2011 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

It will no be over .. :)
Ex :- 102
Answer should be 120 but if u will sort it will result in 210 ;)
Complexity will be increase if you will take larger digits !!

- Nitin September 19, 2011 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

We need in place no extra buffer is allowed !!

- Nitin September 17, 2011 | Flag Reply

Page:

0
Rep
DustinSeals, Accountant at 247quickbookshelp

I am Dustin . Speech-language pathologist in Standard Brands Paint Company. I diagnose and swallow problems. I work with both children ...
0
Rep
lonnacribbs, DIGITAL MARKETING at Athena Health

I am a Market Research Manager responsible for selecting the appropriate research methodology and supporting techniques to meet a defined ...
350
Rep
angelwilley8, xyz at Asiatic Solutions

I am Angel J. Willey from Gurnee. I am working as a truck driver in Asiatic Solutions company. I also ...
0
Rep
marthajpatton, Data Scientist at AppPerfect

Managed a small team implementing gravy in Prescott, AZ. Developed several new methods for easy break up spells.Had some ...
510
Rep
rohitrana0777, Animator at AMD

I am work in free lancing as a editor in web developer. I also like play sports. I like kabaddi ...
0
Rep
thonylermat, OOPS Experienced at 247quickbookshelp

I have been assigned based on the successful candidate's level of training and experience but will include types of ...
10
Rep
pathfisher, Animator at Rack N Sack

I am Pat working in Rack N Sack where I use sequential images to produce the illusion of movement and ...
0
Rep
LuciaLuci, Animator at Barclays Capital

I am Lucia, a Neuropsychologist in Philadelphia USA . aiming to understand how behavior and cognition are influenced by brain function ...

Add Question

CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.

How Can You Help CareerCup?

Find Out When Gayle / CareerCup / Cracking the Coding Interview is in Your City

Report a Bug or Issue

CareerCup

Nitin

Books

Videos

Resume Review

Mock Interviews