aniketnit
BAN USER- 0of 0 votes
AnswersWrite a programme to produce all permutations of a given string where
- aniketnit in India
characters are not unique. That means you are not allowed to print the
duplicate strings.
Ex:
If input is aaa
The output should be only aaa| Report Duplicate | Flag | PURGE
Software Engineer / Developer Algorithm - 0of 0 votes
AnswersYou are given a word and a dictionary. Now propose an algorithm edit
- aniketnit in India for Retail
the word (insert / delete characters) minimally to get a word that
also exists in the dictionary. Cost of insertion and deletion is same.
Write pseudocode for it.
Seems like minimum edit distance problem but some modification is
needed.| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 1of 1 vote
AnswersSuppose there is a circle. You have five points on that circle. Each
- aniketnit in India
point corresponds to a petrol pump. You are given two sets of data.
1. The amount of petrol that petrol pump will give.
2. Distance from that petrol pump tp the next petrol pump.
(Assume for 1 lit Petrol the truck will go 1 km)
Now calculate the first point from where a truck will be able to
complete the circle.
(The truck will stop at each petrol pump and it has infinite
capacity).
Give o(n) solution. You may use o(n) extra space.| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Coding
Dude, I think that would be Longest Common Substring instead of Longest Common Subsequence :)
- aniketnit November 22, 2011