SIXT Research & Development Software Developer Intern Interview Questions and Answers

There were 3 questions in this round. One question was a dynamic programming question and other were based on map and string manipulation

Q1. They asked interest between backend and frontend and connected with respective interviewers, asked about projecrs. Dsa, oops and logic to a parking problem algorithm
Add your answer

Q1. Round with interviewer and CTO asked about oast experiences and core concept of CS
Add your answer

Q1. Basic question on personality and communicated further
Add your answer

General reasoning and Mathmatics Aptitude

Q1. Core Java and Coding questions
Add your answer

Q1. FInd the max triplets such that i
Ans. 
Find the max triplets such that i
• Sort the array in ascending order

• Iterate over the array and keep track of the maximum triplet

• Return the maximum triplet
Answered by AI
Add your answer
Q2. Find the duplicate record in MySQL table
Ans. 
Finding duplicate records in MySQL table
• Use GROUP BY and HAVING clause to group and filter duplicate records

• SELECT statement with COUNT(*) function can be used to count the number of occurrences

• UNIQUE constraint can be added to the table to prevent duplicates
Answered by AI
Add your answer

Q1. To find the kth minimum element from BST
Ans. 
To find the kth minimum element from a Binary Search Tree (BST)
• Perform an in-order traversal of the BST to get elements in sorted order

• Return the kth element from the sorted list

• Time complexity: O(n) where n is the number of nodes in the BST
Answered by AI
Add your answer
Q2. Basic OOPs question like inheritance encapsulation
Add your answer

Q1. In a BST two numbers are swapped find swapped nos.
Ans. 
To find swapped numbers in a BST, perform inorder traversal and keep track of previous node.
• Perform inorder traversal of the BST

• Keep track of the previous node while traversing

• If at any point, the current node's value is less than the previous node's value, those are the swapped numbers
Answered by AI
Add your answer
Q2. What you did in college projects
Add your answer

Q1. Puzzles: find the fastest 3 horses in 25 horse race with a race and 5 horses can be run at a time
Add your answer
Q2. Weakness and strength. how a friend will describe you
Add your answer

Basic dsa, output based questions

Q1. Discussion around projects and tech stack
Add your answer

Q1. General questions on mobile development with flutter
Add your answer

Q1. Core : DBMS , oops in depth coding: basic DSA questions based on Arrays, String.
Add your answer

Q1. He asked me graph questions ( medium level ) based on a node to root, and min cost to target. note: if you really want to crack the yata.com interview practice graph question and they ask a leetcode questi...read more
Add your answer

2 DSA questions, 1 was Sliding Window (DP problem), Simple Linked List

Q1. DBMS, Operating system, and general quiz
Add your answer
Q2. Last 2nd Highest salary in sql
Ans. 
To find the last 2nd highest salary in SQL, use a subquery with the MAX function.
• Use a subquery to find the maximum salary excluding the highest salary

• Select the maximum salary from the result of the subquery
Answered by AI
Add your answer