CareerCup

A string contains a-z, A-Z and spaces. Sort the string so that all lower cases are at the beginning, spaces in the middle and upper cases at the end. Original order among lower and upper cases needs to remain the same. For example: a cBd LkmY becomes ackm BLY. Is there a way in O(n) without extra space?

Write a function to generate pascal triangle (use recursion)

public static int[] generatePascal(int level)

How do you decide whether we should use Java or C++ for a particular project . what are pros and cons

How does garbage collector work ? In mark and sweep , how does gc know which objects it needs to mark , how are references stored for objects for gc to understand that its reference is null or it is no more referenced anywhere j

write your own implementation of hashtable , write interface and implementation for same eg. get,put and delete function .
follow up question : suppose you have hashtable of size 4 and its full . you then delete 2 elements from it. how will you reuse the space . implement linear probing collision resolution technique in this hash table .

Suppose program's runtime is 12N2 + logn + 4000 . how will you denote this in Big O notation . no matter how big n is , you will always have 4000 added to it .
explain your big O too.

you have an array of strings . print all anagrams for a string with complexity n2 .

Suppose you have huge list of single digit integers how will you sort them ? list fits in memory . how can u do it with n complexity ?

implement LRU cache in java without using built-in datastructure ie. linkedHashMap

how will you implement dictionary for client . suppose data is stored in database .you don't need to implement dictionary but explain entire interaction and systems involved .

The interviewer was not interested in knowing how dictionary is internally implemented . he was more interested in understanding bigger picture ie. high level , eg.
i explained you will have ajax call from client page to fetch matching words, explained arguments that i will pass in ajax , explained high level server side api , how this api will interact with db and how it will send information back to client .
i think we should discuss high level perspective eg. designing the system overall architecture rather than dictionary algorithm

steps involved to deploy a web services . interviewer was interested in high level tasks involved in deploying a webservices and how client will access it.

Given an array of positive integers, print out all the numbers which are repeated an even
number of times? Can you do this without using additional storage?

how do u use persistent storage on browsers . what are various options .

my ans : html5 : we can use localstorage and persistent storage.
non-html5 browsers : we can use cookies .

how do u detect useragent in css . suppose u want to use different css on mobile devices.

my ans : media tag.

how do u authenticate and perform authorization if your server is stateless in java . how does entire process work . please explain detailed architecture for it.

Suppose you have 4gb list of integers on disk . you need to find kth largest element . how will you do that . sorting is not an option .

i had suggested that I would use 2 stacks to maintain k largest elements (eg. k=10 , then stack will store top10 numbers encountered so far ) . interviewer mentioned can we use array instead . please let me know what is the optimal way .

Given a String, write a routine that converts the string to an long, without using the built in Java functions that would do this. Describe what (if any) limitations the code has. For example:
long StringToLong(String s)
{
/* code goes here to convert a string to a long */
}
void Test()
{
long i = StringToLong("123");
if (i == 123)
... success ...
else
... failure ...
}

Implement insert and delete in a tri-nary tree. Much like a binary-tree but with 3 child nodes for each parent instead of two -- with the left node being values < parent, the right node values > parent, and the middle node values == parent. For example, if I added the following nodes to the tree in this

How can I read a file in, compile, and execute it at run time?

How can I get a list of all symmetric key generators? How can I add one?

• Can you show me how to write a meta-class that will allow fixed named methods to be invoked before and after a method in an instance of that class is invoked?

What does it mean for two classes to have a different type erasure?

What is the drawback for string type in Java . suppose you have to deal with millions of strings and u need to save them , how will you save them . imagine there is not enough space to save those strings . This is Big data related question . interviewer was just interested in knowing trick to save strings .

Pick two data structures to use for implementing a Map.

* Describe lookup, insert, & delete operations.
* Give time & space complexity for each.
* Give pros & cons for each.