Smallcase Technologies Software Development Engineer II Interview Questions and Answers

There was basic GD topic

Q1. Google form was shared in which 15 questions were there and 3 were apti questions (work ,time ,speed) and others were from java programming and the time given was 2 hours.
Add your answer

Q1. In this only you will be asked theoretical questions like DBMS, JAVA, Programming, Your Project for programming he will ask only logic and will not ask you to code.
Add your answer

Q1. Count the number of words and their frequency
Ans. 
Count the number of words and their frequency
• Split the given text into words using whitespace as delimiter

• Create a dictionary to store the word frequency

• Iterate through each word and update the frequency in the dictionary

• Return the dictionary with word frequency
Answered by AI
Add your answer
Q2. Count frequency of characters.
Ans. 
Count the frequency of characters in a given string.
• Iterate through the string and use a hash map to store the count of each character.

• Initialize the count of each character to 0 and increment it as you encounter the character.

• Finally, iterate through the hash map to get the frequency of each character.
Answered by AI
Add your answer
Q3. Reversing the array
Ans. 
Reverses an array of strings
• Use a loop to iterate through half of the array

• Swap the elements at the current index with the corresponding element from the end of the array
Answered by AI
Add your answer
Q4. Implementing the comparator function for sorting
Ans. 
Implementing the comparator function for sorting an array of strings.
• Use the built-in sort() function in most programming languages.

• Define a custom comparator function that compares two strings.

• Return a negative value if the first string should come before the second, a positive value if it should come after, and 0 if they are equal.

• Example: ['apple', 'banana', 'cherry'] can be sorted in alphabetical order using the co
Answered by AI
Add your answer

Topic: Online vs Offline Education.

They gave us 8 coding problems and instructed us to solve 5 within a time limit of 1 hour and 30 minutes; all problems were from the easy and medium on LeetCode.

Q1. Data Structures and Algorithms (DSA), time complexity, and the explanation of code written during the coding round.
Add your answer
Q2. Question from the Core java.
Add your answer

Q1. In-depth question from DSA like implement linked-list and stack, questions from Tree and linear and binary search.
Add your answer
Q2. Explanation of college projects and questions from resume.
Add your answer

Q1. Simple HR questions.
Add your answer

2 coding questions based on DSA.

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

Q1. The interview emphasized team collaboration and work ethics, with a particular focus on my overall work experience at my previous company.
Add your answer
Q2. What were your preferences regarding work locations, specifically your views on working from the office (WFO) compared to working from home (WFH)?
Ans. 
I prefer a mix of both working from the office and working from home.
• I believe in the benefits of face-to-face collaboration and communication that come with working from the office.

• At the same time, I appreciate the flexibility and productivity that working from home offers.

• I think a hybrid approach, where employees have the option to choose between WFO and WFH based on their tasks and preferences, is ideal.

• I have exp...read more
Answered by AI
Add your answer

Q1. Focus was on DS algo and scenario based coding questions
Add your answer
Q2. Design skills and OS knowledge
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

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 - 60 minutes
Round difficulty - Easy

This was the qualification round which comprised of several MCQs and 3 coding questions.
It was held on Hackerearth from 3:00 PM to 4:00 PM.
Use of any other IDE was prohibited.

Q1. Given a problem statement and a piece of code, how would you find and correct the bug in the code?
Ans. 
To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.
• Understand the problem statement and expected output.

• Review the code for syntax errors, logical errors, and potential bugs.

• Use debugging tools like breakpoints, print statements, and IDE debuggers.

• Test the code with different inputs to identify the bug.

• Make necessary corrections based on the iden...read more
Answered by AI
Add your answer
Q2. 
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...read more
Ans. 
Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.
• Traverse the binary tree to find the target node.

• Use BFS to traverse the tree from the target node to nodes at distance K.

• Keep track of the distance while traversing the tree.

• Return the values of nodes at distance K in any order.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

Q1. 
Subarray Challenge: Largest Equal 0s and 1s
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input:
Input beg...read more
Ans. 
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
• Iterate through the array and maintain a count of 0s and 1s encountered so far.

• Store the count difference in a hashmap with the index as the key.

• If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.

• Return the length of the longest subarray found.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.