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 all sub-arrays having sum divisible by k
Given an array ‘ARR’ and an integer ‘K’, your task is to find all the count of all sub-arrays whose sum is divisible by the given integer ‘K’.
Note:
If ther...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
View 3 more answers
Q2. XOR Query
You are given a tree(root 0) with N vertex having N - 1 edges. You are also given an array ‘QUERY’ of size ‘Q’, where each query consists of an integer that denotes a node. You have to print the ...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
View 2 more answers

Round duration - 40 minutes
Round difficulty - Easy

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

Q1. Implement Quick Sort
You are given an array of integers. You need to sort the array in ascending order using quick sort.
Quick sort is a divide and conquer algorithm in which we choose a pivot point and ...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
View 3 more answers
Q2. Search In Rotated Sorted Array
Aahad and Harshit always have fun by solving problems. Harshit took a sorted array consisting of distinct integers and rotated it clockwise by an unknown amount. For example,...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
View 2 more answers

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. OOPS Question
What is 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. OOPS Question
Difference between Abstract class and Interface
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. OOPS Question
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. Java Question
What is the synchronization process? Why use it?
Ans. 
Synchronization is the process of controlling the access to shared resources in a multi-threaded environment.
• Synchronization ensures that only one thread can access a shared resource at a time.

• It prevents race conditions and data inconsistencies.

• Java provides synchronized keyword and locks to achieve synchronization.

• Synchronization can be applied to methods or blocks of code.

• Example: Synchronizing a method to ensure th
Answered by AI
Add your answer
Q5. Java Question
What is Runnable and Callable Interface? Write the difference between them.
Ans. 
Runnable and Callable are interfaces in Java used for creating threads. Runnable is a functional interface with a single run() method, while Callable is a generic interface with a call() method that returns a result.
• Runnable is used for creating simple threads that do not return a result, while Callable is used for creating threads that return a result.

• Runnable is simpler and easier to use, while Callable provides more...read more
Answered by AI
Add your answer
Q6. Java Question
What's the difference between User thread and Daemon thread?
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
Q7. Operating System Question
What is IPC? What are the different IPC mechanisms?
Ans. 
IPC stands for Inter-Process Communication. It refers to the mechanisms used by processes to communicate with each other.
• IPC allows processes to share data and synchronize their actions.

• Different IPC mechanisms include pipes, message queues, shared memory, and sockets.

• Pipes are a unidirectional communication channel between two related processes.

• Message queues allow processes to exchange messages through a common queue...read more
Answered by AI
Add your answer
Q8. Operating System Question
What is RAID structure in OS? What are the different levels of RAID configuration?
Ans. 
RAID (Redundant Array of Independent Disks) is a data storage technology that combines multiple physical drives into a single logical unit.
• RAID provides improved performance, fault tolerance, and increased storage capacity.

• There are different levels of RAID configuration, including RAID 0, RAID 1, RAID 5, RAID 10, etc.

• RAID 0 offers striping without redundancy, providing increased performance but no fault tolerance.

• RAID...read more
Answered by AI
Add your answer
Q9. Operating System Question
Difference between Orphan and Zombie process
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
Q10. Prime Factorisation
You are given a number of queries where each query contains a single integer ‘N’, your task is to find the prime factorization of each integer using a sieve.
For Example:
For ‘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
View 1 more answer