Temenos Interview Questions and Answers

Scrambling and reversing

Q1. Explain the projects in resume
Add your answer

Q1. About the vision and road map
Add your answer

There was a test with 4 questions and 3 to be answered mandatorily, 1 SQL and 2 Programming on our preferred language and a paragraph writing as 5th question.

Q1. Resume based questions, Basic programming and SQL questions, Types of Cloud services, About Temenos and a few scenario based questions.
Add your answer
Q2. Simple Answers can google basic questions on programming for freshers
Add your answer

Q1. HR Explained job roles and responsibilities
Add your answer

Normal MCQs round really easy was able to complete in 1 hour

$ questions very easy 3 coding and 1 SQL

Q1. Asked me about the logic and format of code
Add your answer
Q2. One scecnaior based question and what you will do there
Add your answer
Q3. Asked to describe the concept of override and encapsulation with code
Add your answer

I was asked to answer five types of questions for the assessment and to write code that describes and addresses those issues; however, only three are required to be completed.

Q1. Programming related concepts
Add your answer

Q1. HR round asked about the projects and future growth details
Add your answer

Q1. Implement minstack
Add your answer
Q2. How load balancers work
Ans. 
Load balancers distribute incoming network traffic across multiple servers to ensure no single server is overwhelmed.
• Load balancers monitor the health of servers and distribute traffic based on predefined algorithms.

• They can be hardware-based or software-based.

• Common algorithms used by load balancers include round-robin, least connections, and IP hash.

• Load balancers can improve reliability and scalability of a website ...read more
Answered by AI
Add your answer

Q1. 2 sum problem to implement in O(n)
Ans. 
The Two Sum problem involves finding two numbers in an array that add up to a target value.
• Iterate through the array and store the difference between the target and current element in a hashmap.

• Check if the current element exists in the hashmap, if yes, return the indices of the current element and the stored difference.

• Time complexity of O(n) can be achieved by using a hashmap to store elements and their indices.
Answered by AI
Add your answer
Q2. About the projects i have done
Add your answer

Q1. Loan life cycle
Add your answer
Q2. Loan application process
Add your answer

Q1. Work experience
Add your answer
Q2. Conflict resolution
Add your answer