Kickdrum interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Kickdrum
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Journey
I am 22 years old. Don't feel shy about saying I am a small-town girl born into a middle-class family. I have learned all the required skills that a company looks for, such as making one coding language my strength and improving my communication skills.
Application story
This was an on-campus opportunity. The company visited our campus and we directly applied through their portal.
Why selected/rejected for the role?
Got selected because I had all the skills required and gave answers to the coding questions asked in the rounds.
Preparation
Duration: 8 months
Topics: Arrays, Linked List, Patterns, Trees, Maps.
Tip
Tip

Tip 1 : I prepared all topics from my Coding Ninjas Course and Udemy. 
Tip 2 : I practiced 100+ questions on coding platforms.

Application process
Where: Campus
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Have good projects and internships. 
Tip 2 : Keep short and do not put false things.

Interview rounds

01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date3 Aug 2023
Coding problem2

I got a calypod test with a test window of 90 minutes in which I needed to complete a 60-minute test. This test was a mixture of aptitude, computer programming and computer subjects, which were 45 in number. It had two coding questions as well.

1. Leaders in an array

Easy
15m average time
90% success
0/40
Asked in companies
AdobeQuikrMicrosoft

Given a sequence of numbers. Find all leaders in sequence. An element is a leader if it is strictly greater than all the elements on its right side.

Note:
1. Rightmost element is always a leader.

2. The order of elements in the return sequence must be the same as the given sequence
Example:
The given sequence is 13, 14, 3, 8, 2 .

13 Not a leader because on the right side 14 is greater than 13.

14 lt is a leader because no one greater element in the right side.

3 Not a leader because on the right side 8 are greater than 3.

8 It is a leader because no one greater element on the right side.

2 It is a leader because it is the rightmost element in a sequence.

Hence there are 3 leaders in the above sequence which are 14, 8, 2.
Problem approach

Used stack approach to solve this question.

Try solving now

2. Reverse Linked List

Moderate
15m average time
85% success
0/80
Asked in companies
IBMQuikrMicrosoft

Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Try solving now
02
Round
Easy
Video Call
Duration90 minutes
Interview date8 Aug 2023
Coding problem3

I got a call for the interview. There was a lot of technical questions being asked in this, starting from computer subjects, coding concepts, puzzle, and past projects which i wrote in my resume.

1. Count Good Subsets

Moderate
25m average time
75% success
0/80
Asked in companies
Snapdeal Ltd.RED HEALTHCapegemini Consulting India Private Limited

You are given an array ‘ARR’ of size ‘N’ consisting of distinct elements. Your task is to find the total number of good subsets. A subset is called a good subset when you can rearrange the elements of the subset in such a way that each element divides the next element in order. Two subsets are different from each other if there is an element in one subset, which does not exist in the other.

For example :

Consider ARR = [2, 4, 5, 15], all possible good subsets following the given conditions are (2), (4), (5), (15), (2,4), and (5,15). Hence, the total number of good subsets is 6 in this case.
Problem approach

We downsize the Array nums into Array V, by converting the numbers into 10-bit-representations, and store the frequency for repeated occurences.

Try solving now

2. Longest Increasing Subsequence

Moderate
30m average time
65% success
0/80
Asked in companies
PhonePeChegg Inc.Barclays

For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.

Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.

For example:
[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
Problem approach

If the number is greater than the last element of the last bucket (i.e., the largest element in the current subsequence), we append the number to the end of the list. This indicates that we have found a longer subsequence.
Otherwise, we perform a binary search on the list of buckets to find the smallest element that is greater than or equal to the current number. This step helps us maintain the property of increasing elements in the buckets.
Once we find the position to update, we replace that element with the current number. This keeps the buckets sorted and ensures that we have the potential for a longer subsequence in the future.

Try solving now

3. Puzzle

You have 5 jars of pills. Each pill weighs 10 grams, except for contaminated pills contained in one jar, where each pill weighs 9 grams. Given a scale, how could you tell which jar had the contaminated pills in just one measurement?

Problem approach

Tip 1: practice some questions this will help to increase problem solving in interview.
Tip 2: Ask interviewer in case of doubts.

03
Round
Easy
HR Round
Duration20 minutes
Interview date10 Aug 2023
Coding problem1

This was just HR discussion and basic Hr questions were asked and when they will onboard us Whether I can relocate to the job location or not. This went well and hence I received the offer in 2-3 days after this round.

1. Basic HR Questions

What are your expectations from the company, and can you relocate to the job location i.e. Bangalore?

Why do you want to join us?

Where do you see yourself in 5 years?

 

Problem approach

Tip 1: No specific preparation is required.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4656 views
0 comments
0 upvotes
Software Developer
2 rounds | 4 problems
Interviewed by Kickdrum
4796 views
0 comments
0 upvotes
SDE - 1
4 rounds | 6 problems
Interviewed by Kickdrum
1479 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3451 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114578 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57824 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34960 views
7 comments
0 upvotes