Fare, transparent, good with technical knowledge and like the way of approaching.
Applied directly from website and got call and schedule my telephonic interview.
Ask me there some data structures question, how to get middle of linked list, how to find nth node from last in singly list.
Internal working of HashMap.
First Tell me about your current project architecture?
Write a code of multi threading having 2 thread. One thread print PING and 2nd Thread print PONG.
Find the maximum sum incremental from array with starting Index and End Index.
Added more question on above, If you have 100 array how can you find which array have highest sum same as above sum.
Ask question on Hash Map how can we achieve overriding of Hascode() and equals().
The following metrics were computed from 1 interview experience for the Qualys Java Developer role in Pune, India.
Qualys's interview process for their Java Developer roles in Pune, India is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Qualys's Java Developer interview process in Pune, India.