YOE-1 year
Current Exp.- Working in an Service Based.
I applied to Thought works recently via portal for application developer profile(JAVA) Here is my experience.
The 1st round was OA , with MCQ questions on core CS subjects and programming related question
(as, my core mcq went well , I was able to solve all the core CS subjects questions and prog-OOPS (ALL THANKS TO GATE PREP!!).--Didn't do anything extra to prepare for it.
Now comes coding part-
1st ques- related to arrays with two pointers(all test case passed)
2nd ques- was related to hashing and DP on string(solved it as well as, I was able to identify the pattern)
I was able to complete within 30-35 mins full OA.
CODED ALL IN PYTHON
GOT SELECTED FOR CODE PAIRING ROUND!!
(THIS IS MY 1ST TIME , WHERE I APPEARED IN SUCH ROUND LIKE THIS)
After first round,In this round we had to solve a problem using an Object Oriented Approach and we were paired with a ThoughtWorker. THis round was for about 2 hours.
Later, for CODE-PAIRING ROUND,
they just asked me to design a Ride sharing ApplicationWe discussed and they mentioned the different features that they would like to have and I explained how I would implement them.
I identified entities, classes, attr., functions , relationships, etc. and discussed with them the high level view and ER , etc.
I clarified a lot initially , while implementing. This was the round where I did lot of blunder. Could not complete the whole code within given time frame, They were also asking about the DS used and why and more optimizations in code and I was able to answer all.
Later got stuck in implementing the Controller module, Till that time my mind was fed up and tired and could not think of a better solutiions.
RESULT- COULD NOT MAKE IT TO NEXT ROUNDS!!
TIPS- Consider these rounds/interview as a discussion, rather than a 2 hr. exam or coding contest
Interviewer are always there to help
I got to learn a lot from them about clean code, Design principle, SOLID patterns , etc
(WAS ALSO ASKED 1 CODING QUESTION IN ROUND 2- https://leetcode.com/problems/greatest-common-divisor-of-strings/description/)(similar to this)
P.S.- will always keep trying something better will come up soon!!