Netcracker Technology Interview Experience (On-Campus) 2023

Round 1: The first round was Cognitive + Coding L2 L3. In cognitive quantitative aptitude, logical reasoning, and technical questions were asked. The level of questions was easy to medium. 

Suggestion: Practice aptitude to gain confidence, accuracy, and speed. For coding questions, There were two coding questions were asked.

• The first question was to find out the odd string amongst the N-given string. 
• The second question unfortunately I don’t remember while writing this article.

Out of 178 Students, only 35 students were shortlisted for the next rounds.

Round 2 (Technical round): In this round, the interviewer starts with an introduction. Then he told me to introduce myself. 

• After this, he starts to ask basic questions from C. C++ Like the Difference between C and C++. 
• Then he asked me to explain the OOPS concept in detail. 
• After this he started to ask me questions about DBMS and SQL He asked me to explain different types of DBMS Languages and also asked some queries from SQL as well.
•  After this, he asked me some theory questions about data structure and asked to me write code to implement the Doubly linked list. 
• At Last, he asked to me explain my project and some cross-questions from my project. I was able to give almost all the answers.

The interview goes about 45 minutes. Out of 35 Students, only 20 were selected for the HR round.

ROUND 3 (HR round): Generic HR questions were asked Like.

• Introduce yourself.
• Why did you choose computer engineering?
• What are your strengths & weaknesses?
• What will you do if your team is not able to perform well / below your expectations?
• She further explained to me about Netcracker Technology. Told me about my working location, salary breakup Etc.

After all this at last she asked me one puzzle question 3 Ants and Triangle and I was able to solve this question. The interview goes about 30 minutes.

Verdict – Selected.

Out of 20 Students 15 were selected for FTE and I was one of them.