Money View Software Engineer Interview Questions and Answers

Q1. Internal Implementation of HashMap
Ans. 
HashMap is implemented using an array of linked lists to handle collisions.
• HashMap stores key-value pairs in an array of linked lists

• Hash function is used to determine the index of the array where the key-value pair will be stored

• Collision handling is done by chaining, where multiple key-value pairs with the same hash value are stored in the same linked list

• HashMap allows null keys and values

• HashMap is not synchronized...read more
Answered by AI
Add your answer

Q1. Insights about company and candidate
Add your answer
Q2. If I know Data structures or not?
Ans. 
Yes, I have knowledge of data structures.
• I have experience with common data structures like arrays, linked lists, stacks, queues, trees, and graphs.

• I understand the time and space complexity of different data structures and their operations.

• I have implemented data structures in various programming languages like C++, Java, and Python.

• For example, I have used a hash table to efficiently store and retrieve data in consta
Answered by AI
Add your answer

There were 2 easy question 1 medium
Question were good but have weak test case.

This was project or lld round.
You just be aware of class and other stuff.

Q1. Discussion on project Asked graph coding question in real scenerio. Like asked what algorithm you will use for different real life problems
Add your answer

Q1. Why engineering and what u know about cred
Add your answer

Q1. Basic questions on data structures
Add your answer

Q1. Second round was Managerial Round. The interviewer basically had a conversation with me and asked some hr questions also.
Add your answer

Q1. Basic HR questions
Add your answer

It was simple program of url shorting for registered and non registered users each request must have unique shortened url.

Q1. Palindrome implementation and run time
Ans. 
A palindrome is a word or phrase that reads the same backward as forward. Implementing it involves comparing the first and last characters and iterating towards the middle.
• Implement a function that takes a string as input and returns true if it is a palindrome, false otherwise.

• Use two pointers, one starting from the beginning and the other from the end, and compare the characters at each position.

• If the characters matc...read more
Answered by AI
Add your answer
Q2. DSA and various algorithms and run time
Add your answer

Q1. This round was one on one with VP of engineering. Basic q and a regarding role and responsibilities
Add your answer

Q1. Relocation, Reason For job change, future plan, careers objective
Add your answer

Scenarios base conding round

Questions on strings in javascript.
Basic javascript and typescript.

Q1. Questions on cloud technologies
Add your answer

Q1. Cultural fit and salary related discussion
Add your answer

Test was based on arrays and some dsa concepts.

Easy coding questions DSA

Q1. Reverse a linked list
Ans. 
Reverse a linked list by changing the pointers direction
• Start with three pointers: current, previous, and next

• Iterate through the linked list, updating the pointers to reverse the direction

• Update the head pointer to point to the new first node
Answered by AI
Add your answer
Q2. Find middle of linked list
Ans. 
To find the middle of a linked list, use the slow and fast pointer technique.
• Initialize two pointers, slow and fast, both pointing to the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps until fast reaches the end of the list.

• The position of the slow pointer will be the middle of the linked list.
Answered by AI
Add your answer

Q1. Pick from a basket of oranges
Ans. 
The question is asking to pick an orange from a basket.
• Carefully select a ripe orange without any bruises or blemishes

• Gently twist the orange off the stem to avoid damaging the fruit

• Check for firmness and weight to determine ripeness
Answered by AI
Add your answer