Kaleidofin Software Development Engineer II Interview Questions and Answers

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

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

General Coding Assessment on CodeSignal

Q1. 1. Code walkthrough of online assessment round 2. One medium level DS Algo question 3. One medium level System Design question
Add your answer

Q1. 3 sum problem and number of operations required to make 2 strings same
Ans. 
3 sum problem involves finding 3 numbers in an array that add up to a target sum. Number of operations to make 2 strings same involves finding the minimum number of operations (insert, delete, replace) needed to transform one string into another.
• For 3 sum problem, use a hashmap to store complements of each number and check if the complement exists in the hashmap while iterating through the array.

• For number of operation...read more
Answered by AI
Add your answer

Q1. Nearby app machine coding
Add your answer

Q1. Project and practices followed and hld for inshort
Ans. 
I have experience working on projects using high-level design (HLD) practices.
• Utilized UML diagrams to create HLD for projects

• Followed industry best practices for software design

• Collaborated with team members to ensure HLD aligns with project goals
Answered by AI
Add your answer

Q1. Types of REST API methods?
Ans. 
Types of REST API methods include GET, POST, PUT, DELETE, PATCH, and more.
• GET - Retrieve data from a server

• POST - Create new data on a server

• PUT - Update existing data on a server

• DELETE - Remove data from a server

• PATCH - Partially update data on a server
Answered by AI
Add your answer

4 question (1.5 hrs test) 400 points (100 points for question each)

Q1. Calculate the no.of consecutive zeroes in a binary array
Ans. 
Count consecutive zeroes in a binary array
• Iterate through the binary array and keep track of the maximum consecutive zeroes encountered

• Reset the count of consecutive zeroes when a non-zero element is encountered

• Return the maximum consecutive zeroes found
Answered by AI
Add your answer
Q2. Return k pairs of subsets having sum=num
Ans. 
Return k pairs of subsets with sum=num
• Use a nested loop to iterate through all possible pairs of subsets

• Check if the sum of the subsets equals the target num

• Store the valid pairs in an array and return k pairs
Answered by AI
Add your answer

Coding test was. good enough with leetfcode medium

Coding test was good enogugh with leetcode medum