Paxcom India Software Developer Intern Interview Questions and Answers

Round duration - 40 minutes
Round difficulty - Medium

It was early in the morning around 8:00AM-8:40AM. Platform used was hackerrank and the questions asked were of moderate level.

Q1. 
Split Array with Equal Sums Problem Statement
Given an array 'ARR' of size 'N', determine if there exists a triplet (i, j, k) satisfying the conditions: 0 < i , i + 1 < j , j + 1 < k and k < N...read more
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was in the evening around 4;00PM-4:20PM. This round was very interesting as it focuses more about your personality rather than your knowledge which has been already checked in previous rounds.

Round duration - 90 minutes
Round difficulty - Medium

They share doc file link which consist of 5 programming questions

Q1. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Ans. Brute force
• Create a String ans to store the reversed string.
• Initialize a variable i to 0 and iterate the whole string through a while loop.
• Skip initial spaces by just incrementing i.
• Create a String that will store the current word.
• Add the currentword and space at the beginning of ans.
• After traversing the whole string, check if the length of ans is greater than 0 then return ans after removing the last space otherwise r...read more
Answered Anonymously
Add your answer
Q2. 
Fibonacci Membership Check
Given an integer N, determine if it is a member of the Fibonacci series. Return true if the number is a member of the Fibonacci series, otherwise return false.
Fibonacci Series...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer
Q3. 
Maximum Difference Problem Statement
Given an array ARR of N elements, your task is to find the maximum difference between any two elements in ARR.
If the maximum difference is even, print EVEN; if it is...read more
Ans. Find Max And Min
We will iterate over ARR and find the MAX and MIN of the ARR. And if the MAX - MIN is odd the return “ODD” else return "EVEN". 
The algorithm will be-
1. MAX = -1, MIN= 10 ^ 9 + 1
2. For VAL in ARR.
   1. If MAX < VAL
      1. MAX = VAL
   2. If MIN > VAL
      1. MIN = VAL
3. IF (MAX-MIN) % 2
   1. Return ODD
4. ELSE
   1. Return EVEN
Space Complexity: O(1)Explanation:
O(1).
 
Since constant space is used.
Time Complexity: O(n)Explanation:
O(N), where N ...read more
Answered Anonymously
Add your answer
Q4. 
Remainder When Divided By 11 Problem Statement
Determine the remainder when a given number, 'N' in the form of a string, is divided by 11.
Input:
The first line contains an integer 'T' denoting the numb...read more
Ans. Using Modulo Property
1. Since the number is very large we can not simply calculate N % 11.
2. Now, any number say 256 % 11 can be calculated as (25*10 + 6)%11. Which in turn can be calculated as (( 25*10)%11+ 6)%11 or ( (25%11)*10 + 6)%11. Similarly 25%11 can be calculated as (2*10+5)%11. Therefore , 256 %11 can be finally calculated as ( ( (2*10 + 5)%11 )*10 + 6)%11.
3. So, the idea is to store the number N in string Str.
4. Take a ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

In this round interviewer asked me to solve 3 programming questions.

Q1. 
Selection Sort Algorithm
Selection sort is a sorting technique that works by repeatedly finding the minimum element (considering ascending order) from the unsorted part and placing it at the beginning of ...read more
Ans. Selection Sort Approach
Selection sort is a standard sorting algorithm that uses nested loops to find all the minimum elements in the array in each iteration and swap them with the starting element of the unsorted region of the array.
 
Steps :
• Use a minValue variable to find the index of the minimum element of the array.
• Use a loop to iterate over all the elements of the array.
• Use a nested loop to find the minimum ele...read more
Answered Anonymously
Add your answer
Q2. 
String Palindrome Verification
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
Input:
The input is a single string without any leading or trailing...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer
Q3. 
Star Pattern Problem Statement
Display the star pattern for a given positive integer N.
Example:
Input:
N = 4
Output:
   *
  ***
 *****
*******
 
Explanation:
The dots in the image represent spaces. Al...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was the HR round. They asked me simple HR questions and 1 coding question.

Q1. 
Character Counting Challenge
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...read more
Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered Anonymously
Add your answer

Aptitude test consisted of around 45 MCQs from basic topics like C, C++, OOPS

2nd round had 3 medium level (Leetcode) questions and 1 output question: 1. Level order traversal, 2. count zeros(not sure), 3. Linked List traversal related.

Round duration - 90 minutes
Round difficulty - Medium

Timing was 10AM. The platform was quite good.

Q1. 
Maximum Size Rectangle Sub-Matrix with All 1's
Given an N x M binary matrix 'MAT', where N is the number of rows and M is the number of columns, determine the maximum area of a submatrix consisting entire...read more
Ans. 
If the height of bars of the histogram is given then the largest area of the histogram can be found. This way in each row, the largest area of bars of the histogram can be found. To get the largest rectangle full of 1’s, update the next row with the previous row and find the largest area under the histogram, i.e. consider each 1’s as filled squares and 0’s with an empty square and consider each row as the base.
Answered Anonymously
Add your answer
Q2. 
Maximum Sum Path in a Binary Tree
Your task is to determine the maximum possible sum of a simple path between any two nodes (possibly the same) in a given binary tree of 'N' nodes with integer values.
Ex...read more
Ans. 
For each node there can be four ways that the max path goes through the node:
1. Node only
2. Max path through Left Child + Node
3. Max path through Right Child + Node
4. Max path through Left Child + Node + Max path through Right Child
Answered Anonymously
Add your answer
Q3. 
Minimum Number of Swaps to Sort an Array
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
Input:
T (number of test cases)
For each test case:
N (siz...read more
Ans. 
This can be easily done by visualizing the problem as a graph. We will have n nodes and an edge directed from node i to node j if the element at i’th index must be present at j’th index in the sorted array.
Answered Anonymously
Add your answer
Q4. 
Prefix to Infix Conversion
Transform a string representing a valid Prefix expression, which may contain operators '+', '-', '*', '/', and uppercase letters, into its corresponding Infix expression.
Examp...read more
Ans. 
Algorithm for Prefix to Infix:

Read the Prefix expression in reverse order (from right to left)
If the symbol is an operand, then push it onto the Stack
If the symbol is an operator, then pop two operands from the Stack
Create a string by concatenating the two operands and the operator between them.
string = (operand1 + operator + operand2)
And push the resultant string back to Stack
Repeat the above steps until end of Prefix
Answered Anonymously
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

Round held at 12 noon. There were 2 interviewers

Q1. 
Zig-Zag Array Rearrangement
You are provided with an array of distinct elements, and your task is to rearrange the array elements in a zig-zag manner. Specifically, for every odd index i, the element ARR[...read more
Add your answer
Q2. 
Sum Root to Leaf Path Problem
You are given an arbitrary binary tree consisting of N nodes where each node is associated with an integer value from 1 to 9. Each root-to-leaf path in the tree represents a ...read more
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

Round held at 4pm. There were 2 interviewers

Q1. 
Reverse Linked List in Groups of K
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...read more
Add your answer
Q2. 
Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a specified node within the tree, and an integer 'K', find all nodes that are exactly 'K' distance away from the specified node. Retur...read more
Add your answer