CareerCup

A lovely place where ohm law is checked every day + you can feel the grapes (without the first letter).

Clue:
** You can also find there gold… (The golden state)

Can you think of a problem with the following singleton? If so, can you make it better and in the most efficient way?


public class MySingelton {

private static volatile MySingelton mySingelton;

public static MySingelton getInstance() {
if (mySingelton == null) {
mySingelton = new MySingelton();
}
return mySingelton;
}

public static void main(String[] args) {

MySingelton s = MySingelton.getInstance();
...

}

The question inside the link.
The pictures below contain a message in a secret code.
You will need to program to decode this message and to discover the password.

http://tsofen2015ms.azurewebsites.net/

1. qaz is a value for a number where this number is less than the other next values which have indexes larger than the index of this number.
for example: 33 , 25 , 26 , 58 , 41 , 59 -> qaz of (33) = 3 where 33 less than 3 numbers (58 , 41 , 59), qaz of (25) = 4 and not 5 because the index of 33 is less than the index of 25, qaz of (26) = 3 , qaz of (58) = 1 , qaz of (41) = 1 , qaz of (59) = 0.
the question is to find the max qaz.
it can be solved simply using 2 loops which takes time of O(n^2).
that's ok but how can we solve this problem in O(nlogn).
I have an approach and know the algorithm I got during the interview but it take a 40 of me to find it and write the code, but it was hard to think about it during the interview in that way.
I want to know if somebody can think and write the code in less than 20 minutes !!!