Shine Software Developer Interview Questions and Answers

3 Medium level dsa questions

Q1. Lld of cab booking system
Ans. 
The Low Level Design (LLD) of a cab booking system involves detailing the system architecture and components at a lower level of abstraction.
• Identify the main components of the system such as user interface, booking engine, payment gateway, and driver allocation algorithm.

• Define the interactions between these components and how data flows between them.

• Specify the data structures and algorithms used for efficient bookin...read more
Answered by AI
Add your answer
Q2. Discussion about online assesment
Add your answer

Q1. Implement an immutable class.
Ans. 
An immutable class is a class whose instances cannot be modified after creation.
• Use final keyword for class declaration to prevent inheritance

• Make all fields private and final to prevent modification

• Do not provide setter methods, only getter methods should be used
Answered by AI
Add your answer
Q2. Implement a springboot service that intercepts http requests.
Ans. 
Implement a Springboot service to intercept HTTP requests.
• Create a Springboot application with necessary dependencies.

• Implement a custom interceptor by extending HandlerInterceptorAdapter.

• Override preHandle and postHandle methods to intercept requests and responses.

• Register the interceptor in the WebMvcConfigurerAdapter configuration class.
Answered by AI
Add your answer

HAckerrank based test

Medium leet code question

Round duration - 60 minutes
Round difficulty - Easy

This was a online coding interview where I was asked coding questions.

Q1. 
Preorder Traversal of a BST Problem Statement
Given an array PREORDER representing the preorder traversal of a Binary Search Tree (BST) with N nodes, construct the original BST.
Each element in the given...read more
Ans. 
Preorder traversal is: process the root, left subtree, and then right subtree. So, to emulate this behaviour in a non-recursive way, a stack can be used. 
1. Start with pushing the root node to the stack and continue the traversal till there is at least one node onto the stack. 2. Pop the root node from stack, process it and push it’s right and left child on to stack. We push the right child before the left child b...read more
Answered Anonymously
Add your answer
Q2. 
Convert Sorted Array to BST Problem Statement
Given a sorted array of length N, your task is to construct a balanced binary search tree (BST) from the array. If multiple balanced BSTs are possible, you ca...read more
Ans. 
The approach to this question is quite simple. We traverse the array and process each element one by one. We separately create an insert function which basically takes the root node and the array element as parameters and insert the element in the tree after evaluating the conditions: 
1.Start from the root. 
2. Compare the inserting element with root, if less than root, then recurse for left, else recurse for ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round. Programming based questions and oops/dbms based were asked. 
Some questions were :
1. How many types of trigger?
Ans. In SQL, there are 3 types of triggers :
DML (data manipulation language) triggers – Eg.– INSERT, UPDATE, and DELETE
DDL (data definition language) triggers Eg.– CREATE, ALTER, and DROP
Logon triggers –This type reacts to LOGON events
2. Can trigger be used with select statement?
Ans. No, triggers cannot be used with select statements. They can only be used with Insert, update or delete statements. 
3. Indexing in mysql? How many types of indexing in mysql?
Ans. Indexes are used to find rows with specific column values quickly. It helps to determine the position to seek to in the middle of the data file without having to look at all the data. It performs much faster than reading every row sequentially.
4. Engines in mysql?
Ans. So, in mysql, storage engine is a software module that a database management system uses to create, read, update data from a database. There are two types of storage engines: transactional and non-transactional.
5. Singleton pattern?
Ans. Singleton is a creational design pattern that ensured that a class has only one instance, while providing a global access point to this instance.

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
The problem can be solved in O(n) time using the concept of hashing. 
Use a hashset to check for the current array value. Check if targetsum – current value exists in the map or not. If it exists, that means a pair with sum equal to target sum exists in the array.
Answered Anonymously
Add your answer

Q1. Code postorder traversal without using recursion.
Ans. 
Iterative solution using a stack to perform postorder traversal.
• Use a stack to simulate the recursive call stack.

• Push nodes in the order of right, left, root.

• Pop nodes from stack and add to result array.

• Repeat until stack is empty.
Answered by AI
Add your answer
Q2. Leetcode Problem 1626 - Best team with no conflicts.
Add your answer

Q1. Design whatsapp with one to one, group messaging and read receipts functionalities. Design the database.
Ans. 
Design a messaging app like WhatsApp with one-to-one, group messaging, and read receipts functionalities.
• Use a relational database to store user information, messages, and group memberships.

• Create tables for users, messages, groups, and group memberships.

• Include columns for message content, sender, receiver, timestamp, and read status.

• Implement a feature to mark messages as read with read receipts.

• Use indexes for effic
Answered by AI
Add your answer
Q2. Questions on dbms, cn and os.
Add your answer