Code Quotient is a free course where you will be selected based on interviews and a pre-course. Round 1: After you apply you will be given a pre-course where you will have topics like arrays, sorting, strings, stacks, etc. You need to study the tutorials given and complete the problems. you need to complete the pre-course more than 80% to be eligible for an interview. Round 2: After some days you will receive a mail or WhatsApp message sometimes about the interview date, timings, and name of your interviewer. The interview will be held on google meet. the interview will be short 10-20 mins. They will ask some basic questions not too deep. Questions asked : Tell me about yourself. what is recursion? what is binary search, some questions on binary search, how it is implemented, and its time complexity. what is an anagram, pangram? The interviewer posted a code snippet in chat and asked for output it was a string reversing snippet. What is merge sort time complexity. What are your salary expectations. After a week or 10 days, I received a mail that I was selected for the code quotient program. and I was given a course that consists of tutorials and programs on all the main data structures. There will be daily classes at 6 pm. You need to attend classes regularly and complete problems in time.
1
Other Software Engineer interview reviews for CodeQuotient
The process took 3 days. I interviewed at CodeQuotient (Mohali, Punjab) in Oct 2023
Interview
fist round dsa ques array based , round 2 pseudo code based , round 3 create a game or todo list type thing using c++ or js , hr and technical round dsa based ques linkedlist , array , strings
I applied online. I interviewed at CodeQuotient (Mohali, Punjab) in Jan 2023
Interview
First, they assign a course containing a DSA topic after completing 90% of the course you get the test link for the next round First Round is a Technical test containing 3 question Solve 3/3 For the next round. after that TechnicaInterviewew Round
Interview questions [1]
Question 1
(1) Pattern Problem (2)Reverse Link List (3)Rotation of array this is technical test in Interview Round they ask to code on compiler Doubly Linked list implemention Finding count of Duplicate elements in array Sum of digits Stack implementation Reverse digit Partition of array Decimal to binary String Reverse Finding sum of second and fourth element of digit... Fibonacci Series Most important question is class and object ( circle, complex number diff)
