Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto più di una settimana. Ho sostenuto un colloquio presso Kony (Hyderabad) nel mese di apr 2015
Colloquio
Worst candidature experience.
I was a asked a question for which I have written a CODE on the paper.
Now ,the interviewer identifies hilarious bugs.
1.You did not print the message to the user.
2.You logic is right ,but you should declare the variable out side of the loop though it works it should be global. May be because he is global?
He speaks the question for 4mins and want me to remember each and every point spoken, like where is the message to user . Am sure if I would I added a system.out.println I would have told,where is the user name,and then county and then company name and all these are called as bugs ,just learned from experts. This message has no relation with the logic asked.a
So now the new definition of a bug in the program is,if you miss a print statement on a paper based coding test.
I was asked only one question and was debated,on it may be interviewer was not happy with me because according to him,a logic is no complete with a right message.
Through out the debate I was given weird gesture,like tongue,wink and very unprofessional .
Tip : If you go for interview ,make sure you write the question in written and verify with the interviewer whether he meant the same because he can flip you down at any point. and yes dont miss to use print statement excessively ,your interview depend on it.
Well this is my experience ,not everyone will be interviewed by such professional. Did I just say that. !
Domande di colloquio [1]
Domanda 1
Take two strings ,which contains version numbers ,compare both of them ,and if first string has version above or equal to the second ,flag it.
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Kony
Colloquio
Written Test: 1 DS and 1 Puzzle:
DS: Given Single LL, remove d elements from blocks of size b. Elements must be removed from beginning.
Puzzle: 8 Teams, each team plays 2 matches against other teams. Its like IPL. 4 qualify for semis.
Find the minimum number of matches a team may win and qualify for semis.
Find the maximum a team can win and still not qualify for semis.
Ho presentato la mia candidatura tramite un'agenzia di reclutamento personale. Ho sostenuto un colloquio presso Kony (Hyderabad) nel mese di nov 2014
Colloquio
They took 2 Rounds
Round 1 :
Q1 : Write a program for mouse in maze : I solved it using backtracking algorithm
Q2 : Find kth smallest element in 2 sorted arrays
Round 2: This round was with VP and its really tough to crack
Q1 : Given the infinite input stream of binary bit "1" OR "0", find whether number is divisible by "N"
Example: check if number is divisible by 3 ( here N=3)
suppose input stream is : 01111010000 then
1) 0 - No
2) 1 - No here input is : 01
3) 1 - Yes here input is : 011
4) 1 - No here input is : 0111
5) 1 - Yes here input is : 01111
6) 0 - Yes here input is : 011110
7) 1 - No here input is : 0111101
8) 0 - No here input is : 01111010
...........
output should be: No, No, Yes, No, Yes, Yes, No , No
Solution: This problem can be solved by using modules operation
Q2 : Given regular expression and string find whether they match or not
Regex : * Kony Lab * for SDET
String : 2014_ Kony Lab interview for SDET
And he asked me to write code which is , 1) Good 2) Readable & 3) Bug free