i
SpeedLabs
Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There were 2 interview rounds.
I appeared for an interview in Aug 2024.
I applied via Indeed and was interviewed in Nov 2023. There were 3 interview rounds.
SpeedLabs interview questions for popular designations
I appeared for an interview before Feb 2024.
posted on 4 Jun 2023
I applied via Company Website and was interviewed before Jun 2022. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Jul 2022. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Sep 2021. There were 3 interview rounds.
Yes, I am able to sell any product.
I have experience in sales and have successfully sold various products in the past.
I am confident in my ability to understand the features and benefits of a product and effectively communicate them to potential customers.
I am also skilled in identifying and addressing customer needs and objections to close a sale.
For example, I have sold software products, consumer goods, and even ser
I appeared for an interview in Mar 2021.
Round duration - 45 minutes
Round difficulty - Medium
Timing (10 am- 11 am)
For this round I had slightly more time than the last, due to the fact that the weekend fell in between.The interviewer was very very cool and helping this time, something which I kept at the last in my list of probable things that can happen during an interview. Duration of this round was around 45 minutes.
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...
Connect ropes with minimum cost by merging smallest ropes first.
Sort the array of rope lengths in ascending order.
Merge the two smallest ropes at each step to minimize cost.
Keep track of the total cost as you merge the ropes.
Repeat the merging process until all ropes are connected.
Return the total cost as the minimum cost to connect all ropes.
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
A Binary Search Tr...
Validate if a given binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Recursively check if both the left and right subtrees are also binary search trees.
Round duration - 30 minutes
Round difficulty - Medium
This round was on call where I was just supposed to answer the HRquestions that were asked. It started with a brief interview with one another and then moved to questions on DBMS, operating systems, computer networks and all. Almost 10-15 questions were asked and I probably answered 90% of them correctly.
Tip 1 : practice on gfg and coding ninjas
Tip 2 : compete in online coding contests
Tip 3 : learn DSA and practice regularly from GFG or leetcode
Tip 1 : put your entire valuable experience in brief
Tip 2 : put the handle of you competitive coding profiles
Top trending discussions
based on 9 interviews
Interview experience
based on 196 reviews
Rating in categories
Business Development Associate
24
salaries
| ₹1 L/yr - ₹4.5 L/yr |
Academic Associate
14
salaries
| ₹3 L/yr - ₹8 L/yr |
Customer Service Executive
8
salaries
| ₹1.5 L/yr - ₹3 L/yr |
Team Manager
7
salaries
| ₹5 L/yr - ₹10.5 L/yr |
Business Development Executive
7
salaries
| ₹2 L/yr - ₹4 L/yr |
BYJU'S
Unacademy
Toppr
Vedant