1st Round Matrix Rotation (Leetcode - Approach + Code (any language)) + OOPs (very important in depth) + javascript questions (hosting, high order function, chaining, output based etc. most frequently asked questions) + Puzzle (Quant) 2nd Round DBMS (normalization, acid properties and other most frequently asked questions.) + little bit OS (thread, process, semaphore, deadlock) + javascript + python + OPPs (very important every concept). + Puzzle (scenario based). 3rd Round Counting Sort (question given as scenerio, need to think which algorithm to apply. First approach, discussed in depth then code (asked to do in javascript). + OPPs (every concept) + DBMS 4th Round Disclaimer : If you have reached here. Assume you are selected. Basic questions based on resume, tech stack you have worked on. (Very easy) 5th Round HR question again very easy. Just answer fluently.

Question

1st Round Matrix Rotation (Leetcode -> Approach + Code (any language)) + OOPs (very important in depth) + javascript questions (hosting, high order function, chaining, output based etc. most frequently asked questions) + Puzzle (Quant) 2nd Round DBMS (normalization, acid properties and other most frequently asked questions.) + little bit OS (thread, process, semaphore, deadlock) + javascript + python + OPPs (very important every concept). + Puzzle (scenario based). 3rd Round Counting Sort (question given as scenerio, need to think which algorithm to apply. First approach, discussed in depth then code (asked to do in javascript). + OPPs (every concept) + DBMS 4th Round Disclaimer : If you have reached here. Assume you are selected. Basic questions based on resume, tech stack you have worked on. (Very easy) 5th Round HR question again very easy. Just answer fluently.

Anonym · Accepted Answer

I was able to answer all of the question. It was easy and good experience.

uTrade Solutions

Frage im Vorstellungsgespräch bei uTrade Solutions

Antwort im Vorstellungsgespräch

Beobachtete Unternehmen

Jobsuchen