Arthmate Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Medium

This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.

Q1. 
K-th Largest Number in a BST
Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.
If there is no K-th la...read more
Ans. 
Find the K-th largest element in a BST.
• Perform reverse in-order traversal of the BST to find the K-th largest element.

• Keep track of the count of visited nodes to determine the K-th largest element.

• Return -1 if there is no K-th largest element in the BST.
Answered by AI
Add your answer
Q2. 
Is Height Balanced Binary Tree Problem Statement
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
1. The left subtree is balanced.
2. The right subtree is bala...read more
Ans. 
Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.
• Check if the left subtree is balanced

• Check if the right subtree is balanced

• Calculate the height difference between the left and right subtrees

• Return 'True' if all conditions are met, otherwise return 'False'
Answered by AI
Add your answer
Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
Ans. 
Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.
• Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.

• Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.

• Orphan p...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .

Q1. 
Longest Substring Without Repeating Characters Problem Statement
Given a string S of length L, determine the length of the longest substring that contains no repeating characters.
Example:
Input:
"abac...read more
Ans. 
Find the length of the longest substring without repeating characters in a given string.
• Use a sliding window approach to keep track of the longest substring without repeating characters.

• Use a hashmap to store the index of each character in the string.

• Update the start index of the window when a repeating character is found.

• Calculate the maximum length of the window as you iterate through the string.

• Return the maximum le
Answered by AI
Add your answer
Q2. 
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...read more
Ans. 
Search for integers in a rotated sorted array efficiently.
• Use binary search to efficiently search for integers in the rotated sorted array.

• Handle the rotation of the array while performing binary search.

• Return the index of the integer if found, else return -1.
Answered by AI
Add your answer
Q3. 
Count Subarrays with Sum Divisible by K
Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.
Input:
The first line of input contains an...read more
Ans. 
Count subarrays with sum divisible by K in an array.
• Iterate through the array and keep track of the prefix sum modulo K.

• Use a hashmap to store the frequency of each prefix sum modulo K.

• For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.

• Handle the case when prefix sum itself is divisible by K.

• Return the total count of subarrays with sum divisible by K.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.

Q1. 
Ceil Value from BST Problem Statement
Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.
The ceil of an integer is defined as the s...read more
Ans. 
Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.
• Traverse the BST to find the closest value greater than or equal to the key.

• Compare the key with the current node value and update the ceil value accordingly.

• Recursively move to the left or right subtree based on the comparison.

• Return the ceil value once the traversal is complete.
Answered by AI
Add your answer
Q2. 
Design a Constant Time Data Structure
Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:
1. INSERT(key, value): Add or update t...read more
Ans. 
Design a constant time data structure to maintain mappings between keys and values with various operations.
• Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.

• Keep track of the number of key-value pairs for GET_SIZE operation.

• Check if the hash table is empty for IS_EMPTY operation.

• Return true or false for SEARCH operation based on key existence.

• Return the value associated...read more
Answered by AI
Add your answer