Shipsy Software Developer Interview Questions and Answers

Q1. Question around priority queue
Add your answer
Q2. Decode strings leetcode
Ans. 
Decode strings involves interpreting encoded patterns like '3[a2[c]]' to produce 'accaccacc'.
• Use a stack to handle nested structures. Example: For '2[abc]', push '2' and 'abc' onto the stack.

• Iterate through the string, building numbers and characters. Example: '3[a2[c]]' becomes '3', 'a', '2', 'c'.

• When encountering ']', pop from the stack until '[' is found, then repeat the string as per the number. Example: '2[c]' bec...read more
Answered by AI
Add your answer

Q1. System design questions scenario based
Add your answer

Q1. Questions on multidimensional tree
Add your answer

Basic questions of dbms ,os

Q1. Delete middle node of linked list
Ans. 
To delete the middle node of a linked list, we can iterate through the list to find the middle node and then remove it by adjusting the pointers.
• Iterate through the linked list to find the middle node by using two pointers - one moving one node at a time and the other moving two nodes at a time.

• Once the middle node is found, adjust the pointers to skip over the middle node and connect the nodes before and after it.

• Hand...read more
Answered by AI
Add your answer
Q2. N queen problem
Add your answer

Q1. Coding question on DSA
Add your answer
Q2. Design pattern followed by basic java questions
Add your answer

Q1. Design patterns in java
Ans. 
Design patterns in Java are reusable solutions to common problems in software design.
• Design patterns help in creating flexible, maintainable, and scalable code.

• Some common design patterns in Java include Singleton, Factory, Observer, and Strategy.

• Each design pattern has its own purpose and can be applied in different scenarios.

• Design patterns promote code reusability and help in organizing code in a structured manner.
Answered by AI
Add your answer
Q2. Database designing and java8
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

The aptitude test was in online mode. There were 20 mcq questions and 5 coding questions ranging from easy to hard

After the Aptitude test, the gd was kept in offline mode ( at office ), the topic was "the pros and cons of online classes

Q1. In the 1st technical round, basic questions regarding the languages which i have mentioned in resume was asked. I mentioned python and C in my resume and a coding problem was asked to solve and to further ...read more
Add your answer

Q1. In the second technical OOPS concepts and DSA questions were asked
Add your answer

Aptitude test such as profit and loss , blood relations

Questions on string and map

Q1. Questions like will you be able to work after your assigned time
Add your answer

We were to make a go Lang api using one of the frameworks the company has made named go-fr

Q1. I was asked 3 questions that were easy they were adding two linked list, tortoise and hare method to find the mid of the linked list and 2 sum problem. On top of that verbal skills were also tested as o wa...read more
Add your answer

Q1. The round tested my Go Lang skills and the questions were generally from the assignment and some HR questions
Add your answer