Kaleidofin SDE Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Use three pointers - prev, current, and next - to keep track of the nodes while reversing the linked list.

• Update the head of the reversed linked list as the last node encountered during reversal.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Round duration - 50 minutes
Round difficulty - Easy

2 questions 90 mins, dynamic programming and graph based

Q1. Dont remember dont remember
Add your answer
Q2. I dont remember dont remember
Add your answer

Q1. Last projects worked on
Add your answer
Q2. What are you good at
Ans. 
I am good at problem-solving, coding, and collaborating with team members.
• Strong problem-solving skills

• Proficient in coding languages like Java, Python, and C++

• Effective communication and collaboration with team members
Answered by AI
Add your answer

4 medium to difficult questions

Q1. 2 DSA questions on arrays
Add your answer

Q1. 3 DSA questions on DP , Trees
Add your answer

Q1. Entire Resume was discussed
Add your answer

2 Codes on Hackerrank

Q1. Questions on Tree
Add your answer
Q2. Questions on Java
Add your answer

Q1. Hiring Manager Round
Add your answer

2 questions. 1 was basic level. 2 was of medium level.

Q1. An ambiguous problem statement was given. Asking relevant questions revealed the problem to be largest island in a binary matrix. Was asked to code on an ide. And reduce space complexity to O(1).
Add your answer
Q2. Maximum sum path from root to leaf in an N-ary tree. Was asked to design an appropriate data structure. Then code the solution in O(n) time and O(1) space.
Add your answer

Q1. Through discuss of projects. Methods used.
Add your answer
Q2. First missing positive number in an array of integer in O(n) time O(1) space.
Ans. 
Find first missing positive number in an array in O(n) time and O(1) space.
• Traverse the array and mark the presence of each positive integer by changing the sign of the corresponding index.

• Traverse the array again and return the index of the first positive integer.

• If all integers are present, return the length of the array + 1.

• Example: [3, 4, -1, 1] => mark 3rd and 4th index as negative => return 2.

• Example: [1, 2, 0] =...read more
Answered by AI
Add your answer
Q3. Given an integer, print the relevant column name in an excel sheet. Ex: 1- A , 2-B.......... 26-Z , 27-AA, 28-AB........ Was asked code on an ide and test cases were given.
Ans. 
Given an integer, print the relevant column name in an excel sheet.
• Create a string array of alphabets from A to Z

• Use modulo operator to get remainder and divide by 26 to get quotient

• Append the corresponding alphabet to the result string

• Reverse the result string
Answered by AI
Add your answer

Q1. What are your salary expectations?
Add your answer

Maths,quant for 1 hour duration

Arrays, strings, linked list, palindrome