Belzabar Software Interview Experience
Belzabar recently visited our campus to hire full time employees. About 120 students gave the first round, 50 made it to the next round and finally 11 people had interviews. One of was selected for the post of computer scientist and I was lucky to be that one person.
Here’s my interview experience.
Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!
Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!
Round 1:(online MCQs)
About 70 questions, very easy level.
Round 2:(Coding test on paper)
One question. It was to rearrange positive and negative numbers in a 1-D array such that their relative order remains same. No extra space is allowed.
Round 3:(Technical interview)
1. Find if a number is palindrome or not.
2. Find if a string is palindrome or not.
3. Detect and remove loop in a circular linked list.
4. Check if a tree is height balanced.
5. Implement a Red Black tree.
6. Basic OOPs concept- run time polymorphism, encapsulation etc.
7. DBMS query to remove all duplicates from a given table.
8. DBMS query to print the nth largest salary.
9. Next greater element in array.
HR round. Not much of an effort. Be yourself.
Director’s round. He asked me to find greater of two numbers without using if, else, conditional operator, >,< etc. Basically, no comparisons. He asked me what one way encryption is and its uses. He asked me about my linux knowledge and some simple questions like grep, cron etc. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.