WASP3D Software Developer Interview Questions and Answers

Two questions
One dp
One on heap

Q1. Binary search based question
Add your answer
Q2. Behavioural question
Add your answer

Simple DSA ques. and some mcqs. were easy if you are a cp guy

Q1. Given a string of paranthesis tell longest valid parantheisis
Ans. 
Use stack to keep track of indices of opening parentheses, update max length when closing parentheses found
• Use a stack to keep track of indices of opening parentheses

• When a closing parentheses is found, update max length by calculating the difference between current index and top of stack

• Handle edge cases like extra closing parentheses or unmatched opening parentheses

• Example: Input: "(()()", Output: 4 (for "()()")
Answered by AI
Add your answer
Q2. Leetcode 1443. This was exact ques
Add your answer

Q1. Given a string find longest palindromeic substring
Ans. 
Find the longest palindromic substring in a given string.
• Use dynamic programming to check for palindromes within the string.

• Start by checking for palindromes of length 1 and 2, then expand to longer substrings.

• Keep track of the longest palindrome found so far.
Answered by AI
Add your answer
Q2. Simple take not take dp ques But my interviewer was an idiot she didn't understand shit She was reading editorial on the fly. As i told her approch she was like its wrong then read editorial and was fine. ...read more
Add your answer

Q1. MC question on desing pattern
Add your answer
Q2. Graph question, tree and hash
Add your answer
Q3. Design Book my show
Add your answer

Dp question of jump game

Q1. What is ambitionbox
Add your answer
Q2. How many questions are there in that
Add your answer

Q1. Same as above questions
Add your answer
Q2. Same as above questions second one
Add your answer

Q1. It was lld question to design a cab booking system.
Add your answer
Q2. Tell me about yourself
Add your answer

Q1. Binary search for closest element
Ans. 
Binary search to find the closest element in a sorted array
• Implement binary search to find the target element in the array

• Keep track of the closest element found so far while searching

• Update the closest element if a closer one is found during the search
Answered by AI
Add your answer
Q2. String manipulation
Add your answer

Q1. Low level Design for an online e-commerce website
Ans. 
Low level design for an online e-commerce website involves designing the architecture and components of the website.
• Identify the main components such as user interface, database, payment gateway, product catalog, etc.

• Design the database schema to store user information, product details, orders, etc.

• Implement user authentication and authorization mechanisms for secure access.

• Integrate payment gateway for processing tran...read more
Answered by AI
Add your answer

Q1. Maximum Sum Subarray
Add your answer
Q2. Insert node in binary search tree
Ans. 
To insert a node in a binary search tree, compare the value of the node to be inserted with the current node and traverse left or right accordingly.
• Start at the root node and compare the value of the node to be inserted with the current node.

• If the value is less than the current node, move to the left child node. If it is greater, move to the right child node.

• Repeat this process until reaching a leaf node, then insert ...read more
Answered by AI
Add your answer