AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Temenos Software Developer Interview Questions and Answers for Freshers
Temenos Software Developer Interview Experiences for Freshers
3 interviews found
Anonymous
I applied via Job Portal and was interviewed in Dec 2023. There were 3 interview rounds.
Online Coding test conducted virtually .
(1 Question)
- Q1. Python fundamentals and java fundamentals
(1 Question)
- Q1. Asking About us and Background?
I applied via Campus Placement and was interviewed in Jun 2022. There were 3 interview rounds.
Basic coding level and sql questions in paper pen format
(2 Questions)
- Q1. Tell about your recent projects
- Q2. Technologies learned and implemented
- Ans.
I have experience with various technologies including Java, Python, and SQL.
Proficient in Java programming language and have implemented it in various projects
Experience with Python and its libraries such as NumPy and Pandas for data analysis
Familiarity with SQL and database management systems such as MySQL and Oracle
Knowledge of web development technologies such as HTML, CSS, and JavaScript
Experience with version cont
Interview Preparation Tips
- SQL
- arrays
- Python
1.prime
Saurav Kumar
Interview Questionnaire
5 Questions
- Q1. SQL Querry
- Q2. Programming
- Q3. Projects
- Q4. Project
- Q5. HR Questions
Interview Preparation Tips
Experience: I was from civil branch so had the above listed sections for pen paper written test. We had to attempt any 2 of the first 3 and last two were cumpolsory (Same for mechanical branch also). For CS, IT, ECE and EEE there were only 2 sections - first was programming - 5 questions and second was situational based.
All the three sections consisted 5 questions in each sections. Questions were very easy and hardly a pen was needed to solve. Quants section consisted of questions on binary to decimal, pipes and cistern and number system. Verbal section consisted of a passage followed by 5 questions and Logical section consisted of 5 simple sequence and series questions.
In 4 th section, we were asked to write an algorithm/flowchart for a given scenarion with some contraints - opening a bank account.
Last section was situational based questions. We were asked to exoress our views in maximum of 100 words on what we would do in a given situation.
Tips: Skip vrbal part as there can be chance of getting wrong. Solve quants and logical as there would be 100% chance of being correct due to very easy questions.
In 4th section, draw flowchart/tree showing how you will proceed and what you think. Before proceeding further think like a layman person how he will fill the form and then decide how to write an algorithm so that even a layman can understand well how to proceed with that particular form. Show output screens, consider exceptions, find every possible combinations for the various options given in the problem.
For last question, try to be practical, brief, concise and to the point. Don't write anything in round about manner.
Above all, as this is pen paper test, write in a beautiful hand writting.
Duration: 45 minutes
Total Questions: 12
Round: Technical Interview
Experience: The technical interview was easy. The questions were straingh forward. Questions were based on projects that I had done. I had Informatics Practices (Java) in class 12 so I told interviewer about database management. I was asked to explain tables used in project and a SQL Querry which I failed to answer.
Then she asked me to write a program to determine which offer is better to invest if in one interest rate increases by 2 each year and the one in which it increases by 1. I quickly wrote it. She said to improve the DBMS part and applauded for the programming skills.
Tips: Be confident and true. They ask only what you say about yourself. Prepare well for SQL querries as they focus more on SQL. Also practice programming as one queston will be essentially on it. Don't try to learn all languages. Know only one but know well. For civil students, have one project that involves programming. Try to learn MATLAB programming during B.Tech. It will make a good impact.
Round: HR Interview
Experience: The HR round was very easy. HR was very friendly. I was asked to introduce myself and then he asked me to explain about my project which I had done in MATLAB. He then asked HR questions like why I wanted to join software industry, where I see myslef in 5 years, previous interview experiences.
Tips: Be cool and confident. If you made till HR round, the probability of being selected in 90%. For civil students, try to be familiar with programming languages and SQL. Also try to have some extra skills that make you different from others. Don't think civil engineers only build buildings and roads; there is a lot more for us to do. Its always good to stand away from crowd.
All the best!
General Tips: Have good command on basics of what learnt C++ or Java and MySQL in class 12. Try to have a project using any programming skill if you are from non CS/IT background as it will help you prove you interest in programming despite your branch. Knowing foreign language atleast till intermediate level will add stars to your extra skills.
Skill Tips: For civil and mechanical students, if you has C++ or Informatics Practices in class 12, be in touch with that knowledge. They test only basics. Familiarize yourself with OOPS and SQL querries.
Be confident with what you speak and speak in clear voice. If you don't know simply say no. Must attent the interview with a good explanations of questions asked about your weak skills.
Skills: Confidence, Programming Skills In Any Language Like C, Database Management
College Name: VIT Vellore
Motivation: Interest in programming.
Funny Moments: When HR asked where I see myself in 5 years I said that I see myself in Europe. To which he said that he is hiring for India and when I said that I am hired for India right now but not for 5 years. He smiled with the answer and wished me all the best.
Interview questions from similar companies
I appeared for an interview before Sep 2020.
(3 Questions)
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 ...
- 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...
- 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...
- 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
- 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...
- 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'.
(1 Question)
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...
- 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...
(1 Question)
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 stringQUERYthat may contain misspelled words. Your task is... - 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.
Interview Preparation Tips
Tip 1 : Practice a lot of problems from leetcode/coding ninjas or some other platform.
Tip 2 : Participate in daily contests on codeforces, leetcode, kickstart, etc.
Tip 3 : Include new topics while learning/solving Data structures problems like tries, BIT, etc.
Tip 1 : Mention your competitve programming skills and profiles in resume if possible.
Tip 2 : While mentioning things in resume: mention by numbers.
Tip 3 : Make a neet resume in some standard format(maybe by using LaTeX)
Tip 4 : Have atleast 2 projects(on which you are confident) in resume
Tip 5 : Don't put false positive on resume.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(3 Questions)
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...
- 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
- Q2.
Spiral Order Traversal of a Binary Tree
Given a binary tree with
Nnodes, your task is to output the Spiral Order traversal of the binary tree.Input:
The input consists of a single line containing elem... - 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.
- 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 ...
- 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.
Round duration - 60 minutes
Round difficulty - Hard
In depth questions on Subjects like OOP , DBMS , OS , Javascript.
(1 Question)
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...
Interview Preparation Tips
Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume
Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.
Skills evaluated in this interview
I applied via LinkedIn and was interviewed in Mar 2021. There were 3 interview rounds.
Interview Questionnaire
2 Questions
- Q1. Basic C++ questions mainly on OOPS.
- Q2. Few puzzles
Interview Preparation Tips
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DBMS.
- Q1. What is data integrity?
- Ans.
Data integrity refers to the accuracy, consistency, and reliability of data throughout its lifecycle.
Data integrity ensures that data is accurate and consistent in storage and transmission.
It involves maintaining the quality and reliability of data over time.
Methods for ensuring data integrity include checksums, encryption, and error detection codes.
Examples of data integrity violations include data corruption, unautho
- Q2. What is a trigger in the context of a database management system?
- Ans.
A trigger is a special type of stored procedure that automatically executes when certain events occur in a database.
Triggers are used to enforce business rules, maintain data integrity, and automate repetitive tasks.
They can be triggered by INSERT, UPDATE, or DELETE operations on a table.
Examples of triggers include auditing changes to a table, updating related tables when a record is modified, or enforcing referential
- Q3. What is the difference between clustered and non-clustered indexes in a database management system?
- Ans.
Clustered indexes physically order the data in the table, while non-clustered indexes do not.
Clustered indexes determine the physical order of data in the table, while non-clustered indexes do not.
A table can have only one clustered index, but multiple non-clustered indexes.
Clustered indexes are faster for retrieval of data, especially range queries, compared to non-clustered indexes.
Non-clustered indexes are stored se...
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round with questions on DBMS.
- Q1. What is the difference between UNION and UNION ALL in SQL?
- Ans.
UNION combines and removes duplicates, UNION ALL combines without removing duplicates.
UNION merges the result sets of two or more SELECT statements and removes duplicates.
UNION ALL merges the result sets of two or more SELECT statements without removing duplicates.
UNION is slower than UNION ALL as it involves removing duplicates.
Example: SELECT column1 FROM table1 UNION SELECT column1 FROM table2;
Example: SELECT column...
- Q2. What are the functions of a cursor in PL/SQL?
- Ans.
A cursor in PL/SQL is used to retrieve and process multiple rows of data one at a time.
Allows iteration over a result set
Retrieves data row by row
Can be used to update or delete rows in a table
Must be declared, opened, fetched, and closed
- Q3. Write a SQL query to fetch the nth highest salary from a table.
- Ans.
SQL query to fetch the nth highest salary from a table
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to fetch the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
This was a managerial round with typical behavioral problems.
Interview Preparation Tips
Tip 1 : Since this was a SQL post, I would suggest you to get the basics intact and try practicing few queries.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Questionnaire
16 Questions
- Q1. Simple linked list questions-find middle element,given a pointer to second last element delete it
- Q2. Explain insertion sort,quicksort
- Ans.
Insertion sort and quicksort are sorting algorithms used to sort arrays of data.
Insertion sort: iterates through the array and inserts each element into its proper position.
Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.
Insertion sort is best for small arrays, while quicksort is best for large arrays.
Bot...
- Q3. Concept of virtual destructors,runtime polymorphism
- Q4. Test cases for an installation software like check if sufficient memory available,check for a previous version,check to undo all the changes made to the system while quitting the installation. 5.2 puzzles
- Q5. Merge two sorted linked lists using recursion
- Ans.
Merge two sorted linked lists using recursion
Create a recursive function that compares the first nodes of both lists
Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list
Base case: if one list is empty, return the other list
Return the merged list
- Q6. Given an integer(consider 4 bytes) find which byte is zero
- Ans.
Given an integer, determine which byte is zero.
Convert the integer to a byte array using bitwise operations.
Iterate through the byte array and check for a zero value.
Return the index of the zero byte.
Consider endianness when converting to byte array.
- Q7. Program to check whether your machine is little endian or big endian
- Ans.
To check endianness, create a 4-byte integer with a known value and check the byte order.
Create a 4-byte integer with a known value
Check the value of the first byte to determine endianness
If the first byte is the least significant, the machine is little endian
If the first byte is the most significant, the machine is big endian
- Q8. Print something before execution of main()(use static objects)
- Ans.
Static objects can be used to print something before main() execution.
Static objects are initialized before main() execution
They can be used to print something before main()
Example: static int x = printf("Hello World!");
Output: Hello World! will be printed before main() execution
- Q9. Memory allocation for static varibles(when,which segment etc)
- Ans.
Static variables are allocated memory in the data segment of the program's memory space.
Static variables have a fixed memory location throughout the program's execution.
They are initialized to zero by default.
If initialized explicitly, they are stored in the data segment.
Static variables can be accessed by any function in the program.
- Q10. Find space and time complexity for a recursive function(he wrote it)
- Ans.
Finding space and time complexity of a recursive function.
Space complexity is the amount of memory used by the function.
Time complexity is the amount of time taken by the function to execute.
Recursive functions have higher space complexity due to the call stack.
Time complexity can be calculated using Big O notation.
Examples of recursive functions include factorial and Fibonacci sequence.
- Q11. Some questions on major project
- Q12. Preprocessor directives,volatile keyword
- Q13. Virtual pointer table,operator overloading,friend functions,semaphores
- Q14. Diamond heirarchy problem
- Ans.
Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.
Occurs when a class inherits from two classes that share a common base class
Can lead to ambiguity in method calls and data members
Solved using virtual inheritance or by using interfaces
- Q15. Fibonacci series.(:P)
- Q16. Puzzle
Interview Preparation Tips
Experience: 1. Aptitude-Mostly caselets on ordering and some easy quant questions.
2. c/c++-No objective questions.Mostly on basics(function pointers,give output of string based codes).Some simple progams(Find smallest of three numbers using conditional operators.gcd using recursion)
3.Data Structures-LCA for BST,2's compliment,reverse a doubly linked list.
College Name: NA
Skills evaluated in this interview
Interview Questionnaire
20 Questions
- Q1. He asked me my specialization?
- Q2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that
- Q3. He asked me to tell him about my favorite project
- Q4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happe...
- Q5. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons requ...
- Q6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it
- Ans.
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
- Q7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)
- Q8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?
- Q9. Which are the four storage classes in C
- Ans.
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
- Q10. Given a program: int i; int main() { int j; int *k = (int *) malloc (sizeof(int)); … } Where are each of these variables stored?
- Ans.
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
- Q11. Question on polymorphisms
- Q12. He again went back to the first question he had asked me. Once again
- Q13. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP quest...
- Q14. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not
- Ans.
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
- Q15. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I rea...
- Q16. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc
- Q17. Finally, he asked me whether I had any questions
- Q18. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obv...
- Q19. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers
- Q20. We also talked a bit about my phone browser project
Interview Preparation Tips
Duration: 15 minutes
Total Questions: 1
Round: Test
Duration: 30 minutes
Total Questions: 2
Round: Test
Duration: 30 minutes
Total Questions: 3
Round: Test
Total Questions: 4
Round: Technical Interview
Experience: 1.When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.2.I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.3.I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.4. So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.5.I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.I’ll try to update this with a better solution, sometime soon.6.This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.7.This is simple. Study DIP8.I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.
Round: Technical Interview
Experience: He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)
1. static, extern, register, auto2.I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly.3.this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it. three non-A grades and that’s all they ask about. What’s wrong with this world?!)Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.4.He again went back to the first question he had asked me. Once again5.I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.6.I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.7.I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.8.I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.9.I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.
Round: Puzzle Interview
Experience: After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.1.You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’2. I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.
General Tips: Finally hired by Adobe. Special thanks to AmbitionBox team. Really amazing site for sharing experience. That’s all for the Adobe. They are focusing on your approach and your coding skills. All the best.
Skills: Algorithm, Data structure, C++, C, DIP
College Name: BIT Mesra
Skills evaluated in this interview
Interview Questionnaire
12 Questions
- Q1. Given a binary tree and an integer x, return whether the binary tree has a path from root to a leaf whose values sum to x
- Q2. Gievn a binary tree and return all root to leaf node pathss row,col and value
- Ans.
Return all root to leaf node paths in a binary tree with row, col and value.
Traverse the binary tree recursively and keep track of the current path.
When a leaf node is reached, add the path to the result array.
Include row, col and value of each node in the path.
Use an array of strings to store the paths.
- Q3. He then asked me to give test cases for testing this program
- Q4. Given two unsorted arrays of numbers and asked me to find the intersection
- Q5. GetMax() function for a stack in O(1)
- Ans.
To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.
Create a separate stack to keep track of maximum values
Push the maximum value onto the stack whenever a new maximum is encountered
Pop the maximum value stack whenever the top element of the main stack is popped
Return the top element of the maximum value stack to get the maximum value in O(1)
- Q6. GetMax() function for a queue in O(1)
- Ans.
To get max element from a queue in O(1) time complexity
Maintain a separate variable to keep track of the maximum element in the queue
Update the maximum element variable whenever a new element is added or removed from the queue
Return the maximum element variable when getMax() function is called
- Q7. Given an array in which consecutive elements differ by 1, i.e. a[i] – a[i + 1] = 1 or -1, and an element x, find the element in the array
- Q8. Given an array, find the Next Greatest Element to the right for each element
- Ans.
Find the Next Greatest Element to the right for each element in an array of strings.
Iterate through the array from right to left
Use a stack to keep track of elements
Pop elements from stack until a greater element is found
If no greater element is found, assign -1
Return the result array
- Q9. Given an expression, remove unnecessary parenthesis. For example if (((a + b)) * c) is given make it (a + b) * c, as it evaluates in the same way without those parenthesis also
- Ans.
To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.
Identify and remove parenthesis around single variables or constants
Identify and remove parenthesis around expressions with only one operator
Identify and remove parenthesis around expressions with operators of equal precedence
Identify and remove parenthesis around expressions with operators of different ...
- Q10. Given an array of integers, find the maximum product which can be formed by three numbers
- Ans.
Find the maximum product of three integers in an array.
Sort the array in descending order.
Check the product of the first three numbers and the product of the first and last two numbers.
Return the maximum of the two products.
- Q11. Given an array of integers, find the length of the longest consecutive sub array which forms an AP
- Ans.
Find length of longest consecutive sub array forming an AP from given array of integers.
Sort the array in ascending order
Iterate through the array and find the longest consecutive sub array forming an AP
Use a variable to keep track of the length of the current consecutive sub array forming an AP
Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far
- Q12. Given a binary tree, connect all the nodes at the same level. Each node will have a next pointer; you have to make it point to the next node to its right in the same level. If there is no such node, make ...
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Temenos Interview FAQs
Tell us how to improve this page.
Temenos Interviews By Designations
- Temenos Software Engineer Interview Questions
- Temenos Associate Product Engineer Interview Questions
- Temenos Business Analyst Interview Questions
- Temenos Software Developer Interview Questions
- Temenos Product Engineer Interview Questions
- Temenos Associate Software Engineer Interview Questions
- Temenos Test Engineer Interview Questions
- Temenos Senior Test Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Java Software Developer Interview Questions
- Show more
Temenos Software Developer Interview Process for Freshers
based on 2 interviews
Interview experience
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Temenos Software Developer Reviews and Ratings
based on 26 reviews
Rating in categories
|
Senior Software Engineer
818
salaries
|  ₹6 L/yr - ₹17.4 L/yr |
|
Software Engineer
753
salaries
| ₹4.5 L/yr - ₹12 L/yr |
|
Senior Test Engineer
434
salaries
| ₹5.8 L/yr - ₹15 L/yr |
|
Test Engineer
361
salaries
| ₹4.5 L/yr - ₹9.5 L/yr |
|
Associate Product Engineer
254
salaries
| ₹5.8 L/yr - ₹11.2 L/yr |
24/7 Customer
Oracle Cerner
Adobe
Thomson Reuters
- Home >
- Interviews >
- Temenos Interview Questions >
- Temenos Software Developer Interview Questions for Fresher
