Software Engineer C Interview Questions

665,794 software engineer c interview questions shared by candidates

1) I have class hierarchy and should create array of different instances of this hierarchy. They asked me to write a function which iterates this array and executes different methods according to the instance class. I suggested that downcasting is a bad idea and that it can violate Liskov substitution rule of the SOLID principles, and this problem should be solved using collections and generics, but they did not accept this answer 2) Create Queue N size using only N size array. 3) some Java concurrency related questions: synchronized volatile, atomic, etc....
avatar

Senior Software Engineer

Interviewed at Taboola

4.2
Dec 6, 2015

1) I have class hierarchy and should create array of different instances of this hierarchy. They asked me to write a function which iterates this array and executes different methods according to the instance class. I suggested that downcasting is a bad idea and that it can violate Liskov substitution rule of the SOLID principles, and this problem should be solved using collections and generics, but they did not accept this answer 2) Create Queue N size using only N size array. 3) some Java concurrency related questions: synchronized volatile, atomic, etc....

Given an array of unique non-negative integers, {A1,…,An}, and a positive integer, X, write a function that finds all pairs of numbers in the array that sum to X”. You are given an integer array nums sorted in ascending order (with distinct values), and an integer target. Suppose that nums is rotated at some pivot unknown to you beforehand (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).” Take a singly-linked list, and reorder in such a way that the first element points to the last element, second element points to second-to-last element, and so on.
avatar

Software Engineer

Interviewed at Expedia Group

3.7
Feb 1, 2021

Given an array of unique non-negative integers, {A1,…,An}, and a positive integer, X, write a function that finds all pairs of numbers in the array that sum to X”. You are given an integer array nums sorted in ascending order (with distinct values), and an integer target. Suppose that nums is rotated at some pivot unknown to you beforehand (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).” Take a singly-linked list, and reorder in such a way that the first element points to the last element, second element points to second-to-last element, and so on.

Viewing 1781 - 1790 interview questions

Glassdoor has 665,794 interview questions and reports from Software engineer c interviews. Prepare for your interview. Get hired. Love your job.