Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Data Structures Interview Questions

Why is selection sort used?

0 Answers  


How do you find the size of an arraylist?

0 Answers  


Why do we need searching algorithms?

0 Answers  


Explain about the different lists available in the collection?

0 Answers  


What is queue in data structure?

0 Answers  


In tree construction which is the suitable efficient data structure?

0 Answers  


Which is faster hashmap or hashtable?

0 Answers  


Does array sort mutate?

0 Answers  


Which is more efficient merge sort vs quicksort?

0 Answers  


How can you insert a node to the beginning of a singly linked list?

0 Answers  


How to increase stack limit in w3wp.exe?

0 Answers   PUCIT,


Why is hashmap used?

0 Answers  


Categories