of the
starting index at that recursion. This takes O(logn).
So overall Time O(n). Space O(1) [no extra space].
Correct me if I am wrong.
-Abhirup
On Fri, Jul 2, 2010 at 1:50 AM, Vikas Jayaprakash
vikas.jayaprak...@gmail.com wrote:
Hi AlgoGeeks,
Can anyone provide me answers
Hi AlgoGeeks,
Can anyone provide me answers for the below.
1. given an array of random integers write a program to (1) detect
duplicate (2) remove duplicate (array should not get hampered at any
cost!).
2 - In a sorted array some of the elements say N are rotated. for
example initially 1 2 3 6
Good Evening to Algo_Geeks,
I am a newbie regarding the Algo Analysis. I was asked this question
recently in an interview. Please let me know if anyone of you know how to
solve this.
*Question:*
Assume You have a binary Tree (not sorted and not BST) with a specific
pattern on a Desktop1. How can
