CareerCup

Design algo for insertElement, deleteElement and getRandomElement, expected complexity for all the operations will be less than O(n).

I have one bag of bolts and another bag of nuts, need to find biggest Bolt. Condition is must not compare both bolts or both nuts. only comparison between bolt and nut allowed.

generate permutations of a string without duplicates and without using hashtable to memorize the permutations.

write insert method to insert a node into sorted circular linked list (Sorted based on int value). insert method takes 2 arguments, one is value to be inserted and other is reff to any random node in the sorted circular linked list

find longest palindrome in a given string, expecting time complexity must be less than O(n^2).

write a function to check given string matches with given pattern
Condition: only one wildcard used in the pattern, that is '*', but can be used in the pattern more than once.
Example:
pattern: *abc*def*.doc*
str: adsfabcxyzdefgh.docx

fucntion signature is like: boolean isMatching(String str, String pattern);

Write a method to which will download a file from remote server
conditions are: if remote server not responding then should go into resume. Once it up it should start download file from where it got resumed.

write two separate methods,
1. read method to read file and
2. write method to write to file,,,
both must be thread safe and throughput (efficiency) should be high.

How can I give new implementation to methods in String.
For example: I need to give new implementation to concat method, which concats two string and convert to uppercase.
I answered that, i create new custom class and create a method concat and implement it as the way interviewer want, but he asked that he want to do for all the methods in String, so writing new implementation for a methods is not a feasible solution.

class A {
public void method1();
public void method2();


public void method99();
public void method100();
}
Another factory class returning object of class A, how to implement logging mechanism, which should log entry and exit of each method call in class A.

How many squares are in chess board?

Give an example for factory pattern (not abstract factory) with code

write a merge function to merge two BST's (both bst's having unique elements)

Given unsorted array (contains -ve numbers also), write a method to return max sum. Condition is two numbers should not adjacent to each other.

write a insert method for singly linked list, so that it will insert elements in the ascending order.

Given n length path (assume array with 0's and 1's), each step either a rock or acid bucket (0 is acid and 1 is rock), need to find the jumping pattern of the from to cross the given path. Conditions are:
lets consider, curretly frog jumping at speed s, at each step
it can maintain same speed (s)
or increase by one step (s=s+1) or
decrease by one step (s=s-1);
find the jumping sequence for the given input.

find ginen BT is BST or not?

An array of n length, filled with 0's,1's and 2's, how to sort effectively?
Input:{0,1,2,2,1,1,0,2,1,0}
Output: {0,0,0,1,1,1,1,2,2,2}