i
Interview Kickstart
Filter interviews by
Clear (1)
Top trending discussions
I applied via Job lever and was interviewed before Sep 2021. There were 2 interview rounds.
Easy leetcode code 2 questions , HTML5 css javascript simple screen design
I applied via LinkedIn and was interviewed before Sep 2021. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Sep 2023. There was 1 interview round.
Equation, ratio and proportion
I applied via Approached by Company and was interviewed before Mar 2023. There were 3 interview rounds.
I was interviewed in Aug 2022.
2 hrs duration with 2 easy level dsa questions and 15 around mcqs based on core cs concepts.
Implementing stack using linked list
Create a Node class with data and next pointer
Create a Stack class with top pointer
Implement push() method to add element to top of stack
Implement pop() method to remove element from top of stack
Implement peek() method to return top element without removing it
Find the first duplicate value in an array of strings.
Create a hash table to store the frequency of each string.
Iterate through the array and check if the string already exists in the hash table.
If it does, return the string. If not, add it to the hash table.
If no duplicates are found, return null or an appropriate message.
I applied via LinkedIn and was interviewed before Jul 2023. There were 3 interview rounds.
Basic DSA questions were asked.
Round 1 -> Coding interview -> ask 2 Leetcode problems
Round 2-> HR
I applied via Referral and was interviewed before Jul 2021. There were 2 interview rounds.
Use Fisher-Yates shuffle algorithm to play songs randomly without repetition.
Create an array of songs
Use Fisher-Yates shuffle algorithm to shuffle the array
Play the first song in the shuffled array
Remove the first song from the array
Repeat steps 3-4 until all songs have been played
Reverse a linked list
Iterate through the linked list and change the direction of the pointers
Keep track of the previous, current, and next nodes
Set the head of the linked list to the last node after reversing
Hashing algorithm to count maximum number of 1s in a 2D matrix.
Create a hash table to store the count of 1s in each row.
Traverse through each row and update the count in the hash table.
Find the row with the maximum count of 1s in the hash table.
Return the count of 1s in that row.
based on 1 interview
Interview experience
Program Advisor
22
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Director
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Talent Acquisition Specialist
7
salaries
| ₹0 L/yr - ₹0 L/yr |
LeetCode
HackerRank
GeeksForGeeks
upGrad