Edureka Software Engineer Interview Questions and Answers

Q1. Tell me something about your family members?
Add your answer

Q1. What was your salary expectation?
Add your answer

Coding round with 3 problem statements

Q1. Questions related to project you have mentioned on resume
Add your answer
Q2. Questions related to technologies you have mentioned
Add your answer
Q3. Questions related to the coding test
Add your answer
Q4. Nothing discussed everything as I know
Add your answer
Q5. All the best those who are trying their best
Add your answer

Common Aptitude along with HTML5, CSS

Q1. Mostly questions were on HTML5,CSS and web development related questions.
Add your answer

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 - 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

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