Paxcom India Software Engineer Interview Questions, Process, and Tips

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
Ninja loves playing with numbers. One day Alice gives him some numbers and asks him to find the Kth largest value among them.
Input Format:
The first line of input contains an integer...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 by CodingNinjas
View 1 more answer
Q2. Arithmetic Operators
Given an arithmetic expression ‘EXP’ containing integer values separated by any of the three operators ‘ + ’, ‘ - ’ and ‘ * ’. You need to place parentheses in the given expression suc...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 by CodingNinjas
View 2 more answers

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
You have been given a connected undirected weighted graph. Your task is to find the weight of the minimum spanning tree of the given graph.
A minimum spanning tr...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 by CodingNinjas
View 1 more answer
Q2. Sum Tree
For a given binary tree, convert it to its sum tree. That is, replace every node data with sum of its immediate children, keeping leaf nodes 0. Finally, return its preorder.
For example:
The inp...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 by CodingNinjas
Add your answer
Q3. Left View Of a Binary Tree
You have been given a binary tree of integers. You are supposed to find the left view of the binary tree. The left view of a binary tree is the set of all nodes that are visible ...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 by CodingNinjas
View 1 more answer