Indifi Technologies Intern Interview Questions and Answers

Q1. Tell me about yourself?
Add your answer
Q2. Based on resume and past experiences
Add your answer

2 hours HackerEarth coding round

Q1. Some medium level of question
Add your answer

HackerEarth test medium level question

Q1. Tell me about your self
Add your answer

Q1. Know about the process
Add your answer

Q1. Mental ability check like u r capable for this role or not
Add your answer

Q1. Very toughest round like overall in this round u need to tell and as well as they asked we should know properly what kind of process they r running
Add your answer

4 coding problems + 1 sql problem

Q1. Gas Station Problem On leetcode
Add your answer
Q2. Simple Tree Traversal Problem LC medium
Ans. 
Given a binary tree, return the inorder traversal of its nodes' values.
• Inorder traversal: left subtree, root, right subtree

• Use recursion to traverse the tree

• Implement a stack-based iterative solution for better space complexity
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timings: it was late night. I started the test at 10 pm

Q1. Partial BST
Given a binary tree with N number of nodes, check if that input tree is Partial BST (Binary Search Tree) or not. If yes, return true, return false otherwise.
A binary search tree (BST) is sai...read more
Ans. 
Method 2 above runs slowly since it traverses over some parts of the tree many times. A better solution looks at each node only once. The trick is to write a utility helper function isBSTUtil(struct node* node, int min, int max) that traverses down the tree keeping track of the narrowing min and max allowed values as it goes, looking at each node only once. The initial values for min and max should be INT_MIN and INT_M
Answered by CodingNinjas
View 2 more answers

Round duration - 45 minutes
Round difficulty - Medium

It was the interviw round.
the environment was good.
the interviewer was very nice to me.

Q1. Merge two sorted linked lists
You are given two sorted linked lists. You have to merge them to produce a combined sorted linked list. You need to return the head of the final linked list.
Note:
The give...read more
Ans. 
Merge is one of those nice recursive problems where the recursive solution code is much cleaner than the iterative code. You probably wouldn’t want to use the recursive version for production code, however, because it will use stack space which is proportional to the length of the lists.
Answered by CodingNinjas
View 2 more answers

45 min , 45 questions

Q1. Technical question( PowerBI, data science)
Add your answer
Q2. Behaviourial question
Add your answer

There were DSA questions and time limit was 1 hr

Q1. Calculate factorial using tabulation
Ans. 
Factorial calculation using tabulation in dynamic programming
• Create an array to store factorial values up to n

• Initialize the array with base cases (0! = 1, 1! = 1)

• Iterate from 2 to n and calculate factorial using previous values in the array

• Return the factorial value at index n
Answered by AI
Add your answer
Q2. Wildcard matching question
Add your answer