Kaleidofin SDE Interview Questions and Answers

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

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

Tree , Graph , DP , Arrays ,

Q1. React , React native , app development
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

1.5 hours, 4 coding questions: 1 math, 1 DP, 2 Graphs

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

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.