Cuemath Software Developer Interview Questions, Process, and Tips

Round duration - 135 minutes
Round difficulty - Easy

There was no sectional time limit for the coding questions.The test was online with audio and video both on for continuous monitoring.

Q1. N-th Term Of GP
You are given the first term (A), the common ratio (R) and an integer N. Your task is to find the Nth term of the GP series.
The general form of a GP(Geometric Progression) series is A, A...read more
Ans. Brute force
1. The idea is to use the formulae, Nth term of GP = A*R^(N-1).
2. To calculate POW i.e R^(N-1) we will use a loop and the algorithm for the same will be as given below,
   • Initialise POW = 1
   • For N-1 number of times,
     • POW = POW * R
3. Return A * POW.
Space Complexity: O(1)Explanation:
O(1) per test case. 
 
In the worst case, only constant space is required.
Time Complexity: O(n)Explanation:
O(N) per test case where N i...read more
Answered by CodingNinjas
View 1 more answer
Q2. Cube of a matrix
Given an M x N sized 2D array 'MATRIX', return the (i * i + j * j) value for elements in which the sum of cube of digits of the element is equal to the element itself. Here, 'i...read more
Ans. Brute Force approach
The idea is to traverse the matrix of size M x N. For each element in the matrix, we find the sum of the cube of their digits recursively. If the sum of the cube of digits is equal to the element itself, calculate (i*i + j*j).
 
1. Traverse the given matrix.
2. For each element in the matrix, store the value of the element in variable ‘DUPLICATE’ and call a function that calculates the sum of the cubes ...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 40 minutes
Round difficulty - Easy

The interviewer was very calm and listened very carefully to the solutions. There was a lot of discussion on my projects and the interviewer seems to be very interested in knowing about the workflows of my projects.They also give me some coding questions which were related to problem solving also.

Q1. Distinct Subsequences
You have been given string 'S' of length 'N' that may contain duplicate alphabets. Your task is to return the count of distinct subsequences of it.
For example:
For...read more
Ans. Brute force
• The IDea is to call a helper function so as to create all possible subsequences of the string which will contain:
  • String CUR = the possible subsequence of the string.
  • Int ID = the index of character which will either be included or excluded.
• We maintain a set to count the distinct subsequences, each time a new subsequence is created, we add it into the set. Remember, the set does not contain duplicate elements.
• ...read more
Answered by CodingNinjas
View 2 more answers
Q2. Delete Kth node From End
You have been given a singly Linked List of 'N' nodes with integer data and an integer 'K'. Your task is to remove the Kth node from the end of the given Linked Lis...read more
Ans. Using Lists
The naive solution is to process all the nodes from the front side of the linked list and keep adding a node to the list. Now we can easily remove the Kth node from the end of the list by simply replacing the next pointer of the ('LENGTH' - 'K' - 1)th node (0-based indexing from start) of the list with the ('LENGTH' - 'K' + 1)th node. This way we can remove the Kth node from the end of the linked list.
Space ...read more
Answered by CodingNinjas
View 2 more answers
Q3. Common Elements
Given two 1-dimensional arrays containing strings of lowercase alphabets, print the elements that are common in both the arrays i.e. the strings that are present in both the arrays.
Note:
...read more
Ans. Bruteforce approach
The main idea behind this approach is to solve the problem intuitively, and for each string in the second array, check if it exists in the first array (we are checking for each string in the second array because we need the output in the order in which they appear in the second array).
 
Algorithm :
 
• Start traversing the second array and for each string in the second array, do the following :
  
  
  • L...read more
Answered by CodingNinjas
View 2 more answers
Q4. Technical Questions
He then proceeded to ask me in detail about each of the experiences and projects mentioned in my resume. He asked my why I chose to make that particular project, how I collaborated with ...read more
Add your answer