Interview Questions Answers in C, C Code

umesh kumar kewat

{ City } hyderabad
< Country > india
* Profession * student
User No # 9658

Total Questions Posted # 1
Total Answers Posted # 1

Total Answers Posted for My Questions # 0
Total Views for My Questions # 2046

Users Marked my Answers as Correct # 0
Users Marked my Answers as Wrong # 0

Questions / { umesh kumar kewat }

Questions Answers Category Views Company eMail

Given an array A[n+m] of n+m numbers, where A[1] ... A[n] is sorted and A[n+1] ... A[n+m] is sorted. Design a linear time algorithm to obtain A[1...n+m] sorted using only O(1) extra space. Time Complexity of your algorithm should be O(n) and Space Complexity O(1).

C 2046

Answers / { umesh kumar kewat }

Question { Synergy, 9780 }

to remove the repeated cahracter from the given caracter
array.
i.e..,
if the input is SSAD
output should of
SAD

Answer

use lookup array

Is This Answer Correct ?

0 Yes

0 No