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 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