Paxcom India Interview Questions, Process, and Tips

Test was on Hackerrank, 150 min duration, questions were easy to medium difficulty from topics such as Binary search, Doubly Linked list and Array manipulation.

Q1. What is an Enum? implementation of an Enum
Ans. 
An Enum is a data type that consists of a set of named values.
• Enums are used to define a set of constants that can be used throughout the code.

• Each value in an Enum is assigned an integer value by default, starting from 0.

• Enums can also be assigned specific integer values or even string values.

• Enums can be used in switch statements to handle different cases.

• Example: enum Color { RED, GREEN, BLUE };

• Example: enum Status
Answered by AI
Add your answer
Q2. Most efficient way to reverse a String of characters
Ans. 
The most efficient way to reverse a String of characters is to use StringBuilder's reverse() method.
• Create a StringBuilder object with the given String as parameter

• Call the reverse() method on the StringBuilder object

• Convert the StringBuilder object back to a String using toString() method
Answered by AI
Add your answer
Q3. Find the odd occuring number from array of numbers including even occuring (frequency) numbers.
Ans. 
Find the odd occurring number from an array of numbers, including even occurring numbers.
• Iterate through the array and count the frequency of each number using a hash map.

• Iterate through the hash map and return the number with an odd frequency.

• If no number has an odd frequency, return 'No odd occurring number found.'
Answered by AI
View 1 more answer
Q4. Follow-up to Q3: Find two odd occuring numbers (Eff. Sol: Double Xor method)
Ans. 
The double XOR method is used to find two odd occurring numbers in an array.
• Iterate through the array and perform XOR operation on all elements

• The result will be the XOR of the two odd occurring numbers

• Find the rightmost set bit in the result

• Divide the array into two groups based on whether the corresponding bit is set or not

• Perform XOR on each group separately to find the two odd occurring numbers
Answered by AI
View 1 more answer

Q1. Why would you like to join our company?
Add your answer
Q2. What are your career goals?
Add your answer

Q1. Basics of DL and CV
Add your answer
Q2. Mainly OD related questions
Add your answer

To build a classifier given complex dataset

Q1. Discussion based on assignment and previous experience
Add your answer

Q1. About the roles and salary discussion
Add your answer

Round duration - 125 minutes
Round difficulty - Easy

This round consist of coding questions and they were of good level based on strings and dynamic programming.
This round was the online coding test conducted on the platform Amcat. The languages allowed were C, C++, Java and Python.

Q1. 
Kth Largest Element Problem Statement
Ninja enjoys working with numbers, and Alice challenges him to find the Kth largest value from a given list of numbers.
Input:
The first line contains an integer 'T...read more
Ans. Sorting
The idea is to sort the elements and return the kth largest element among them.
 
The steps are as follows:
• Sort the elements in descending order.
• Return the element at k - 1 th index.
Space Complexity: O(1)Explanation:
O(1), no extra space required.
 
As we are not using any extra space. Hence, the overall space complexity is O(1).
Time Complexity: O(nlogn)Explanation:
O(N*logN), where ‘N’ is the total number...read more
Answered Anonymously
Add your answer
Q2. 
Maximize Expression Value
Given an arithmetic expression EXP containing integer values separated by any of the operators ‘+’, ‘-’, and ‘*’, your task is to place parentheses such that the value of the exp...read more
Ans. Recursion
The basic idea to solve this problem is to recursively place parentheses at all possible positions and find the maximum value obtained among all.
 
We can divide the input expression into smaller expressions recursively and find the maximum value.
 
If the input expression is ( EXP[ 0 ] opr EXP[ 1 ] opr EXP[ 2 ].............opr EXP[ n-1 ] ), then we can divide this expression into two as -
( EXP[ 0 ] opr…...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The interview took place in the morning and the interviewer was very friendly.

Q1. 
Kruskal’s Minimum Spanning Tree Algorithm Problem Statement
You are given a connected undirected weighted graph. Your task is to determine the weight of the minimum spanning tree of this graph.
A minimum...read more
Ans. Kruskal’s algorithm
The basic idea of Kruskal’s algorithm is to sort the edges of the graph in non-decreasing order by its weight. And place all the nodes of the original graph isolated from each other, to form a forest of single node trees. Then, at each step of the algorithm, we will try to merge the trees by an edge of the original graph. The idea here is to choose the edges greedily. At each iteration, choose the ed...read more
Answered Anonymously
Add your answer
Q2. 
Sum Tree Conversion
Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...read more
Ans. DFS Approach
The approach is very simple and can be achieved using the tree Depth First traversal approach.
Divide the tasks into two parts.
1. Build the Sum Tree
   1. You need to update the root data with the sum of the left and right children’s data given that the root itself is not null.
   2. Well, you can do so by checking the left node and right node. If they are not null, take their sum and update the root data.
   3. Extend this idea fu...read more
Answered Anonymously
Add your answer
Q3. 
Determine the Left View of a Binary Tree
You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...read more
Ans. Preorder Traversal Approach
The idea is to use preorder traversal and for each level of the binary tree include the leftmost node in the answer. In the preorder traversal, we will traverse the left subtree of any node before the right subtree so that all nodes to the left of the current node are visited before the nodes which are on the right of the current node. Hence for any level, we will reach the leftmost node befo...read more
Answered Anonymously
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

50 questions - 1 hour

Q1. 
Problem Statement: Largest Island
You are provided with a non-empty grid consisting of only 0s and 1s. Your task is to determine the maximum area of an island within the given grid.
An island consists of a...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

2 question of coding - 1 hour

Q1. 
Circular Move Problem Statement
You have a robot currently positioned at the origin (0, 0) on a two-dimensional grid, facing the north direction. You are given a sequence of moves in the form of a string ...read more
Add your answer
Q2. 
Character Frequency Problem Statement
You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string.
Example:
Input:
S : abcdg
Output:
1...read more
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

Introduction
Projects
DBMS
Oops

Q1. 
Digit Count In Range Problem Statement
Given an integer K, and two numbers A and B, count the occurrences of the digit K in the range [A, B].
Include both the lower and upper limits in the count.
Input:
...read more
View 1 more answer
Q2. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Add your answer

Round duration - 40 Minutes
Round difficulty - Easy

 Introduction
 Projects (describe all mention in resume)
 Polymorphism (definition, types and real world example)
 Joins (left & right)
 Use of groupby
 JVM (JDK & JRE)

Q1. 
Missing Number Problem Statement
You are provided with an array named BINARYNUMS consisting of N unique strings. Each string represents an integer in binary, covering every integer from 0 to N except for ...read more
Add your answer
Q2. 
Find Two Missing Numbers Problem Statement
Given an array of unique integers where each element is in the range [1, N], and the size of the array is (N - 2), there are two numbers missing from this array....read more
Add your answer