i
Springworks
Filter interviews by
Clear (1)
I applied via Company Website and was interviewed in May 2024. There were 2 interview rounds.
Some Objective questions and 1 Coding Questions
I was interviewed in Apr 2022.
Round duration - 120 Minutes
Round difficulty - Medium
You are provided with a Binary Tree composed of 'N' nodes, each holding integer values. Your task is to compute the Inorder traversal of this binary tree.
For t...
The task is to find the in-order traversal of a given binary tree.
Implement a recursive function to perform in-order traversal of the binary tree
Start from the left subtree, then visit the root node, and finally visit the right subtree
Use an array to store the values of the nodes in the in-order traversal
Round duration - 50 minutes
Round difficulty - Medium
Interview on google meet
The inner join operation combines rows from two tables based on a common column (key).
Use the JOIN keyword in the SQL query to perform an inner join.
Specify the common column (key) in the ON clause of the join.
The result will contain only the matching rows from both tables.
Round duration - 50 minutes
Round difficulty - Medium
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
Given a sorted matrix, find the position of a target integer in the matrix.
Iterate through each row and column of the matrix
Compare the target integer with the current element
If the target integer is found, return the position
If the target integer is not found, return {-1, -1}
Tip 1 : Focus on data-structures and algorithms fundamentals
Tip 2 : Learn Javascript fundamentals for interviews
Tip 3 : Having good projects on resume is an added advantage
Tip 1 : Do not put false projects on resume.
Tip 2 : Have good projects on your resume
I was interviewed in Jan 2022.
Round duration - 3 Hours
Round difficulty - Hard
3 Coding questions ( 1 medium graph dfs based question , 2 hard level prefix array question ans 3 was a hard question which I don't remember)
2 Database question ( It mostly includes joining 2-3 tables and then you would be able to solve it)
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid counting the same island multiple times.
Increment the island count each time a new island is encountered during traversal.
Consider edge cases such as when the matrix is empty or when
Given an array of integers, determine the contiguous subarray that produces the maximum product of its elements.
A subarray can be derived from th...
Find the contiguous subarray with the maximum product of elements in an array.
Iterate through the array and keep track of the maximum and minimum product ending at each index.
Update the maximum product by taking the maximum of current element, current element * previous maximum, and current element * previous minimum.
Update the minimum product by taking the minimum of current element, current element * previous maximum...
To join multiple models in a DBMS, use SQL JOIN statements based on common keys.
Identify common keys between the models
Use SQL JOIN statements (INNER JOIN, LEFT JOIN, RIGHT JOIN, FULL JOIN) to combine the models based on the common keys
Specify the columns to be selected in the SELECT statement
Round duration - 30 minutes
Round difficulty - Medium
These rounds depends on the type of interviewer.
My friends were asked questions from DSA but from me they asked a lot of questions on Node.JS and React.
Round duration - 30 Minutes
Round difficulty - Medium
This round depends on your interviewer.
My colleagues were asked questions from DS but my interviewer focused just on javascript.
Round duration - 45 minutes
Round difficulty - Easy
It was a managerial round they will test your communication and how well do you handle situations in your life
Tip 1 : Cpanies like SpringWorks are more focused on Development so make sure you have good knowledge in Javascript
Tip 2 : Complete 100-150 questions easy/medium questions on leetcode like 3 sum or invert binary tree
Tip 3 : Have a good knowledge of any RDBMS.
Tip 1 : Make sure your resume is not filled with lots of colors try to give it a simple look
Tip 2 : Mention only those skills in which you have minimum intermediate knowledge ex if you know docker but haven't used it nicely then just don't mention it
I was interviewed in Jan 2022.
Round duration - 90 minutes
Round difficulty - Medium
3 DSA questions, 2 SQL questions
On the DoSelect platform, which was good
Given 'N' 2-dimensional matrices and an array ARR
of length N + 1
, where the first N
integers denote the number of rows in each matrix and the last integer represents t...
The task is to find the minimum number of multiplication operations required to multiply a series of matrices together.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the minimum number of operations needed to multiply matrices.
Iterate through different combinations of matrices to find the optimal solution.
Consider the dimensions of matrices and their compatibility for multiplication...
Hashing is a technique to map large non-negative integers to smaller indices using a hash function. In the context of collision resolution in hash tables, 'Linear Probing' is emp...
Linear Probing in Hashing is a technique to resolve collisions in hash tables by linearly searching for the next available slot.
Implement a function that takes an array of non-negative integers and returns the corresponding hash table using linear probing.
Use the given hash function H(X) = X mod N to map elements to indices in the hash table.
Handle collisions by linearly probing for the next available slot in the hash ...
Round duration - 60 minutes
Round difficulty - Easy
Started off with introductions and projects related questions.
Basic javascript and CSS property-related questions.
An easy DSA question
You are given an array of integers 'ARR' with a length 'N' and a specific integer 'Target'. Your objective is to determine and return all pairs of elements within the array whos...
Given an array of integers and a target sum, find pairs of elements that add up to the target.
Iterate through the array and for each element, check if the complement (target - current element) exists in a hash set.
If the complement exists, add the pair to the result. If not, add the current element to the hash set.
Handle edge cases like duplicates and negative numbers appropriately.
Return pairs in any order as (a, b) o
Round duration - 45 minutes
Round difficulty - Easy
Introduction and two easy to medium DSA questions
Your task is to implement a queue using two stacks. You are provided with ‘Q’ queries and need to handle them, where each query falls under one of these two operations:
...Implement a queue using two stacks with enqueue and dequeue operations.
Use two stacks to simulate a queue - one for enqueue and one for dequeue.
For enqueue operation, push elements onto the enqueue stack.
For dequeue operation, if dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.
Return true for successful enqueue and -1 for empty dequeue.
Example: Enqueue 10, enqueue 20, dequeue (re
Convert a string representing a Roman numeral into its integer equivalent and return the result.
Roman numerals are represented by seven different symbol...
Convert a Roman numeral string to its integer equivalent.
Create a mapping of Roman numeral symbols to their integer values.
Iterate through the input string and add the corresponding integer values.
Handle cases where a smaller value precedes a larger value (e.g., IV = 4).
Tip 1 : Be thorough with your projects
Tip 2 : Have a good understanding of the basics of CSS, React.js, and Node.js
Tip 1 : MERN Stack projects
Tip 2 : Past internships
Springworks interview questions for designations
I was interviewed in Mar 2021.
Round duration - 150 minutes
Round difficulty - Medium
You can give the test any time. Environment was not very well. Questions were not well explained.
You are given the task of reconstructing the address of an Internet resource from a given format.
The address format is: <protocol>://<domain>.ru[/<c...
The task is to extract and print the internet resource address from a given string.
The internet resource address has a specific format:
The
The
The
If
Given an undirected graph as an adjacency matrix and an integer M
, determine whether you can color the vertices of the graph using at most M
colors such that no two adjacent v...
The problem is to determine if it is possible to color the vertices of an undirected graph using at most M colors such that no two adjacent vertices have the same color.
The input consists of the number of test cases, the number of vertices and colors, and the adjacency matrix of the graph.
For each test case, check if it is possible to assign colors to the vertices such that no adjacent vertices have the same color.
Use ...
You are given ‘N’ fences. Your task is to compute the total number of ways to paint these fences using only 2 colors, such that no more than 2 adjacent fences have the sa...
The task is to find the total number of ways to paint fences using 2 colors such that at most 2 adjacent fences have the same color.
Use dynamic programming to solve the problem
Create a 2D array to store the number of ways to paint the fences
Initialize the base cases for the first two fences
Use recurrence relation to calculate the number of ways for the remaining fences
Return the result modulo 10^9 + 7
Tip 1 : Data Structures in must.
Tip 2 : Practice SQL queries.
Tip 3 : DBMS knowledge will be beneficial.
Tip 1 : Keep it short.
Tip 2 : Have some projects on resume.
Get interview-ready with Top Springworks Interview Questions
I was interviewed in Mar 2021.
Round duration - 150 minutes
Round difficulty - Easy
You can give the test any time. Environment was not very well. Questions were not well explained.
You are given the task of reconstructing the address of an Internet resource from a given format.
The address format is: <protocol>://<domain>.ru[/<c...
Reconstruct Internet addresses from given format by extracting protocol, domain, and context if present.
Parse the input string to extract protocol, domain, and context if present
Check if context is present to determine the number of '/' characters in the reconstructed address
Construct the reconstructed Internet address based on the extracted information
Given an undirected graph as an adjacency matrix and an integer M
, determine whether you can color the vertices of the graph using at most M
colors such that no two adjacent v...
Given an undirected graph and an integer M, determine if the vertices can be colored using at most M colors without adjacent vertices sharing the same color.
Use graph coloring algorithm to check if the graph can be colored using at most M colors.
Check if any adjacent vertices have the same color.
Return 'YES' if coloring is possible with at most M colors, else 'NO'.
You are given ‘N’ fences. Your task is to compute the total number of ways to paint these fences using only 2 colors, such that no more than 2 adjacent fences have the sa...
Compute total ways to paint N fences using 2 colors with no more than 2 adjacent fences having the same color.
Use dynamic programming to solve the problem efficiently.
At each step, calculate the number of ways to paint the current fence based on the previous two fences.
Keep track of the count of ways to paint the fences modulo 10^9 + 7.
Return the final count as the answer.
Tip 1 : Practice algorithms
Tip 2 : Practice sql
Tip 1 : Keep it short
Tip 2 : Don't add false achievements
I was interviewed in Mar 2021.
Round duration - 150 minutes
Round difficulty - Easy
You can give the test any time. Environment was not very well. Questions were not well explained.
You are given a string WORD
consisting of lowercase alphabets. Your task is to divide WORD
into N
strings of equal length.
The first line contains an integer 'T' r...
Divide a given string into N equal parts and return the divided strings as an array of strings.
Calculate the length of each part by dividing the length of the string by N.
Iterate through the string and extract substrings of the calculated length.
Return the array of divided strings.
Handle cases where it is not possible to divide the string into N equal parts.
You have been given a set of 'N' houses, each house can be painted using one of three colors: green, red, or yellow. A cost matrix is provided with dimensions 'N' * 3, where ...
Find the minimum total cost to paint all houses such that no two adjacent houses have the same color.
Use dynamic programming to keep track of the minimum cost of painting each house with each color while ensuring no two adjacent houses have the same color.
At each house, calculate the minimum cost of painting it with each color based on the previous house's colors.
Keep updating the minimum cost for each color at each ho...
Tip 1 : Data Structures in must.
Tip 2 : Practice SQL queries.
Tip 3 : DBMS knowledge will be beneficial.
Tip 1 : Keep it short.
Tip 2 : Have some projects on resume.
Top trending discussions
posted on 14 May 2024
Event loop in Node.js manages asynchronous operations by executing callback functions when certain events occur.
Event loop is responsible for handling I/O operations, timers, and callbacks in Node.js
It allows Node.js to perform non-blocking operations efficiently
Event loop continuously checks the event queue for new events to execute
posted on 15 Nov 2024
I applied via Referral and was interviewed in Oct 2024. There was 1 interview round.
Promises in JavaScript are objects representing the eventual completion or failure of an asynchronous operation.
Promises are used to handle asynchronous operations in JavaScript.
They can be in one of three states: pending, fulfilled, or rejected.
Promises can be chained using .then() to handle success and .catch() to handle errors.
2 DSA questions Both are from DP
based on 1 interview
3 Interview rounds
based on 10 reviews
Rating in categories
Associate Product Manager
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Designer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer 1
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Manager
9
salaries
| ₹0 L/yr - ₹0 L/yr |
SpringRole India
Springboard
Spring Computing Technologies
Aurigo