i
Kickdrum
Filter interviews by
I applied via Recruitment Consultant and was interviewed in Nov 2021. There were 4 interview rounds.
The coding test was of medium difficulty, and the overall experience was great.
I applied via Company Website and was interviewed in Sep 2024. There was 1 interview round.
Errors in projects can be resolved by debugging, testing, and seeking help from colleagues or online resources.
Use debugging tools to identify and fix errors in the code.
Write unit tests to catch errors early in the development process.
Consult with colleagues or online communities for help and guidance.
Review code for common mistakes and best practices.
Keep documentation up to date to help troubleshoot errors in the fu
Kickdrum interview questions for popular designations
Test cases for a login page
Verify valid username and password login successfully
Verify error message displayed for invalid username
Verify error message displayed for invalid password
Verify user is redirected to forgot password page when forgot password link is clicked
Automating the application involves using tools and scripts to perform tasks automatically.
Identify repetitive tasks that can be automated
Choose appropriate automation tools like Selenium for web applications
Write scripts to automate tasks such as data entry or testing
Set up scheduled tasks for regular automation
Monitor and maintain automated processes for efficiency
DSA and fundamentals of programming languages
I applied via Campus Placement and was interviewed in Apr 2023. There were 3 interview rounds.
Round 1 was average fifteen 15 mcq all were cpp questions related to oops concepts and 2 coding questions realted to dsa dynamic programming etc .....
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
The coding round was very very easy.
Top trending discussions
I was interviewed before Feb 2021.
Round duration - 65 minutes
Round difficulty - Easy
There were 2 sections –
Aptitude and Logical Reasoning and MCQ based on Java question ,C++, coding for 20 min and 45 min respectively.
Section A- Not very difficult to clear this round although less time was a problem.
Section B- It contains 15 multiple choice question on c/c++,java and 4 simple coding questions
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
Traverse the linked list using two pointers, one moving at double the speed of the other.
If the two pointers meet at any point, there is a cycle in the linked list.
Use Floyd's Cycle Detection Algorithm for O(N) time complexity and O(1) space complexity.
Round duration - 75 minutes
Round difficulty - Medium
It was an online coding test in which 3 coding question were given.
Given two strings, S
and X
, your task is to find the smallest substring in S
that contains all the characters present in X
.
S = "abdd", X = "bd"
Find the smallest substring in string S that contains all characters in string X.
Iterate through string S and keep track of characters in X found in a window
Use two pointers to maintain the window and slide it to find the smallest window
Return the smallest window containing all characters in X
Given a non-decreasing sorted array ARR
of N
positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...
Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.
Start with the smallest possible integer that cannot be represented, which is 1.
Iterate through the array and update the smallest integer that cannot be represented.
If the current element is greater than the smallest integer that cannot be represented, return tha...
Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...
Calculate the minimum number of moves a Knight needs to reach a target position on a chessboard.
Implement a function that takes knight's starting position, target position, and chessboard size as input
Use breadth-first search algorithm to find the shortest path for the Knight
Consider all possible 8 movements of the Knight on the chessboard
Return the minimum number of moves required for the Knight to reach the target po
Round duration - 60 minutes
Round difficulty - Easy
It started with a discussion on the programs given in coding round. They asked me about my interest field after that they directly jumped into Networking, Linux and Ethical Hacking part looking my interest domain. They asked me various question on networking and linux.
Then they asked me to code a simple c program
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
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.
Keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list as the last node encountered during reversal.
FTP uses port number 21 and SMTP uses port number 25.
FTP uses port 21 for data transfer and port 20 for control information.
SMTP uses port 25 for email communication.
Understanding port numbers is important for network communication.
The OSI Model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven layers.
The OSI Model stands for Open Systems Interconnection Model.
It consists of seven layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application.
Each layer has specific functions and communicates with the adjacent layers.
Example: Layer 1 (Physical) deals with physi...
To copy files in Linux, you can use the 'cp' command.
Use the 'cp' command followed by the source file and destination directory to copy a file.
To copy a directory and its contents, use the '-r' flag with the 'cp' command.
You can also use wildcards like '*' to copy multiple files at once.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 7 interviews
Interview experience
4-10 Yrs
Not Disclosed
2-5 Yrs
Not Disclosed
Software Developer
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Furtados Music India
Saregama India
Shemaroo Entertainment
T-Series