anubhav.workemail
BAN USER
Questions (2)
Reputation 50
- 1of 1 vote
AnswersGiven a sequence of n random numbers: suppose: 1,5,7,3,...
- anubhav.workemail in India
and n-1 symbols of <,> in the given fashion:
_<_>_>_>.....
the task is to fill the blank best possible time complexity. (I solved upto O(nlogn))| Report Duplicate | Flag | PURGE
Adobe Quality Assurance Engineer - 0of 0 votes
AnswersQ1. Given array a[]={'a','n','u','b','h','a','v'}
- anubhav.workemail in India
You have to generate a[]={'v','a','h','b','u','n','a'} in the same array with space complexity O(1). You may use just one bit extra.
Q2. perform the same operation with the same constraints for
array a[]={'m','y',' ','n','a','m','e',' ','i','s',' ','a','n','u','b','h','a','v'}
Q3 Perform the same operation with same contraints to arrange the words in alphabetic order, ie the output array should be:
a[]={'a','n','u','b','h','a','v',' ','i','s',' ','m','y',' ','n','a','m','e'}| Report Duplicate | Flag | PURGE
Adobe Quality Assurance Engineer Algorithm
Page:
1
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.