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 Geometric Progression
Find the N-th term of a Geometric Progression (GP) series given the first term A, the common ratio R, and the term position N.
Explanation:
The general form of a GP se...read more
Ans. 
Calculate the N-th term of a Geometric Progression series given the first term, common ratio, and term position.
• Use the formula A * R^(N-1) to find the N-th term of the GP series.

• Remember to return the result modulo 10^9 + 7 as the term can be very large.

• Handle multiple test cases efficiently by iterating through each case.
Answered by AI
Add your answer
Q2. 
Matrix Element Cube Sum Problem
For a given M x N sized 2D array 'MATRIX', find and return the value of (i * i + j * j) for elements where the sum of the cubes of its digits equals the element itself. Her...read more
Ans. 
Find and return the value of (i * i + j * j) for elements in a 2D array where the sum of the cubes of its digits equals the element itself.
• Iterate through the 2D array and check if the sum of the cubes of digits equals the element itself.

• Calculate (i * i + j * j) for elements that satisfy the condition.

• Return the calculated values as a new 2D array.

• If no element satisfies the condition, return -1.
Answered by AI
Add your 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 Problem Statement
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
Exampl...read more
Ans. 
Calculate the number of distinct subsequences in a string with possible duplicates.
• Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.

• Consider the cases where the current character is included or excluded in the subsequence.

• Handle duplicates by using a hashmap to store the last occurrence index of each character.

• Modulo the final count by 10^9 + 7 to avoid overfl
Answered by AI
Add your answer
Q2. 
Remove the Kth Node from the End of a Linked List
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...read more
Ans. 
Remove the Kth node from the end of a singly linked list given the position from the end to be removed.
• Traverse the list to find the length 'N' of the linked list.

• Calculate the position from the beginning to be removed as 'N - K + 1'.

• Delete the node at the calculated position from the beginning.
Answered by AI
Add your answer
Q3. 
Common Elements Problem Statement
Identify and output the common strings present in both given arrays of lowercase alphabets for each test case.
Input:
The first line contains an integer 'T' representin...read more
Ans. 
The task is to find common strings in two arrays of lowercase alphabets for each test case.
• Iterate through the elements of the second array and check if they are present in the first array.

• Use a hash set to store the strings of the first array for efficient lookup.

• Return the common strings in the order they appear in the second array.
Answered by AI
Add your answer