ART Housing Finance (India) Intern Interview Questions and Answers

Q1. What skills do you have
Add your answer
Q2. People management
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Tell about your Past experience
Add your answer

Good coding ques. Linked list and some mcqs

Q1. 1. Dp on grids 2. Prefix array 3. Oops 4. Probability puzzles
Add your answer

Round duration - 100 minutes
Round difficulty - Medium

The test was conducted on the AMCAT platform, with webcam and tab-switch monitoring. All questions were mandatory to answer. Coding questions were 2, one being difficult and another's the one given below.

Q1. 
Number of Mismatching Bits
Determine the number of bits that differ between the binary representations of two given integers "first" and "second".
Input:
The input starts with an integer ‘T’ representin...read more
Ans. 
Step 1 : I used bitwise shift operators here. I first ran a loop for 'i' from 0 to 32 (as 32 bits is maximum)
Step 2 : Then right shifted the bits of both numbers by 'i' places.
Step 3 : Checked whether the bit at 0th position is different, if yes then increase the counter variable.
Step 4 : Using bitwise AND by 1 for both numbers to get the 1st bit.
Step 5 : Displayed the count.
Answered Anonymously
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

This technical interview was scheduled at 9 AM for me.

Q1. 
BST Node Deletion Problem
Given a binary search tree (BST) and a key value K, your task is to delete the node with value K. It is guaranteed that a node with value K exists in the BST.
Explanation:
A bi...read more
Ans. 
Step 1 : I used Java to code the given problem for all three cases of node deletions.
Step 2 : For the time complexity, the worst case time complexity of delete operation is O(h) where h is height of Binary Search Tree. In worst case, we may have to travel from root to the deepest leaf node. The height of a skewed tree may become n and the time complexity of delete operation may become O(n).
Step 3 : In case of code opti...read more
Answered Anonymously
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

Took place in the evening, this round assessed the overall personality. Followed by a discussion on the resume; the international accolades I had received in Computer Science and in extracurriculars, my experiences, future goals and so on.
Lastly, I was asked if I had any questions and about the preferred locations.