Societe Generale Global Solution Centre Technical Support Engineer Interview Questions and Answers

Q1. Sorting program without using any in built functions
Ans. 
Implement a sorting program without using any built-in functions
• Iterate through the array and compare each element with the rest to sort

• Use a sorting algorithm like bubble sort, selection sort, or insertion sort

• Implement the sorting logic using loops and conditional statements
Answered by AI
Add your answer
Q2. Writing a sort program
Add your answer

Java code based on java 8 stream api

Q1. Java questions and basics of testing
Add your answer

Q1. Java 8, Stream API
Add your answer
Q2. Dependency Injection in Spring
Ans. 
Dependency Injection in Spring is a design pattern where objects are passed their dependencies rather than creating them internally.
• In Spring, dependencies are injected into a class through constructor injection, setter injection, or field injection.

• This helps in achieving loose coupling between classes and makes the code more testable and maintainable.

• Example: @Autowired annotation in Spring is used for dependency inj
Answered by AI
Add your answer

Q1. My Experience in IT
Ans. 
I have over 8 years of experience in IT, specializing in software development and project management.
• Developed web applications using Java, Spring, and AngularJS

• Led a team of developers in implementing a new CRM system for a large client

• Managed multiple projects simultaneously, ensuring on-time delivery and client satisfaction
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

50 Logical ability, mathematical and image patterns questions are to be done in 20 minutes. A minimum cutoff has to be cleared. (ask your recruiter)
Tip – majority questions are of image pattern, so try to solve those first as they take lesser time

Round duration - 90 minutes
Round difficulty - Easy

Q1. 
Secret Message Decoding Problem
Ninja encountered an encoded secret message where each character from 'A' to 'Z' is mapped to a numeric value (A = 1, B = 2, ..., Z = 26). Given a numeric sequence (SEQ) de...read more
Ans. 
The problem involves decoding a numeric sequence back into a valid string based on a given mapping of characters to numeric values.
• Use dynamic programming to keep track of the number of ways to decode the sequence at each position.

• Consider edge cases such as '0' and '00' which do not have valid decodings.

• Handle cases where two digits can be combined to form a valid character (e.g., '12' corresponds to 'L').
Answered by AI
Add your answer
Q2. 
Digits Decoding Problem Statement
A few days back, Ninja encountered a string containing characters from ‘A’ to ‘Z’ which indicated a secret message. For security purposes, he encoded each character of th...read more
Ans. 
The problem involves decoding a numeric sequence into a valid string using a given mapping of characters to numbers.
• Use dynamic programming to count the number of ways to decode the sequence.

• Consider different cases for decoding single digits and pairs of digits.

• Keep track of the number of ways to decode at each position in the sequence.

• Return the final count modulo 10^9 + 7 as the answer.
Answered by AI
Add your answer

Round duration - 180 minutes
Round difficulty - Easy

Since I applied for senior frontend role (React), I was asked questions on following topics – Javascript (easy, medium, hard), HTML, HTML5 api, CSS, SVG, React (easy, medium, hard), UI/UX related
A very lengthy and tiring round.

Round duration - 20 minutes
Round difficulty - Easy