Houghton Mifflin Harcourt Software Engineer Interview Questions and Answers

Q1. Concepts of node and Js
Add your answer

Q1. Basic Questions based on pervious project
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

Q1. Java, java script,html,css
Add your answer

Q1. JbeiuJNEKA DIOAJSD
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

There was 2 coding question
One was easy One was very Difficult
20 MCQ question from Operating system and DBMS

Q1. First question was binary search in unsorted arrays So here i have asked about sorting algorithms all sorting algorithms must be clear
Add your answer
Q2. Second question was to find longest consecutive subarray.
Ans. 
Find the longest consecutive subarray.
• Iterate through the array and keep track of the current subarray length.

• Update the maximum length as you iterate.

• Reset the current subarray length when a non-consecutive element is encountered.
Answered by AI
Add your answer

Q1. OOPS related question Heap insertion deletion question Hashing Spanning tree
Add your answer
Q2. Minimum Spanning tree Implementation of MST
Ans. 
Minimum Spanning Tree (MST) is a tree that connects all vertices in a graph with minimum total edge weight.
• MST can be found using Prim's algorithm or Kruskal's algorithm.

• Prim's algorithm starts with a single vertex and adds the closest vertex to the tree until all vertices are included.

• Kruskal's algorithm starts with the edges with the lowest weight and adds them to the tree as long as they don't create a cycle.

• MST has...read more
Answered by AI
Add your answer

Q1. What is react, diff between react and angular, deep copy shallow copy, hoisting, diff between props and state
Ans. 
React is a JavaScript library for building user interfaces. It is different from Angular in various ways.
• React is a library while Angular is a framework

• React uses virtual DOM while Angular uses real DOM

• React is more flexible and easier to learn than Angular

• Deep copy creates a new object with the same values while shallow copy creates a new reference to the same object

• Hoisting is a JavaScript mechanism where variables a...read more
Answered by AI
Add your answer
Q2. Implement custom hooks and array flat method
Ans. 
Implement custom hooks and array flat method
• Custom hooks are reusable functions that allow you to extract component logic into reusable functions

• Array flat method is used to flatten an array of nested arrays into a single array

• To implement custom hooks, create a function that uses the useState and useEffect hooks

• To implement array flat method, use the reduce method to flatten the array
Answered by AI
Add your answer