CareerCup

should be upto n/2 not square root of n ...
Say n=16, then square root will give 4 .. so output will be 1,2; 1,3;2,3 in your algo ..
However output needed should also have 1,5;2,5;3,5;1,7;2,7;

A simple approach would be to use a separate table which will be queried by the external system .. If you have a Table A which is to be used by an external system, make a table B which is exact replica of Table A .. Now every 5-10 secs or 1-2 minutes depending upon your requirements, sync the two table by running sql server scheduled job ... So the external system will query table B and get almost realtime data, and this table B is only used by external system..

Except for int i=10, all other objects are created in heap and a pointer to them is maintained in the stack ... i is created directly in stack and once it goes out of scope it is popped off ...

Actually I remember a similar question, where you are provided a Dictionary and a function provided to you to find if the string is a complete word..
Now the problem is purely how you decide on the algo to find words, as O(n) is definitely not an option, each call to the Dictionary is assumed to be very expensive ...

here genius will hit null reference ..

public void PrintSpiral(int[,] a)
{
int minx=0,maxx=a.GetLength(0)-1,miny=0,maxy=a.GetLength(1)-1;
bool directionx=true;
bool directiony=true;

while(maxx!=minx && maxy!=miny)
{

if(directionx==true && directiony==true)
{
int x1=minx;int x2=maxx;
int y=miny;

for(int i=x1;i<=x2;i++)  
{
console.write(a[i,y]);
}
directiony=true;
directionx=false;
miny++;
}

if(directionx==false && directiony==true)
{
int x=maxx;
int y1=miny;int y2=maxy;

for(int i=y1;i<=y2;i++)  
{
console.write(a[x,i]);
}
directiony=false;
directionx=true;
maxx--;
}

if(directionx==true && directiony==false)
{
int x1=maxx;int x2=minx;
int y=maxy;

for(int i=x1;i>=x2;i--)  
{
console.write(a[i,y]);
}
directiony=false;
directionx=false;
maxy--;
}

if(directionx==false && directiony==false)
{
int x=minx;
int y1=maxy;int y2=miny;

for(int i=y1;i>=y2;i--)  
{
console.write(a[x,i]);
}
directiony=true;
directionx=true;
minx--;
}
if(maxx==minx && maxy==miny)console.write(a[maxx,maxy]);
}

}

sorry its o(n) .. typo ... however if u are storing n intigers then u need o(n) space anyways !!

However I missed out the sorted part ... may be interviewer wanted to hear interpolation search ..

Use a good hashing algorithm and generate a hashvalue for each number and use a hashtable of key value pair to save the numbers ...
Time is O(n)
Space is O(1)

No you are right! only thing is how you check whether 7 is the correct candidate ..
So it will be O(n)+O(n) ?

private static void FindElements(int[] a, int k)
        {
              int count = 0;
            while (count <= a.Length-k)
            {
                int max = int.MinValue;
                for (int i = count; i < count + k; i++)
                {
                    if (a[i] > max) max = a[i];
                }
                Console.Write(max + " ");
                count = count +1 ;
            }
        }

how are you so sure M[1] is the number?
if the array is
[5,6,7,7,7,7]
will this still work?

maintain a hastable where key is a number from the array and value its repeatation
Go through the array and keep inserting in dictionary :
if (element is already a key) then increase its count
else add element with count=1

Then go thourgh this dictionary and find if any count is > n/2

class Account 
{
object  _lock;
double balance;

//constructor
public Account(int Id)
{
 _lock=Locker.GetLock(Id);
}

//Make this method synchronized
public Deduct(double amount)
{
lock(_lock){//deduct here}
}

//Make this method synchronized
public Add(double amount)
{
lock(_lock){//Add here}
}
}

static class Locker
{
static Dictionary<int,object> locks=new Dictionary<int,object>();

public static object GetLock(int Id)
{
if(locks.ContainsKey(id)) return locks[id]; 
else
{
Dictionary.Add(Id,(object)Id); return  locks[id];
}
}
}

There is no hashmap in c#. hashmaps can have null keys.
Dictionary is a hashtable but its generic. So dictionary offers more typesafety than hashtable.

Anyone .. please throw some light for my career path ...