Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Bounteous x Accolite nel mese di lug 2021
Colloquio difficile
Candidatura
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Bounteous x Accolite
Colloquio
The interviewer joined the meeting and asked to introduce myself, then he introduced himself
and then he asked me to share my screen and gave a coding question based on array. Then after it he gave me another question on string.
Domande di colloquio [1]
Domanda 1
Find the point where the array started decreasing if the given array is first strictly increasing then decreasing. eg : 1 3 5 6 5 output:-> 6
There were 30mcq's in the first round based on d s , c n ,o s .Those who cleared that were given a code to solve on their platform for one hour. Then there were 2 technical interviews and hr. Be thorough with oops .
Domande di colloquio [1]
Domanda 1
Oops , d s a , arrays , c n fundamentals ,print the target sum etc...
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Bounteous x Accolite (Hyderabad) nel mese di mag 2021
Colloquio
Round 1 (M.C.Q. Based Round):
There were 30 questions and the time duration provided was 30 minutes.
The topics covered were basic data structure and algorithm, DBMS, OS, OOPS, CN, and general aptitude.
The round is easy to get by if you have been preparing for placements with respect to the above-mentioned topics.
Domande di colloquio [1]
Domanda 1
Difference between BFS and DFS.
Difference between Java and C++. Why C++ is not 100% OOP supportive?
Some basic DBMS queries, second-highest salary, and row num’s use in SQL
