Societe Generale Global Solution Centre Associate Software Engineer Interview Questions and Answers

40 questions-aptitude test followed by a technical test comprising 10 questions.

Q1. Add two linked list minimum cost path print all the nodes in a tree except the leaf nodes.
Ans. 
The question asks for adding two linked lists, finding the minimum cost path, and printing all nodes in a tree except the leaf nodes.
• To add two linked lists, traverse both lists simultaneously and add corresponding nodes.

• To find the minimum cost path, use algorithms like Dijkstra's or A*.

• To print all nodes in a tree except the leaf nodes, perform a depth-first traversal and print non-leaf nodes.
Answered by AI
Add your answer

Q1. Mix of hr + technical questions. Didn't ask much deep in technical questions.
Add your answer

3 easy-mid level question on DP,arrays,strings

Q1. Asked about OOPS and puzzles
Add your answer
Q2. What is the logic for merge sort What is inheritance
Ans. 
Merge sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
• Divide the unsorted list into n sublists, each containing one element

• Repeatedly merge sublists to produce new sorted sublists until there is only one sublist remaining

• Merge operation involves comparing elements from two sublists and adding the smaller one to the fi...read more
Answered by AI
Add your answer