CareerCup

given a range of number 1 through N, where N >=3. you have to take an array of length 2N and place each number ( from the range 1 to N) twice. such a that the distance between two indexes of a number is equal to the number. example

N=3

( 3, 1, 2, 1, 3, 2 )

I know we can Use Backtracking but is there any other solution.

you are given an array or length 1million and rang of value from 0-m ... count the number of accurance of each number.
#2 the same array as above. find out the distance between min and max.
#3 write a malloc function.
and some theoretical Qs on routing Table.

There was one stupid guys who asked me given a binary tree and a depth of the tree print all the nodes in that tree on that depth.

when i used inserted a NULL node in my code he said it wont work as the value of NULL is 0 its not a pointer.... bla boa.... i was shocked that a guy who has code to take 3rd round of interview is saying these kind of thing :D..... there was one more thing that he said that in 'C' u cant declare a variable after the initial declaration in func tion body I said yes we should not but Now a days c compilers like gcc etc allows it ... god know he ever used gcc or not but he denied it 3 time..... really bad experience

How can you tell if your system is little endian or big endian?