The FInance House Interview Questions and Answers

Mechanical Engineering offers a diverse range of opportunities to apply scientific principles to solve real-world problems.

• Mechanical Engineering provides a strong foundation in math, physics, and materials science.

• It offers a wide range of career opportunities in various industries such as automotive, aerospace, and manufacturing.

• Mechanical Engineers design and develop machines, tools, and systems that improve our dai...read more

Determining toll for Jamuna Expressway

• Consider the distance of the expressway

• Analyze the maintenance cost of the expressway

• Take into account the traffic volume and expected revenue

• Compare with toll rates of similar expressways

• Consider the economic status of the region

• Consult with experts and stakeholders

Yes, I know Java.

• I have experience in Java programming.

• I am familiar with Java syntax and concepts.

• I have worked on Java projects in the past.

To retrieve data from the back end, you can use APIs or database queries.

• Use API calls to fetch data from the back end server.

• Execute database queries to retrieve data from the database.

• Parse the response or query result to extract the required data.

• Handle any necessary authentication or authorization for accessing the back end.

• Examples: GET request to an API endpoint, SELECT query in SQL.

OOP is a programming paradigm based on the concept of objects, which can contain data and code.

• OOP stands for Object-Oriented Programming

• It focuses on creating objects that interact with each other to solve a problem

• Encapsulation, inheritance, and polymorphism are key concepts in OOP

• Example: A car object can have properties like color, make, and model, and methods like start and stop

• OOP promotes code reusability and ma

Print the level order traversal of binary tree in spiral form

• Perform level order traversal of the binary tree

• Alternate the direction of traversal for each level

• Use a stack to reverse the order of nodes in each level

• Print the nodes in the order of traversal

Find the maximum element in each subarray of size k in a given array.

• Iterate through the array from index 0 to n-k.

• For each subarray of size k, find the maximum element.

• Store the maximum elements in a separate array.

• Return the array of maximum elements.

To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.

• Merge the two arrays into a single sorted array using a modified merge sort algorithm.

• Return the Kth element from the merged array.

Merge two sorted arrays into one sorted array with expected time complexity of (m+n).

• Use a two-pointer approach to compare elements from both arrays and merge them into the first array.

• Start comparing elements from the end of both arrays and place the larger element at the end of the first array.

• Continue this process until all elements from the second array are merged into the first array.