Societe Generale Global Solution Centre Software Engineer Interview Questions, Process, and Tips

It consists of coding questions consists of moderate level.

Q1. In this round mainly it was discussion about my last work. System design discussion.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The test start time validity was between 06:00 PM and 7:00 PM. 
It was on the HirePro platform(link provided by company). 
The test was proctored which means that we had to keep our Microphone and Web Cam on at all times and never exit the test window.

Q1. Spiral Matrix
You are given a 2-D array 'MATRIX' of dimensions N x M, of integers. You need to return the spiral path of the matrix.
Example Of Spiral Path:
Input Format:
The first line conta...read more
Ans. 
Step 1 : I solved the problem using 4 for loops inside a while loop which ran till the matrix was filled.
Step 2 : Each of the for loops were for a particular direction starting from left to right, top to bottom, right to left and bottom to top.
Step 3 : I shifted the boundary of the loops after each traversal i.e incrementing top, decrementing right, decrementing bottom and incrementing left respectively.
Answered by CodingNinjas
View 3 more answers
Q2. Decimal to Octal Conversion
You are given a decimal number as input. You need to convert this number into its equivalent in the octal number system. The octal number system is the number system with a bas...read more
Ans. 
Step 1 : To convert decimal to binary, I used a while loop running till number > 0 wherein I divided number by 2 and stored the remainder at the beginning of an output string (initialized as empty).
Step 2 : To convert binary to octal, I first created a map between binary number and its equivalent octal ('000' -> '0' , '001' -> '1' and so on)
Step 3 : Then, from the left extracted one by one substrings of length...read more
Answered by CodingNinjas
View 1 more answer
Q3. Cube of Matrix
Given an M x N sized 2D array 'MATRIX', return the (i * i + j * j) value for elements in which the sum of cube of digits of the element is equal to the element itself. Here, 'i&#...read more
Ans. 
Step 1 : Create a function which returns true/false depending on whether the sum of cube of digits of a number is equal to the number itself.
Step 2 : Create a for loop inside another for loop to traverse through the matrix.
Step 3 : Pass each element of the matrix to the function and print it if the function returns true.
Answered by CodingNinjas
View 2 more answers

Round duration - 60 minutes
Round difficulty - Medium

The round was from 11 am to 12 pm, 4 days after the online test.
It was held over a video call on Skype. 
We were instructed to use https://slate.skillenza.com/ as the coderpad.
This was a Technical Round. 
The interviewer started by asking me to introduce myself. He then asked me some questions regarding Java programming. He asked me what is the use and advantages of HashMaps and how a HashMap is implemented internally in Java. He also asked me some OOPS question. He gave me the following code to solve and ended the session by asking me the details of an Android application I had mentioned on my resume.

Q1. Common elements between array of strings
Given two 1-dimensional arrays containing strings of lowercase alphabets, print the elements that are common in both the arrays i.e. the strings that are present in...read more
Ans. 
Step 1 : Traverse through the first array and store its contents in a hashmap. If key (string) appears for the first time set corresponding value (count) as 1, else increment count.
Step 2 : Traverse through the second array. If an element from this array (key/string) is present in the hashmap print it and decrement its value (count) by 1.
Step 3 : If value (count) becomes 0 after decrementing for any key (string) remove...read more
Answered by CodingNinjas
View 3 more answers