Skip to contentSkip to footer

C Interview Questions

Salaries
Interviews

5,475 c interview questions shared by candidates

1st round: Why do you want to join Sonar? 2nd round: How does the using statement work in C#? What is the yield keyword used for? How does the garbage collector work in .NET? 3rd round: Implement a simple parser for mathematical formulas. 4th round: How did you resolve conflicts at your previous workplace? What were the most challenging situations you had to overcome? 5th round: What are your salary expectations? When can you start?
avatar

C# Developer

Interviewed at Sonar

3★
Feb 1, 2023

1st round: Why do you want to join Sonar? 2nd round: How does the using statement work in C#? What is the yield keyword used for? How does the garbage collector work in .NET? 3rd round: Implement a simple parser for mathematical formulas. 4th round: How did you resolve conflicts at your previous workplace? What were the most challenging situations you had to overcome? 5th round: What are your salary expectations? When can you start?

Q) Given Singly linked list (1->2->3->4->5->6) , convert this list to (1->6->2->5->3->4). 1st's element next is nth element, 2nd's next is n-1th element and so on. --> I gave them one solution that uses stack, but no more extra space is expected, panel was very friendly and helpful they gave me time to time hint and finally I came up with below solution. Solution: 1) Split linked list into 2 halfs 2) Reverse the 2nd half. 3) Now merge 1st and 2nd half again. Q) Internal implementation of Malloc function Q) Move all the 10s at the end of the array, in O(N) Q) Some basic questions on Hashmap, vectors, set,list Q) Some question on OOPS, virtual functions, copy constructor, why & is used in definition of Copy Const etc. PS: I just added this review to admire the panel, they were very kind & friendly, supportive, and give you hints to arrive at the solution.
avatar

Software Developer C++

Interviewed at Synopsys

3.8★
Jan 21, 2022

Q) Given Singly linked list (1->2->3->4->5->6) , convert this list to (1->6->2->5->3->4). 1st's element next is nth element, 2nd's next is n-1th element and so on. --> I gave them one solution that uses stack, but no more extra space is expected, panel was very friendly and helpful they gave me time to time hint and finally I came up with below solution. Solution: 1) Split linked list into 2 halfs 2) Reverse the 2nd half. 3) Now merge 1st and 2nd half again. Q) Internal implementation of Malloc function Q) Move all the 10s at the end of the array, in O(N) Q) Some basic questions on Hashmap, vectors, set,list Q) Some question on OOPS, virtual functions, copy constructor, why & is used in definition of Copy Const etc. PS: I just added this review to admire the panel, they were very kind & friendly, supportive, and give you hints to arrive at the solution.

Viewing 4301 - 4310 interview questions

Glassdoor has 5,475 interview questions and reports from C interviews. Prepare for your interview. Get hired. Love your job.