Protium Finance Software Developer Interview Questions, Process, and Tips

Round duration - 75 minutes
Round difficulty - Easy

Easy to Medium questions based on Arrays and Hashmap.

Q1. 
Count Sub-arrays with Sum Divisible by K
Given an array ARR and an integer K, determine the number of sub-arrays in which the sum is divisible by K.
Example:
Input:
ARR = {5, 0, 2, 3, 1}, K = 5
Output...read more
Ans. 
The task is to count the number of subarrays in an array whose sum is divisible by a given integer.
• Iterate through the array and calculate the cumulative sum at each index.

• Store the remainder of each cumulative sum divided by K in a hashmap.

• If the remainder is already present in the hashmap, increment the count by the value in the hashmap.

• If the remainder is 0, increment the count by 1.

• Update the hashmap with the remai
Answered by AI
Add your answer
Q2. 
XOR Query on Tree Problem
Given a tree with a root at node 0 and N vertices connected with N-1 edges, and an array QUERY of size Q, where each element in the array represents a node in the tree. For each ...read more
Ans. 
This question is about finding the XOR of all values of nodes in the sub-tree of a given node in a tree.
• Read the input values for the number of test cases, number of nodes, and number of queries.

• Construct the tree using the given edges.

• For each query, traverse the sub-tree of the given node and calculate the XOR of all node values.

• Print the XOR values for each query.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Standard DS/Algo round with 2 questions of Easy-Medium level of question

Q1. 
Quick Sort Implementation
Sort a given array of integers in ascending order using the Quick Sort algorithm.
Quick Sort is a divide and conquer algorithm that involves selecting a pivot element and partit...read more
Ans. 
Implement Quick Sort to sort an array of integers in ascending order.
• Choose a pivot element from the array

• Partition the array into two parts: elements smaller than the pivot and elements larger than the pivot

• Recursively apply quick sort on the left and right parts

• Combine the sorted left and right parts with the pivot element
Answered by AI
Add your answer
Q2. 
Search In Rotated Sorted Array Problem Statement
Given a sorted array of distinct integers that has been rotated clockwise by an unknown amount, you need to search for a specified integer in the array. Fo...read more
Ans. 
This is a problem where a sorted array is rotated and we need to search for given numbers in the array.
• The array is rotated clockwise by an unknown amount.

• We need to search for Q numbers in the array.

• If a number is found, return its index, otherwise return -1.

• The search needs to be done in O(logN) time complexity.

• The input consists of the size of the array, the array itself, the number of queries, and the queries.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Questions related to DSA - Prime Factorisation of a number
Questions related to OS - Difference between orphan and zombie process and few more questions from OS
Questions related to Java- Internal working , Threading, Debugging, OOPs

Q1. What is the garbage collector in Java?
Ans. 
Garbage collector in JAVA is an automatic memory management system that frees up memory by identifying and removing unused objects.
• Garbage collector is responsible for reclaiming memory occupied by objects that are no longer in use.

• It automatically identifies and removes objects that are no longer reachable by the program.

• Garbage collector helps prevent memory leaks and improves performance by freeing up memory.

• It uses...read more
Answered by AI
Add your answer
Q2. What is the difference between an abstract class and an interface in Object-Oriented Programming?
Ans. 
Abstract class is a class that cannot be instantiated and can have both abstract and non-abstract methods. Interface is a blueprint for classes to implement and can only have abstract methods.
• Abstract class can have constructors, while interface cannot.

• A class can only extend one abstract class, but can implement multiple interfaces.

• Abstract class can have instance variables, while interface cannot.

• Abstract class can p...read more
Answered by AI
Add your answer
Q3. What is meant by exception handling?
Ans. 
Exception handling is a mechanism in programming to handle and manage errors or exceptional situations that may occur during program execution.
• Exception handling is a way to gracefully handle errors or exceptional situations in a program.

• It involves catching and handling exceptions, which are unexpected events that disrupt the normal flow of program execution.

• Exception handling allows the program to recover from errors...read more
Answered by AI
Add your answer
Q4. What is the difference between a User thread and a Daemon thread in Java?
Ans. 
User threads are non-daemon threads that keep the application alive until they complete, while daemon threads are background threads that do not prevent the application from terminating.
• User threads are created by the application and are responsible for executing the main logic.

• Daemon threads are created by the JVM and are used for background tasks.

• User threads prevent the application from terminating until they comple...read more
Answered by AI
Add your answer
Q5. What is the difference between an orphan process and a zombie process in operating systems?
Ans. 
Orphan process is a process whose parent process has terminated, while a zombie process is a process that has completed execution but still has an entry in the process table.
• Orphan process: Parent process has terminated, but the child process is still running.

• Zombie process: Child process has completed execution, but the parent process has not yet collected its exit status.

• Orphan processes are adopted by the init proce...read more
Answered by AI
Add your answer
Q6. 
Prime Factorization Problem Statement
Given several queries each containing a single integer 'N', the task is to find the prime factorization of each integer using a sieve method.
Example:
Input:
N = 1...read more
Ans. 
The task is to find the prime factorization of given integers using a sieve.
• Implement a function to find the prime factors of each integer using a sieve algorithm.

• Use the given input format to read the number of test cases and queries.

• For each query, iterate through numbers from 2 to sqrt(N) and check if they are prime factors of N.

• If a number is a prime factor, divide N by that number and continue the process until N ...read more
Answered by AI
Add your answer