Cuemath Software Engineer Interview Questions and Answers for Freshers

Coding test around front end using react

Q1. Explain request lifecycle in rails?
Ans. 
Request lifecycle in Rails involves routing, controller actions, rendering views, and responding to the client.
• 1. Request comes in through the browser or API endpoint.

• 2. Rails router determines which controller and action to route the request to.

• 3. Controller action processes the request, interacts with the model, and prepares data for the view.

• 4. View template is rendered with the data from the controller.

• 5. Response ...read more
Answered by AI
Add your answer
Q2. Code Merge Sort using Ruby
Ans. 
Implement Merge Sort algorithm in Ruby
• Divide the array into two halves recursively

• Merge the sorted halves back together

• Use a helper method to merge the two halves
Answered by AI
Add your answer

Q1. Check if string is palindrome
Ans. 
Check if a string is the same forwards and backwards
• Iterate through the string from both ends and compare characters

• Use built-in functions like reverse() to check for palindrome

• Ignore spaces and punctuation when checking for palindrome
Answered by AI
Add your answer

Python technical SQL basic

Two dynamic programming challenges at the hard level on LeetCode and 10 medium-level SQL challenge.

Q1. Machine coding round design drivezy app. It should be demoable.
Add your answer

Q1. Add 2 linked list and return final linked list
Ans. 
Add 2 linked lists and return final linked list
• Create a new linked list to store the sum

• Traverse both linked lists simultaneously and add the corresponding nodes

• Handle carry over while adding nodes

• If one linked list is longer than the other, add the remaining nodes to the sum list
Answered by AI
Add your answer
Q2. Find a Element in rotated sorted array
Ans. 
Finding an element in a rotated sorted array.
• Use binary search to find the pivot point where the array is rotated.

• Determine which half of the array the target element is in.

• Perform binary search on that half of the array to find the target element.

• Handle edge cases such as when the target element is at the pivot point.
Answered by AI
Add your answer

Q1. Matrix chain multiplication
Add your answer
Q2. Find word in matrix.
Ans. 
Given a matrix of characters and a word, find if the word exists in the matrix.
• Traverse the matrix and check if the first letter of the word matches any cell.

• If it does, check if the adjacent cells match the next letter of the word.

• Repeat until the entire word is found or no match is found.
Answered by AI
Add your answer

Q1. Stock buy sell problem to maximize profit.
Ans. 
Algorithm to maximize profit by buying and selling stocks.
• Iterate through the array of stock prices

• Keep track of the minimum price seen so far

• Calculate the profit if sold at current price

• Update maximum profit seen so far

• Return maximum profit
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was an coding round

Q1. 
The Skyline Problem
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...read more
Ans. 
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
• Iterate through the buildings and create a list of critical points (x, y) where the height changes.

• Sort the critical points based on x-coordinate and process them to form the skyline.

• Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

• Return the fin...read more
Answered by AI
Add your answer
Q2. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from source to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Recursively try moving in all directions (up, down, left, right) until reaching the destination.

• Return a list of strings representing valid paths sorted in alphabetical order.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It was an HR round with some general questions. it was just for formality.

Q1. Concepts of node and Js
Add your answer