i
SpeedLabs
Filter interviews by
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
I applied via Company Website and was interviewed before Nov 2022. There were 4 interview rounds.
3 questions in 3 hr, topics were Dp, Strings, Tree
1hr durations 40 questions, main topics were patterns, profit loss, work man , etc.
I appeared for an interview in Jan 2025.
Data structures, particularly strings, play a crucial role in problem-solving.
I have a strong technical background, excellent problem-solving skills, and a passion for software development.
I have a Bachelor's degree in Computer Science and 5 years of experience in software development.
I am proficient in multiple programming languages such as Java, Python, and JavaScript.
I have a track record of delivering high-quality code on time and within budget.
I am a quick learner and always eager to stay u...
Strength: Problem-solving skills, Weakness: Impatience
Strength: Strong problem-solving skills demonstrated through successful projects
Weakness: Impatience when tasks take longer than expected, working on improving patience through time management techniques
Passion for problem-solving and creating innovative solutions drove me to pursue a career in software development.
Fascination with technology and its potential to improve lives
Enjoyment of logical thinking and coding challenges
Desire to constantly learn and adapt in a fast-paced industry
Previous experience in programming projects or internships
My area of expertise in programming languages is in web development, specifically with JavaScript, HTML, and CSS.
Proficient in JavaScript for client-side scripting and server-side development with Node.js
Experienced in building responsive and interactive web applications using HTML and CSS
Familiar with popular frameworks and libraries like React, Angular, and Bootstrap
JavaScript is a high-level, interpreted programming language used for creating interactive websites.
JavaScript is commonly used for client-side web development.
It allows for dynamic content updates without reloading the page.
JavaScript can be used to create interactive elements like forms, animations, and games.
It is supported by all major web browsers.
JavaScript can also be used for server-side development with Node.j...
posted on 16 Sep 2021
I appeared for an interview in Dec 2020.
Round duration - 120 minutes
Round difficulty - Easy
Given an array of integers ARR
of length N
and an integer Target
, your task is to return all pairs of elements such that they add up to the Target
.
The first line ...
Given an array of integers and a target, find all pairs of elements that add up to the target.
Iterate through the array and for each element, check if the target minus the element exists in a hash set.
If it exists, add the pair to the result. If not, add the element to the hash set.
Handle cases where the same element is used twice in a pair.
Return (-1, -1) if no pair is found.
Tip 1 : Have projects on your resume.
Tip 2 : Good to have internships
Tip 3 : Practice a lot
Tip 1 : Have good projects
Tip 2 : Have knowledge of everything you wrote
posted on 16 Sep 2021
I appeared for an interview in Feb 2021.
Round duration - 70 Minutes
Round difficulty - Medium
Timing was 9:15AM. Platform was not very good. Questions were not well explained.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
Merge overlapping intervals and return sorted list of merged intervals.
Identify overlapping intervals based on start and end times
Merge overlapping intervals to form new intervals
Sort the merged intervals in ascending order of start times
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze to reach its destination, given a matrix representation of the maze.
Use backtracking to explore all possible paths from the starting position to the destination.
Keep track of the current path and explore all possible directions at each step.
Terminate the exploration when reaching the destination or hitting a blocked cell.
Return the list of valid paths found, sorted in alphabe...
Given a string STR
consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographically increasing order.
Return all permutations of a given string in lexicographically increasing order.
Generate all permutations of the given string using backtracking algorithm.
Sort the permutations lexicographically before printing them.
Ensure the string contains unique characters for correct output.
Handle multiple test cases efficiently.
Example: For input 'bca', output 'abc acb bac bca cab cba'.
Tip 1 : Prepare maximum algorithms.
Tip 2 : Deep knowledge of data structure.
Tip 3 : OOPS is must.
Tip 1 : Keep it short.
Tip 2 : Mention only your own projects.
I applied via Campus Placement and was interviewed in Aug 2022. There were 4 interview rounds.
2 coding questions with aptitude question(logical aptitude and quantitative aptitude)
This was a Machine Coding. We need to design a system and then they will check our design by running test cases. It was 2.5 hrs long.
posted on 16 Sep 2021
I appeared for an interview in Feb 2021.
Round duration - 70 minutes
Round difficulty - Medium
Timing was 9:15AM. Platform was not very good. Questions were not well explained.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
Merge overlapping intervals and return sorted list of merged intervals.
Identify overlapping intervals based on start and end times
Merge overlapping intervals to form new intervals
Sort the merged intervals in ascending order of start times
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Recursively try moving in all directions (up, down, left, right) until reaching the destination.
Return the valid paths as a list of strings sorted in alphabetical order.
Tip 1 : Prepare maximum algorithms.
Tip 2 : Deep knowledge of data structure.
Tip 3 : OOPS is must.
Tip 1 : Keep it short.
Tip 2 : Mention only your own projects.
I appeared for an interview in Nov 2020.
Round duration - 60 minutes
Round difficulty - Easy
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...
Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.
Use Dijkstra's algorithm to find the shortest path between the given vertices.
Create a graph data structure to represent the weighted, undirected graph.
Handle cases where no path exists between the given vertices by returning -1.
Optimize the algorithm to handle multiple queries efficiently.
Consider edge cases such as...
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Merge Sort is a divide-an...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively
Sort the two halves separately
Merge the sorted halves to produce a fully sorted array
Time complexity of Merge Sort is O(n log n)
Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]
You are provided with an N * N
maze where a rat is positioned at starting cell MAZE[0][0]
. The goal is to determine and print all possible paths that the rat can take to r...
Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.
Use backtracking to explore all possible paths from the starting cell to the destination cell.
At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.
Keep track of the path taken so far and mark the cells accordingly.
Once the destination cell i...
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Basic coding and MySQL queries. Like Types of join, having and where difference etc.
OOPS concepts refer to Object-Oriented Programming principles like inheritance, encapsulation, polymorphism, and abstraction.
Inheritance: Allows a class to inherit properties and behavior from another class.
Encapsulation: Bundling data and methods that operate on the data into a single unit.
Polymorphism: Ability to present the same interface for different data types.
Abstraction: Hiding the complex implementation detail...
PDO stands for PHP Data Objects, a database access layer providing a uniform method of access to multiple databases.
PDO is a PHP extension that provides a data-access abstraction layer.
It supports multiple database systems like MySQL, PostgreSQL, SQLite, etc.
PDO helps prevent SQL injection attacks by using prepared statements.
It allows for error handling and supports transactions.
Example: $pdo = new PDO('mysql:host=loc...
Business Development Associate
28
salaries
| ₹1 L/yr - ₹4.5 L/yr |
Academic Associate
14
salaries
| ₹0.6 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 |
Faculty of Mathematics
7
salaries
| ₹3 L/yr - ₹4.8 L/yr |
FastInfo
Testbook.com
BrightCHAMPS
Acadecraft