<?xml version='1.0' encoding='UTF-8'?><rss xmlns:atom='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:georss='http://www.georss.org/georss' xmlns:gd='http://schemas.google.com/g/2005' xmlns:thr='http://purl.org/syndication/thread/1.0' version='2.0'><channel><atom:id>tag:blogger.com,1999:blog-2682781734368178743</atom:id><lastBuildDate>Thu, 03 May 2012 07:00:40 +0000</lastBuildDate><category>puzzles</category><category>Questions-List</category><category>String Manipulation</category><category>Dynamic Programming</category><category>Linked List</category><category>Array</category><category>Microsoft</category><category>Databases</category><category>Data Structures</category><category>MySpace</category><category>Tree</category><category>.NET/C#</category><title>Technical Interview Questions, Answers, and Tips</title><description>Answers to frequently asked programming interview questions and puzzles asked at google, microsoft, amazon, yahoo, facebook, MySpace, and such for SDE/Developer and SDET positions.</description><link>http://www.technicalinterviewquestions.net/</link><managingEditor>noreply@blogger.com (avid gardener)</managingEditor><generator>Blogger</generator><openSearch:totalResults>53</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-5282964398677790113</guid><pubDate>Wed, 25 Apr 2012 02:32:00 +0000</pubDate><atom:updated>2012-04-24T19:37:41.810-07:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Array</category><title>How to detect repeated elements in an integer array?</title><atom:summary type='text'>


This is an open ended question so please ask questions about the nature of the data in the array (size of the data, is it sorted or almost sorted, range of the data). Also, ask about any constraints like runtime or memory usage. You selection of the technique will depend on the answers to those questions. I have listed a few techniques below that touch on some of those points. There are more </atom:summary><link>http://www.technicalinterviewquestions.net/2012/04/detect-repeated-element-integer-array.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-2294893240870146828</guid><pubDate>Mon, 02 Aug 2010 06:52:00 +0000</pubDate><atom:updated>2010-08-01T23:57:53.113-07:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Array</category><title>Reverse Minesweeper</title><atom:summary type='text'>Question: The interviewer first discussed the game of minesweeper and the gave a reverse minesweeper problem where the specifications were as follows:
1. A block of M rows by N columns is given
2. Each item can either be a mine or not a mine
3. The location of the mines in the block is given by the character *
4. Normal/safe squares are marked by '.' (dots)

See the below table and write a </atom:summary><link>http://www.technicalinterviewquestions.net/2010/08/reverse-minesweeper.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-3715056147845986624</guid><pubDate>Mon, 23 Nov 2009 18:26:00 +0000</pubDate><atom:updated>2012-02-23T23:00:09.844-08:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>.NET/C#</category><title>How and why to prevent class inheritance in C#/.NET</title><atom:summary type='text'>
Question: In .NET/C#, how does one prevent a class from being inherited by another class? In other words can the inheritance of class be blocked? Also, what is the reason one might want to block the inheritance chain?

The sealed keyword/modified in .NET can be used to block derivation from a class. An attempt to inherit from a class marked as sealed will result in a compile time error. Also, a </atom:summary><link>http://www.technicalinterviewquestions.net/2009/11/csharp-sealed-class-inheritance-block.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-3916417625412212850</guid><pubDate>Mon, 16 Nov 2009 12:01:00 +0000</pubDate><atom:updated>2012-03-01T14:29:21.173-08:00</atom:updated><title>Difference Between calloc, malloc, and realloc</title><atom:summary type='text'>Question: What is the difference between malloc(), calloc(), and realloc()

malloc, calloc, and realloc are functions used for memory allocation in C/C++ languages. There are some fundamental differences on how the above functions work.
realloc() 
First of all realloc() is actually a reallocation function. It is used to resize a previously allocated (using malloc(), calloc(), or realloc()) block </atom:summary><link>http://www.technicalinterviewquestions.net/2009/11/difference-between-calloc-malloc-and.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>12</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-6009214993109752429</guid><pubDate>Wed, 04 Nov 2009 04:02:00 +0000</pubDate><atom:updated>2009-11-03T20:02:29.544-08:00</atom:updated><title>Must Read Books for Technical/Programming Interview Preparation</title><atom:summary type='text'>Coding, Program Design and Interview Questions:
Programming Interviews Exposed: Secrets to Landing Your Next Job ~ John Mongan, Noah Suojanen, and Eric Giguère
Programming Pearls (2nd Edition) ~ Jon Bentley
Expert C Programming: Deep C Secrets ~ Peter van der Linden
Puzzles for Programmers and Pros ~ Dennis Shasha
More Programming Pearls: Confessions of a Coder ~ Jon Bentley
Programming </atom:summary><link>http://www.technicalinterviewquestions.net/2009/11/must-read-books-for-technicalprogrammin.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>1</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-558934194029345602</guid><pubDate>Thu, 02 Apr 2009 22:48:00 +0000</pubDate><atom:updated>2009-04-03T19:35:59.519-07:00</atom:updated><title>Implement Two stacks using one array</title><atom:summary type='text'>Problem: How to implement/code two stacks using one array.
Solution: The obvious solution is to have the two stacks at the two ends of the array. The stacks will grow in opposite direction. When the two stacks collide and there is no more room in the array the stacks will over flow. This problem is probably one of the easier problems and targeted towards exercising your array index manipulation </atom:summary><link>http://www.technicalinterviewquestions.net/2009/04/implement-two-2-stacks-one-1-array.html</link><author>noreply@blogger.com (avid gardener)</author><media:thumbnail xmlns:media='http://search.yahoo.com/mrss/' url='http://3.bp.blogspot.com/_MaVk85uAEFM/SdVCAIJjR-I/AAAAAAAAFXE/Je425O9ajNU/s72-c/TwoStacksOneArray.png' height='72' width='72'/><thr:total>9</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-7594621564260669939</guid><pubDate>Mon, 23 Mar 2009 06:28:00 +0000</pubDate><atom:updated>2009-03-23T00:10:38.789-07:00</atom:updated><title>Determine and display all anagrams in a string array</title><atom:summary type='text'>Question: Given an array of strings (string[] inputStrings). Devise a way and write the code to determine and display all the anagrams in the array.

Solution: With any interview question one should get the specifics of the problem and the input data before designing the solution. In this particular case, we should ask about the approximate number of strings in the array, average length of each </atom:summary><link>http://www.technicalinterviewquestions.net/2009/03/anagrams-string-array-print.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>5</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-6978494098156841435</guid><pubDate>Wed, 04 Mar 2009 02:15:00 +0000</pubDate><atom:updated>2009-04-16T18:32:00.420-07:00</atom:updated><title>Print 2D Array Matrix Spiral Order</title><atom:summary type='text'>Question: Given a 2D array / matrix of integers. Write a program to print the elements in spiral order. Consider a matrix as show in the diagram to the right. The desired output of the program should be as: 1,2,3,4,8,12,16,20,19,18,17,13,9,5,6, 7,11,15,14,10.








Solution: There are several ways to solve this problem, but I am mentioning a method that is intuitive to understand and easy to </atom:summary><link>http://www.technicalinterviewquestions.net/2009/03/print-2d-array-matrix-spiral-order.html</link><author>noreply@blogger.com (avid gardener)</author><media:thumbnail xmlns:media='http://search.yahoo.com/mrss/' url='http://3.bp.blogspot.com/_MaVk85uAEFM/Sa3lmg7NtaI/AAAAAAAAFHw/w1vE2ZS4n0g/s72-c/matrix-spiral-print.png' height='72' width='72'/><thr:total>13</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-6084917774087430049</guid><pubDate>Mon, 02 Mar 2009 01:02:00 +0000</pubDate><atom:updated>2009-03-01T17:50:40.281-08:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>MySpace</category><category domain='http://www.blogger.com/atom/ns#'>Tree</category><category domain='http://www.blogger.com/atom/ns#'>Data Structures</category><title>DNA Sequence Pattern Match/ String Search Problem</title><atom:summary type='text'>Question: The DNA double helix consists of a long strand of four bases:  adenine (abbreviated A), cytosine (C), guanine (G) and thymine (T).  Thus, it can be represented as a long string containing the characters A, C, G, and T. The field of bio-informatics involves storing and searching of DNA sequence data. What is a good data structure to facilitate storage and string match/search operation on</atom:summary><link>http://www.technicalinterviewquestions.net/2009/03/dna-sequence-pattern-match-search.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-4245134015631281445</guid><pubDate>Fri, 20 Feb 2009 22:33:00 +0000</pubDate><atom:updated>2009-02-20T15:38:43.151-08:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Databases</category><title>Database Isolation Levels in Sql Server and ADO.NET</title><atom:summary type='text'>Isolation level refers to I in the ACID properties for a Transaction. ACID stands for Atomicity, Consistency, Isolation, Durability. Isolation level refers to sensitivity of a database transaction to other changes in other transactions. You can set the isolation level for a transaction using the following command in T-SQL:

SET TRANSACTION ISOLATION LEVEL &lt;level name&gt;

&lt;level name&gt; can be one of </atom:summary><link>http://www.technicalinterviewquestions.net/2009/02/isolation-levels-sql-server-adonet.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-2882977221019260239</guid><pubDate>Thu, 19 Feb 2009 19:40:00 +0000</pubDate><atom:updated>2009-02-20T15:55:40.760-08:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Databases</category><title>Database Normalization Basics</title><atom:summary type='text'>First Normal Form (1NF):
Identify related groups of data (ex: orders, customers, products) and create separate tables for each group.All tables should have a Primary Key identifying an individual row in a table.No two columns in a table should have the same information and each column can contain only one attribute.In essence 1st normal form is about removing redundant data and creating tables </atom:summary><link>http://www.technicalinterviewquestions.net/2009/02/database-normalization-basics-normal.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>1</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-3908539204663226869</guid><pubDate>Wed, 18 Feb 2009 22:29:00 +0000</pubDate><atom:updated>2010-07-27T23:42:01.715-07:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Databases</category><title>SQL Server Index Fragmentation and Resolution</title><atom:summary type='text'>What is Index Fragmentation and how do you resolve it in SQL Server? 
Answer: I came across and excellent article on index fragmentation and 4 ways to resolve it  on Sql-Server-Performace.com which describes it in great detail.</atom:summary><link>http://www.technicalinterviewquestions.net/2009/02/sql-server-index-fragmentation.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-5859452822652535231</guid><pubDate>Tue, 10 Feb 2009 22:39:00 +0000</pubDate><atom:updated>2009-02-20T16:19:48.707-08:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Array</category><category domain='http://www.blogger.com/atom/ns#'>Microsoft</category><title>Find an Item in a Sorted Array with Shifted Elements</title><atom:summary type='text'>Problem: You are given a sorted array with shifted elements. Elements can be shifted to the left or right by 'i' number of places. The sign of 'i' denotes the direction of the shift. For positive 'i' direction of shift is right and left for negative 'i'.

For example, consider the sorted array 2, 3, 4, 8, 10, 11. A shift of 3 places to the right would be denoted by i=2 and the shifted array would</atom:summary><link>http://www.technicalinterviewquestions.net/2009/02/sorted-array-shifted-elements-search.html</link><author>noreply@blogger.com (avid gardener)</author><media:thumbnail xmlns:media='http://search.yahoo.com/mrss/' url='http://4.bp.blogspot.com/_MaVk85uAEFM/SZIkYwSos0I/AAAAAAAAEww/LfhkEwJ3FTo/s72-c/sorted-array-shifted-elements.png' height='72' width='72'/><thr:total>2</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-9011241534226262987</guid><pubDate>Mon, 02 Feb 2009 05:39:00 +0000</pubDate><atom:updated>2009-02-23T14:31:12.570-08:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Databases</category><title>Database SQL Interview Questions</title><atom:summary type='text'>Write a SQL Query to find first day of month?Why there is a performance difference between two similar queries that uses UNION and UNION ALL?How to choose between a Clustered Index and a Non-Clustered Index?How you can minimize deadlock situations in a database server? When you should use low fill factor?Explain First, Second, and Third database normalization form with examples?What are the </atom:summary><link>http://www.technicalinterviewquestions.net/2009/02/database-sql-interview-questions.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-8426659995757249102</guid><pubDate>Thu, 29 Jan 2009 03:23:00 +0000</pubDate><atom:updated>2009-02-20T16:20:26.738-08:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Array</category><title>Array: Find the number with odd number of occurrences</title><atom:summary type='text'>Problem: You are given an array containing positive integers. All the integers occur even number of times except one. Find this special integer.

Solution: A naive approach would be to loop over the elements of the given array and keep a count of each integer in a hash table or another counter array. But, this quickly becomes unfeasible as the range of integers could be 2^31 (one less). This is </atom:summary><link>http://www.technicalinterviewquestions.net/2009/01/integer-array-odd-even-occurrences-find.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>8</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-5381821053975293449</guid><pubDate>Wed, 21 Jan 2009 21:49:00 +0000</pubDate><atom:updated>2009-02-20T16:22:46.089-08:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Microsoft</category><category domain='http://www.blogger.com/atom/ns#'>Dynamic Programming</category><title>Fibonacci Sequence Dynamic Programming</title><atom:summary type='text'>Problem: Write the code for nth Fibonacci number.

Solution: There are basically two approaches to solving the Fibonacci problem. Lets looks at the definition of Fibonacci series first.

The Fibonacci series is defined as follows

F(n) = 0 for n = 0
       1 for n = 1
       F(n-1) + F(n-2) for n &gt; 1

If we translate that to the C language we get:


int RecursiveFibonacci(int n)
{
    if(n == 0) </atom:summary><link>http://www.technicalinterviewquestions.net/2009/01/fibonacci-sequence-dynamic-programming.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>3</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-8119601356425414622</guid><pubDate>Wed, 14 Jan 2009 23:18:00 +0000</pubDate><atom:updated>2009-02-20T16:17:57.861-08:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Data Structures</category><title>Store a stream of numbers along with the counts</title><atom:summary type='text'>Problem: Given a stream of numbers, suggest a data structure to store the numbers in the stream along with their number of occurrences.

Solution:
Before solving any problem make sure you lay down all the assumptions you are making and validate them with the interviewer.

Assumptions here:
The numbers are 32 bit integers. The size of the set (cardinality) is very small compared to the possible </atom:summary><link>http://www.technicalinterviewquestions.net/2009/01/stream-of-numbers-count-data-structure.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-1793555483001238794</guid><pubDate>Tue, 13 Jan 2009 22:21:00 +0000</pubDate><atom:updated>2009-02-20T15:39:09.224-08:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>puzzles</category><title>Fly plane around the world half fuel puzzle</title><atom:summary type='text'>There is an air force base on an island.  You are given a plane to fly around the world without landing (except at the island where you started). The island lies on the equator and you will be flying around the equator, essentially a circle.  The plane can carry enough fuel for half the journey. You can take help from other planes that can transfer fuel to your plane instantaneously while in </atom:summary><link>http://www.technicalinterviewquestions.net/2009/01/fly-plane-around-world-half-fuel-puzzle.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>1</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-7888480353953766961</guid><pubDate>Tue, 13 Jan 2009 22:19:00 +0000</pubDate><atom:updated>2009-04-29T20:03:32.993-07:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Microsoft</category><title>Microsoft Developer Interview Questions</title><atom:summary type='text'>---------------------------- Interview 1 ---------------------------------
- Why is a database useful? Why not use a file instead?
- What are stored procedures and what are the benefits?
- Write a program to get the nth Fibonacci number
- Discussion about patterns and practices
- What is database normalization? When would you use it and when would you not?
What data can be left denormalized in a </atom:summary><link>http://www.technicalinterviewquestions.net/2009/01/microsoft-developer-interview-questions.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-284463428017531536</guid><pubDate>Wed, 07 Jan 2009 20:48:00 +0000</pubDate><atom:updated>2009-10-26T18:53:21.761-07:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Array</category><title>Merge 2 Sorted Arrays (one has empty slots)</title><atom:summary type='text'>Question: There are two sorted arrays A1 and A2. Array A1 is full where as array A2 is partially empty and number of empty slots are just enough to accommodate all elements of A1. Write a program to merge the two sorted arrays to fill the array A2. You cannot use any additional memory and expected run time is O(n).

Solution: The trick to solving this problem is to start filling the destination </atom:summary><link>http://www.technicalinterviewquestions.net/2009/01/merge-sorted-arrays-empty-slots.html</link><author>noreply@blogger.com (avid gardener)</author><media:thumbnail xmlns:media='http://search.yahoo.com/mrss/' url='http://4.bp.blogspot.com/_MaVk85uAEFM/SuZRXUdu3HI/AAAAAAAAGfg/iV0pz8OzI6M/s72-c/merge-two-sorted-arrays-in-place.png' height='72' width='72'/><thr:total>6</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-6190083236128718044</guid><pubDate>Sun, 04 Jan 2009 03:46:00 +0000</pubDate><atom:updated>2009-01-03T20:07:56.008-08:00</atom:updated><title>Largest Sum Sub-Sequence Integer Array</title><atom:summary type='text'>Problem: Given an array on n integers, find a contiguous sub-sequence / subarray with largest sum.
Example: For an array of following elements { -1, 2, -4, 1, 3, -2 }, the sub-sequence with largest sum is 1,3

Solution:


 static int Find_Max_Sum_Sub_Sequence(int[] array)
        {
            //historical max and corresponding indexes
            int maxSoFar = 0;
            int maxStart = 0;
</atom:summary><link>http://www.technicalinterviewquestions.net/2009/01/largest-sum-sub-sequence-integer-array.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>4</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-445375387686374362</guid><pubDate>Wed, 31 Dec 2008 07:50:00 +0000</pubDate><atom:updated>2008-12-31T02:11:22.491-08:00</atom:updated><title>Dynamic Programming Questions</title><atom:summary type='text'>1. Longest Common Subsequence http://en.wikipedia.org/wiki/Longest_common_subsequence_problem

2.longest common substring problem http://en.wikipedia.org/wiki/Longest_common_substring_problem</atom:summary><link>http://www.technicalinterviewquestions.net/2008/12/dynamic-programming-questions.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-8412514251340435880</guid><pubDate>Tue, 30 Dec 2008 06:57:00 +0000</pubDate><atom:updated>2008-12-29T23:08:46.900-08:00</atom:updated><title>Object Oriented Programmings OOPS Concepts</title><atom:summary type='text'>Explain polymorphism with examples

What are the 4 basics of OOP?

Define Data Abstraction. What is its importance?</atom:summary><link>http://www.technicalinterviewquestions.net/2008/12/object-oriented-programmings-oops.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>1</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-4891417086972693446</guid><pubDate>Tue, 30 Dec 2008 03:43:00 +0000</pubDate><atom:updated>2008-12-29T23:01:40.635-08:00</atom:updated><title>Design Questions</title><atom:summary type='text'>Design a class library for writing card games.

Design an elevator control system. Buttons are present on every floor and supporting multiple elevators. (What objects/methods/properties/how components communicate)

How would you design the infrastructure front half of a very large web ecommerce site? what if it was very personalized? (how sessions are handled? where and what you can cache? how to</atom:summary><link>http://www.technicalinterviewquestions.net/2008/12/design-questions.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-2682781734368178743.post-1492391711553464006</guid><pubDate>Tue, 30 Dec 2008 03:17:00 +0000</pubDate><atom:updated>2012-04-24T19:34:56.248-07:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Questions-List</category><title>Questions</title><atom:summary type='text'>
Array

How would you detect a repeated element in an integer array?
Design an algorithm and write code to find two numbers in an array whose sum equals a given value.
Given an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like.
Given an array containing both positive and negative integers and </atom:summary><link>http://www.technicalinterviewquestions.net/2008/12/questions.html</link><author>noreply@blogger.com (avid gardener)</author><thr:total>0</thr:total></item></channel></rss>
