Springworks SDE Intern Interview Questions and Answers

Q1. Promises in javascript
Ans. 
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.
Answered by AI
Add your answer

Questions trees and graphs.

2 DSA questions Both are from DP

Q1. 2 Questions , 1 is DSA
Add your answer
Q2. Second question is Puzzle
Add your answer

Q1. Implement tail f
Add your answer

Implement tail -f command

Q1. Kafka partitions
Add your answer
Q2. Elasticsearch queries
Add your answer

Q1. Why Browserstack?
Ans. 
Browserstack is a popular cloud-based cross-browser testing tool used by developers worldwide.
• Provides access to a wide range of browsers and devices for testing

• Allows for parallel testing to save time and increase efficiency

• Integrates with popular testing frameworks like Selenium and Appium

• Offers features like screenshots, video recordings, and debugging tools

• Used by companies like Microsoft, Twitter, and Airbnb for t
Answered by AI
Add your answer
Q2. Any challenge you faced at current company?
Ans. 
Yes, I faced a challenge in integrating a new third-party API with our existing system.
• Had to understand the documentation of the API thoroughly

• Encountered compatibility issues with our system

• Worked closely with the API provider to troubleshoot and resolve issues
Answered by AI
Add your answer

Q1. DSA problems on linked list, OOPs in depth programming, design pattens in Java. Some theoretical knowledge on OOPs and design patterns
Add your answer

Medium to hard questions based on arrays, dp

Q1. Quick sort algorithm
Ans. 
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
• Divides array into smaller sub-arrays based on a pivot element

• Recursively sorts sub-arrays

• Combines sorted sub-arrays to get final sorted array

• Time complexity: O(n log n) on average, O(n^2) worst case

• Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Answered by AI
Add your answer
Q2. Modified rotate a matrix
Ans. 
Rotate a matrix by 90 degrees in place
• Transpose the matrix

• Reverse each row of the transposed matrix
Answered by AI
Add your answer

Q1. JavaScript based, reduce, map, Database indexing
Add your answer