Smallcase Technologies Software Developer Intern 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

First round was a coding test which has 2 problem solving questions and 3 subjective questions based on C++

Q1. This is also based on problem solving and DSA. A small part will be OS and network.
Add your answer

More of a subjective round, highly focused on OS, networking and computer architecture.

Q1. This round is with the HM, totally subjective. Highly focused on past experience, current projects etc.
Add your answer

Q1. HR discussion mostly questions are related to past and current experience.
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. 
Unweighted Graph Shortest Path Problem
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N houses numbered from 1 ...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. Your task is to determine if ...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. 
Counting Nodes in a Complete Binary Tree - Problem Statement
Given the root of a complete binary tree, calculate the total number of nodes in this tree.
A complete binary tree is defined as a binary tree...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 for Largest Possible Number
Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible numerical value. You are not permitted to alt...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. Can you explain the ACID properties and 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