S.A.M
BAN USER- 0of 0 votes
AnswersGiven two strings, you need to transpose the first string to the second string by means of only swaps between 2 consecutive characters in the first string. This must be performed by doing a series of these swaps in order to get the second string
- S.A.M in United States| Report Duplicate | Flag | PURGE
Epic Systems Software Engineer / Developer Java - 0of 0 votes
AnswersVerify if the given password is valid/invalid;
- S.A.M in United States
1. must be 5-12 characters long
2. must contain atleast one number and one lowercase character
3. a sequence must not be followed by the same sequence (like 123123qs is invalid, 123qs123 is valid)| Report Duplicate | Flag | PURGE
Epic Systems Software Engineer / Developer Java - 0of 0 votes
AnswersVerify if the given password is valid/invalid;
- S.A.M in United States
1. must be 5-12 characters long
2. must contain atleast one number and one lowercase character
3. a sequence must not be followed by the same sequence (like 123123qs is invalid, 123qs123 is valid)| Report Duplicate | Flag | PURGE
Epic Systems Software Engineer / Developer Java - 0of 0 votes
AnswersYou are a hacker and need to find possible passwords given the length of the password and that it is a well-ordered number (eg., 123 is well-ordered as 1<2<3 and 213 is not well-ordered as 2<1<3 is NOT true)
- S.A.M in United States| Report Duplicate | Flag | PURGE
Epic Systems Software Engineer / Developer Java - 0of 0 votes
AnswersTake a series of integers as input till a zero is entered. Among these given integers, find the maximum of the odd numbers and the minimum of the even integers (not including zero) and print them.
- S.A.M in United States| Report Duplicate | Flag | PURGE
Epic Systems Software Engineer / Developer Java
same doubt as oni;
- S.A.M March 15, 2012n-way merge sort -> nlogn (base n) which is O(n) + O(n)-> this for merge step which will result in linear time O(n) time for the mergesort right.
As for k-way merge, O(nlogn (base k))