Kaleidofin Director Interview Questions and Answers

Q1. Business Head will take the interview regarding job
Add your answer

Q1. Hr will take interview
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

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

90 min long test, with 4 coding questions on data structures and algorithms, 2 of them being the medium and other medium-hard.

Q1. Distinct subsequences, leetcode problem link: leetcode.com/problems/distinct-subsequences
Add your answer

Alert notification and logging system

Snakes and Ladder problem

2-3 coding questions were asked - from easy -> medium -> hard level. 1st and 2nd questions were around dynamic programming. Couldn't reach till third question since 1st two questions took time.