Smallcase Technologies Software Engineer2 Interview Questions and Answers

2 coding questions based on DSA.

Q1. Easy coding problem.
Add your answer
Q2. Medium coding problem.
Add your answer

DSA medium level questions were asked.

Q1. Design MakeMyTrip kind of application.
Ans. 
MakeMyTrip is a travel booking application that allows users to book flights, hotels, and holiday packages.
• Include features like flight/hotel search, booking, payment gateway integration, and user profiles.

• Implement filters for search results, reviews/ratings for hotels, and notifications for booking updates.

• Integrate maps for location tracking, weather forecasts, and customer support chatbot.

• Offer discounts, loyalty p...read more
Answered by AI
Add your answer
Q2. Oops based questions.
Add your answer

Hackerrank questions which are not hard to complete, both are to implement functions of a class. LC medium level. After completing both questions still reject

Q1. Not applicable at this point
Add your answer

Must contain some questions which will be considered as a qualifier test for next round .it will have some passout marks to get into a next round .

Q1. About skills and communication skills
Add your answer

Q1. About introduction and some questions related to job
Add your answer

70 minutes test, and 4 questions

Q1. Behavioural Queston
Add your answer

Q1. MVC , C#, ASP.net
Add your answer

Q1. Managerial question
Add your answer

3 coding questions

Q1. Design a Time Series Database
Ans. 
A time series database stores data points with timestamps for efficient retrieval and analysis.
• Choose a suitable data model for the database

• Use a time-based partitioning scheme for efficient data retrieval

• Implement compression techniques to reduce storage requirements

• Support for querying and analyzing time-based data

• Ensure data consistency and durability

• Consider scalability and high availability

• Examples: InfluxDB, Time
Answered by AI
Add your answer

Round duration - 70 Minutes
Round difficulty - Hard

The test link was active for a week, and you can give anytime you like. The IDE was very good and self explanatory. There were 2 coding questions and 15 aptitude questions.

Q1. Shortest path in an unweighted graph
The city of Ninjaland is analogous to the unweighted graph. The city has ‘N’ houses numbered from 1 to ‘N’ respectively and are connected by M bidirectional roads. If a...read more
Ans. 
This is a straight forward application of Floyd Warshal algorithm
Answered Anonymously
Add your answer
Q2.  Check If Two Nodes Are Cousins
You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values, a and b, you need to check if these n...read more
Ans. 
This was a modified version of DFS on tree and storing the results in a dp to avoid recalculation.
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It contained two programming questions.

Q1. Nodes In Complete Binary Tree
You are given the root of a complete binary tree, you need to calculate the number of nodes in the given complete binary tree.
A complete binary tree is a tree in which all...read more
Ans. 
The basic solution of this problem is easy. You just need to do a level order traversal of the tree and wherever you find the first vacant spot, you can enter the node there.
The trick was to find the optimal solution. You need to use the property of almost full binary tree. Knowing the value of the node to enter, you can directly eliminate one side of the tree and just traverse the other side of the tree.
Answered Anonymously
Add your answer
Q2. Rearrange Array Numbers to form Largest Possible Number
You are given an array(ARR) of length 'N', consisting of non-negative integers. Using only these given numbers, rearrange the numbers in such...read more
Ans. 
This was a standard array manipulation problem. You just need to find the cases that should be satisfied by the second largest number.
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was more of a interaction round with some technical skills.

Q1. DBMS Question
Interviewer asked me to explain the ACID properties and explain the rollback mechanism in DBMS.
Ans. 
Tip 1 : Focus on the basics of DBMS 
Tip 2 : Try applying the DBMS concepts on the problems at hand.
Answered Anonymously
Add your answer