Finoability Intern Interview Questions and Answers

2 Ds questions. About Linked list ans arrays and some aptitude questions.

Q1. Implement Merge Sort algo
Ans. 
Merge Sort is a divide and conquer algorithm that divides the input array into two halves, sorts them recursively, and then merges the sorted halves.
• Divide the array into two halves

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer
Q2. Two sum problem in optimised form
Ans. 
The Two Sum problem involves finding two numbers in an array that add up to a specific target.
• Use a hashmap to store the difference between the target and each element in the array.

• Iterate through the array and check if the current element's complement exists in the hashmap.

• Return the indices of the two numbers that add up to the target.
Answered by AI
Add your answer

Q1. Discussion about the projects in resume
Add your answer
Q2. NoSql Vs Sql , advantages and disadvantages
Ans. 
NoSQL databases are non-relational, flexible, and scalable, while SQL databases are relational, structured, and consistent.
• NoSQL databases are schema-less, allowing for flexibility in data models.

• SQL databases use structured query language for data manipulation and retrieval.

• NoSQL databases are horizontally scalable, making them suitable for big data applications.

• SQL databases are vertically scalable, which can be more...read more
Answered by AI
Add your answer