Temenos Software Developer Intern Interview Questions and Answers

2 easy DSA questions

• Q1. Interest in Matlab
  View Answers (1)

Round duration - 60 minutes
Round difficulty - Medium

Round 1  was a coding round of 60 min which started around 5:30PM in which 2 problem statements were given. The questions were based on Array and linked list. The platform used for test was coding which was user friendly and which use to display number of test cases passed and some test cases were hidden.

• Q1. Deletion in Circular Linked List You are given a Circular Linked List of integers, and an integer, 'key'. You have to write a function that finds the gi...read more
  View Answers (2)
• Q2. Move All Negative Numbers To Beginning And Positive To End You are given an array 'ARR' consisting of 'N' integers. You need to rearrange the ar...read more
  View Answers (3)

Round duration - 30-35 minutes
Round difficulty - Medium

This round was of technical interview and they asked me various concepts

• Q1. Basic Interview Questions They given me 2 table containing names of different cities and told me to apply left join on them. 1) Asked me about the Languages kno...read more
  Add Answer

Round duration - 90 minutes
Round difficulty - Easy

This round was scheduled for 9am in the morning. The test environment was pretty good . I didn't face any issues on the HireVeu platform. The first test was of Aptitude and then in next section it was Technical MCQ's. The level of questions were mid to high level of difficulty.

• Q1. DBMS Questions What is DML and DDL? Write an SQL query to print the FIRST_NAME from Worker table after replacing ‘a’ with ‘A’. Write an SQL query to print detai...read more
  View Answers (1)

Round duration - 60 minutes
Round difficulty - Medium

The exam was on the same Platform. The first question was about the most difficult Project I've worked on. I have to record a video in that particular platform and then move to the next questions. There was option for a demo video of 1 minute in which you can practice your answers and then can record your answer in the next video of max 5 minutes. The next 2 question were Coding Problems of moderate difficulty and you've to record your approach and then proceed towards solving the code and then record a video stating if you succeed or not and what better could you've done to make it work.

• Q1. Sum Of N Digit Palindromes You are given an integer 'N'. Your task is to return the sum of all N-digit numbers which are palindrome. A number is said to...read more
  View Answers (3)

Round duration - 45 minutes
Round difficulty - Medium

This round was scheduled for 3pm. The interviewer was quite friendly. He asked about me and told me to relax and then answer. He started with asking questions from my Project and how the ideas behind the Project. My Project was related to Deadlock So he asked whether I can implement my Project on any environment. I answered . Then one of my internship Project was related to Web development so He asked me about the backend of the Project. He gave me a few SQL queries and some general DBMS concepts based on the response about using Mysql in the Project. He asked me a few things about AWS and Cloud Computing which I answered. At last he asked some LINUX commands and corrected me once and was satisfied with my answers.

• Q1. OS Questions 1) What is Kernel? 2) What is Deadlock? 3) Why you use Binary semaphores instead of Counting Semaphores? 4) What is threads? What is hardware threa...read more
  View Answers (1)
• Q2. DBMS & Trees Questions

  1) Explain DDL VS DML.
  2) Explain Normalization
  3) B+ Trees and it's working.

  View Answers (1)

Round duration - 90 mins
Round difficulty - Medium

- timing was 5:00 AM in the morning
- 2 coding questions and 10 MCQ
- MCQ tested variety of concepts like Database management, OOPS, pointers and C

• Q1. Car Pooling You are working as a cab driver. Your car moves in a straight line and moves toward the forward direction only. Initially, you have ‘C’ empty seats ...read more
  View Answers (3)
• Q2. Distance Of Nearest Cell Having 1 In A Binary Matrix You have been given a binary matrix 'MAT' containing only 0’s and 1’s of size N x M. You need to fi...read more
  View Answers (3)

Round duration - 30 mins
Round difficulty - Easy

Round was technical + HR round

• Q1. Basic HR questions

  Was asked questions about my project, utility and problems faced and general HR type questions

  View Answers (1)