Cuemath Software Engineer Interview Questions and Answers

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. Concepts of node and Js
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Coding Question
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Salary discussion
Add your answer

Coding test around front end using react

Q1. Question on Binary trees: if symmetric, easy string question using hashmap
Add your answer
Q2. If we are hosting a live test how to show real time ranking, HLD for this and what algorithms can we use
Add your answer

Q1. Database schema design for a feature where user can be free, gold, platinum.
Ans. 
Use a user table with a column for user type (free, gold, platinum)
• Create a user table with columns for user ID, name, email, user type

• Use a separate table for user types with columns for type ID and type name

• Establish a one-to-many relationship between user and user type tables

• Example: user table - user_id, name, email, type_id; user_type table - type_id, type_name
Answered by AI
Add your answer

Q1. HLD for live rank dashboard for a live test where millions of users are doing test
Ans. 
High-level design for a live rank dashboard for a live test with millions of users.
• Use a scalable architecture to handle millions of users concurrently.

• Implement real-time data processing to update ranks dynamically.

• Utilize caching mechanisms to improve performance and reduce load on the database.

• Design a user-friendly interface with intuitive data visualization.

• Include features for filtering, sorting, and searching to
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium level. Time was enough and no sectional time was present. 1-2 MCQs on SQL were also present.

This round was immediately followed by an SHL aptitude test which was basically a quick limited time check of your verbal ability and math because many questions were to be done in 1 hour.

Q1. 
Boolean Matrix Transformation Challenge
Given a 2-dimensional boolean matrix mat of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...read more
Ans. 
You need to make the modifications in the input matrix.
You do not need to print anything, it has already been taken care of.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was an online video interview round on HackerEarth with simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class which required inheritance was asked by the interviewer to write. I was helped by the interviewer if i got stuck somewhere, Some questions on implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.

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
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
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

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