Sophtimize Consultancy Services Software Developer Intern Interview Questions and Answers

Good problems related to array or string

Round duration - 135 minutes
Round difficulty - Hard

The Technical Round was of 2 hours 15 minutes and was conducted on HackerRank. It comprised of 5 sections:
Programming – 30 minutes: 2 easy to medium level questions (1 of 20 marks other of 30).
Quantitative Aptitude – 25 minutes: 7 Math-related MCQs.
Computer Science – 20 minutes: 8 MCQs based on Computer Science subject topics like OOPs, OS, DBMS, DSA 
Advanced Programming – 45 minutes: 1 question on advanced Data Structures (100 marks)
Tell me about Yourself – 15 minutes: 2 essay type questions

Q1. 
Counting Pairs Problem Statement
Given a positive integer N, determine the count of all possible positive integral pairs (X, Y) that satisfy the equation 1/X + 1/Y = 1/N.
Example:
Input:
T = 1
N = 2
Ou...read more
Ans. Naive Solution (Time limit Exceed)
• Given equation can be simplified as follows:
  • 1/X + 1/Y = 1/N
  • 1/X = 1/N - 1/Y
  • 1/X = (Y - N)/(N*Y)
  • X = (N*Y)/(Y - N)
  • X = (N*Y - N*N + N*N)/(Y-N)
  • X = (N(Y-N) + N*N)/(Y-N)
  • X = N + (N*N)/(Y-N)
• To identify the total number of pairs satisfying the given equation, iterate over all the possible values of X and Y and increment a counter, where current X and Y values satisfy the above equation.
• This will ...read more
Answered Anonymously
Add your answer
Q2. 
Level Order Traversal Problem Statement
Given a binary tree of integers, return the level order traversal of the binary tree.
Input:
The first line contains an integer 'T', representing the number of te...read more
Ans. Breadth First Search
In the level order traversal, we will be using queue data structure which has the property FIRST IN FIRST OUT that’s why which nodes come first in current level the children of that node will also come first for the next level. So, we visit all the nodes one by one of the current level and push into the queue so that when we will be complete with the current level, then we can start exploring nodes ...read more
Answered Anonymously
Add your answer
Q3. 
Maximize Matrix Binary Score
You are provided with a 2-D matrix called MAT consisting solely of 0s and 1s. Each row of the matrix can be viewed as a binary number, and the aggregate sum of these binary nu...read more
Ans. Brute Force
The idea is to use the properties of binary numbers to implement the solution in a brute force manner.
We know that the maximum number of 1s in a binary number will help in increasing the overall sum if they are as left as possible. One important observation that arises from this fact is that the first bit(extreme left) should be made 1 to maximize the number as 4(100) > 3(011). So, if the first column in ...read more
Answered Anonymously
Add your answer

Round duration - 11 hours
Round difficulty - Easy

Finally, I was selected for the interview round which was conducted virtually over zoom.I had 4 rounds spanning over a period of almost 11 hours (10 AM- 9 PM) with breaks in between rounds, of course. As each of these rounds was an elimination round candidate had 1 to 4 rounds. In the end, we were 13 students left out of 65 students.

Q1. 
Regular Expression Match Problem Statement
Given a string str and a string pat, where str may contain wildcard characters '?' and '*'.
If a character is '?', it can be replaced with any single character....read more
Ans. Recursion Based Approach
The idea is pretty straightforward: scan ‘str’ and ‘pat’ while there is a match between the current character of ‘str’ and the current character of ‘pat’. If we reach the end of both strings while there is still a match, return True, otherwise, return False. The scan is done by having a pointer ‘i’ in ‘str’ and a pointer ‘j’ in ‘pat'
 
Example: = "code"
 
The character 'c' of 'str matches ...read more
Answered Anonymously
Add your answer
Q2. 
Fastest Horse Problem Statement
Given ‘N’ horses running in separate lanes, each horse's finish time is provided in an array. You are tasked to process 'Q' queries. For each query, determine the time take...read more
Ans. Brute Force
For each query, we can simply loop between ‘L’ and ‘R’ and store the minimum time taken by a horse to complete the race in a variable, and return the value stored in that variable.
 
Algorithm for Each Query:
 
• Store the minimum time to complete the race in a variable ‘MINIMUMTIME’ and initialize it with a large enough number, in this case, 10^ 9 is sufficient.
• Iterate from ‘L’ to ‘R’ and if the time ta...read more
Answered Anonymously
Add your answer
Q3. 
Group Anagrams Together
Given an array/list of strings STR_LIST, group the anagrams together and return each group as a list of strings. Each group must contain strings that are anagrams of each other.
E...read more
Ans. Sorting based Approach
The idea behind this approach is that two or more than two strings are anagrams if and only if their sorted strings are equal. So we will use a HashMap, let’s say “anagramGroup”, where each key is a sorted string, and the key will be mapping to the list of indices from the given list of strings that form a group of anagrams. This means that if we sort the strings at those indices, we will get the ...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This test was conducted on the Hackerrank platform, it was divided into 6 sections which contained a total of 66 questions with an overall time limit of 90 minutes, There was video proctoring, and changing sections were allowed.
The sections were-

Numerical Computations — 8 questions
Numerical Reasoning -12 questions
Comprehension — 10 questions
Abstract Reasoning — 12 questions
Diagrammatic Reasoning — 12 questions
Logical Reasoning — 12 questions

Q1. 
Convert a Number to Words
Given an integer number num, your task is to convert 'num' into its corresponding word representation.
Input:
The first line of input contains an integer ‘T’ denoting the number o...read more
Ans. Recursion
 
• The idea is that we convert only a single first digit and call the recursive function for other remaining digits.
  • Suppose given ‘num = 1234’ then we convert only “one thousand” in an English word and call then recursion function for ‘234’.
  • Also, assume that we get “two hundred thirty four” in return.
  • So we have to return both parts “one thousand” and “two hundred thirty four” as a single part and it will be...read more
Answered Anonymously
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

The interview started at 12 in the noon.
The interviewer seemed very cheerful. He began by greeting and asked me for a quick introduction.
Then he talked about the various projects I have mentioned in my resume and what further improvements I was going to make in my projects. Further he started asking questions on fundamentals of Data Structures and Algorithms, few questions on operating syatem and gave a problem statement on DSA.

Q1. 
Pair Sum Problem Statement
You are provided with an array ARR consisting of N distinct integers in ascending order and an integer TARGET. Your objective is to count all the distinct pairs in ARR whose sum...read more
Ans. Brute Force
First, we declare a variable 'COUNTPAIR’ in which we store all pairs whose sum is equal to 'TARGET’. Then, we traverse the array ‘ARR’ and assume every element as the first element of the pair. Then we again traverse the remaining array and consider every element as a second element of the pair, and check whether the sum of the two elements is equal to 'TARGET' or not. If it is equal to 'TARGET',’ then we in...read more
Answered Anonymously
Add your answer