Temenos Software Engineer Level 1 Interview Questions and Answers

There were some technical questions MCQ based. Then there were 2 coding questions,i don't remember the questions exactly ,but one was a medium level array manipulation question and the other was medium level string manipulation question.

The round was of 1 hour .SHL platform conducts the Aptitude and Verbal Reasoning. It had two sections, first was a numerical ability which had questions mostly on Data interpretation (Tables, Bar graphs, and Pie charts). Calculators were allowed however you had to be extremely fast in your calculations as the timing constraints were very strict and you could not go back to the previous question. The second section was verbal reasoning which was mostly reading comprehension based. I was preparing for GMAT so I was all brushed up. I would recommend to go through the SHL sample papers to become familiar with the format of aptitude and Verbal reasoning questions.

Q1. It went for about 1.25 hours. TR round : The interviewer was very supportive and wanted a healthy discussion. First he asked about my project and questions based on my project. Q1.He asked me what is 4...read more
Add your answer

Q1. SQL, C, DBMS previous company roles and responsibilities Behavioral questions
Add your answer

Q1. SQL C Oops Data structure Behavioral question
Add your answer

Q1. Verbal communication test by Pearson 60/100 is cutoff to clear
Add your answer

Q1. Questions related to SQL
Add your answer
Q2. Few Aptitude Questions as well
Add your answer

Q1. Questions related to SQL
Add your answer
Q2. Joins with DDL, DML
Ans. 
Joins in SQL are used to combine rows from two or more tables based on a related column between them.
• Joins are used in SQL to retrieve data from multiple tables based on a related column

• DDL (Data Definition Language) is used to define the structure of database objects like tables, views, etc.

• DML (Data Manipulation Language) is used to manipulate data in the database like inserting, updating, deleting records
Answered by AI
Add your answer

Aptitude test will a hackerrank test where it might have technical MCQ and/or coding test.

Q1. Interviewer will test your logic building capability with puzzel/coding and technical questions and experience discussion.
Add your answer

Q1. Its a normal discussion with HR about CTC and all.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing: 90 mins
Environment: Online coding round
No of questions: 3 Questions(225 marks) were asked.

Q1. 
Quick Sort Problem Statement
You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.
Quick sort is a divide-and-conquer algorithm. It ...read more
Ans. 
Yes, the quick sort algorithm can be enhanced to achieve NlogN complexity in the worst case by using randomized quick sort or median of three pivot selection.
• Use randomized quick sort to randomly select the pivot element, reducing the chances of worst-case scenarios.

• Implement median of three pivot selection to choose a pivot that is closer to the median value, improving partitioning efficiency.

• Consider using dual pivot...read more
Answered by AI
Add your answer
Q2. 
Find K'th Character of Decrypted String
You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is to find the K'th character of the d...read more
Ans. 
Given an encrypted string with repeated substrings represented by counts, find the K'th character of the decrypted string.
• Parse the encrypted string to extract substrings and their counts

• Iterate through the substrings and counts to build the decrypted string

• Track the position in the decrypted string to find the K'th character
Answered by AI
Add your answer
Q3. 
Weighted Job Scheduling Problem Statement
You have 'N' jobs, each with a start time, end time, and profit. Your task is to identify the maximum profit that can be earned by scheduling these jobs such that...read more
Ans. 
The Weighted Job Scheduling problem involves maximizing profit by scheduling non-overlapping jobs with given start times, end times, and profits.
• Sort the jobs by end time in ascending order.

• Initialize an array 'dp' to store maximum profit at each job index.

• For each job, find the latest non-overlapping job and update 'dp' with the maximum profit.

• Return the maximum profit from 'dp'.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing: evening
Environment: Virtual(remote)
Activity:
It was a resume screening + DSA round . There were 2 interviewers in this round. Initially , a brief introduction was given by them & later , they started with projects listed in my resume . They first asked me to explain about the projects , asked some questions related to its implementation & its actual use case in real world (where it can be used) .Later , they switched to DSA part , a total of 2 questions of easy medium difficulty level were asked . I only remember 1 question that was similar to Minimum platform problem.

After this , They asked me for favourite subjects. I said Operation Systems . Then , they asked for some concepts in OS , including CPU scheduling & its algos like Round robin , SJF etc and later asked which type of scheduling algorithm is used to design actual systems .

Q1. 
Minimum Number of Platforms Problem
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Explanation:
Given two arrays:
• AT - represent...read more
Ans. 
Determine the minimum number of platforms needed at a railway station so that no train has to wait.
• Sort the arrival and departure times arrays in ascending order.

• Use two pointers to iterate through the arrays and keep track of the number of platforms needed.

• Increment the number of platforms needed when a train arrives and decrement it when a train departs.

• Return the maximum number of platforms needed at any point.

• Examp...read more
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

It was System design round.Though , it also started with a brief introduction & later , asked about projects . As my project was related to test classification . In that context , they asked me to design a low level Suggestion system(In any preferred language) .

Q1. 
Spell Checker Problem Statement
You are provided with a list of strings, DICTIONARY[], representing the correct spellings of words, and a query string QUERY that may contain misspelled words. Your task is...read more
Ans. 
Given a list of correct spellings and a query string, return a list of suggested correct spellings if the query is misspelled.
• Iterate through the dictionary to check for matching prefixes with the query string.

• If a match is found, add the corresponding word to the list of suggestions.

• Return the list of suggestions if the query is misspelled, otherwise return an empty list.
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Hard

Coding Test with 3 problems. 1 Easy , 1 Medium , 1 Very Hard

Q1. 
Job Scheduling Problem
You are provided with a list of jobs, where each job has a specific deadline and profit. The goal is to schedule these jobs such that the total profit is maximized. Each job require...read more
Ans. 
The goal is to schedule jobs to maximize profit while meeting deadlines. Each job takes one unit of time and only one job can be scheduled at a time.
• Sort the jobs in decreasing order of profit

• Iterate through the sorted jobs and schedule them based on their deadlines

• Keep track of the total profit achieved

• Ensure each job is completed before its deadline
Answered by AI
Add your answer
Q2. 
Spiral Order Traversal of a Binary Tree
Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.
Input:
The input consists of a single line containing elem...read more
Ans. 
Implement a function to return the spiral order traversal of a binary tree.
• Traverse the binary tree level by level, alternating between left to right and right to left.

• Use a queue to keep track of nodes at each level.

• Append nodes to the result list in the order they are visited.
Answered by AI
Add your answer
Q3. 
Structurally Unique Binary Trees of Dragon Balls
Goku has ‘N’ Dragon Balls, where each Dragon Ball is unique. The ith Dragon Ball has ‘i’ stars on it, meaning the first Dragon Ball has 1 star, the second ...read more
Ans. 
Count the number of structurally unique binary trees that can be constructed with given Dragon Balls.
• Use dynamic programming to solve this problem efficiently.

• The number of structurally unique binary trees can be calculated using Catalan numbers.

• For each test case, calculate the number of structurally unique binary trees modulo 10^9 + 7.

• Return the count of unique binary trees for each test case.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

In depth questions on Subjects like OOP , DBMS , OS , Javascript.

Round duration - 40 minutes
Round difficulty - Hard

Questions on my resume, projects, internship done. Interviewer was a bit harsh on me.

Q1. What are the differences between low-level and high-level programming languages, and can you explain some kernel-related questions?
Ans. 
Low-level languages interact directly with hardware, while high-level languages are more abstract and easier to read/write.
• Low-level languages are closer to machine code and hardware, while high-level languages are closer to human language.

• Low-level languages require more manual memory management and are less portable, while high-level languages have automatic memory management and are more portable.

• Examples of low-lev...read more
Answered by AI
Add your answer