Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Paxcom India Full Stack Developer Interview Questions and Answers

Updated 24 Dec 2020

Paxcom India Full Stack Developer Interview Experiences

1 interview found

I applied via Naukri.com and was interviewed before Dec 2019. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Array and DP Questions in online test

Interview Preparation Tips

Interview preparation tips for other job seekers - It consists of three rounds
1. Coding
2. Technical I( telephonic)
3 Technical cum Managerial (Zoom)

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
2-4 weeks
Result
No response

I was interviewed in Sep 2024.

Round 1 - Aptitude Test 

An aptitude test evaluates an individual's potential to excel in a specific area by assessing their strengths and weaknesses in particular abilities.

Round 2 - Aptitude Test 

An assessment that measures an individual's inherent abilities and potential for success in a specific activity.

Round 3 - Coding Test 

A coding test is a programming assessment designed to evaluate a candidate's coding skills. It is a standard component of the technical hiring process for software developers and programmers.

Round 4 - Coding Test 

Assessment that evaluates a candidate's coding skills

Round 5 - Group Discussion 

Group discussion (GD) topics for interviews may cover areas such as business, social issues, and current affairs. GDs serve to evaluate a candidate's communication, leadership, and teamwork abilities.

Round 6 - Assignment 

Discussion assignments are prompts that your teacher may assign to you. By participating in these discussions, you can reflect on your learning, share ideas and opinions, or ask and answer questions. Discussions may require you to respond to individual questions or provide multiple responses to an ongoing conversation.

Interview Preparation Tips

Interview preparation tips for other job seekers - Job seekers can improve their chances by researching the job market, preparing their resume and cover letter, and networking.
Research
Know your goals: Consider your values, strengths, and ideal work environment.
Research the company: Anticipate common interview questions.
Prepare your resume
Tailor your resume: Customize your resume for each job application.
Highlight your skills: Highlight how your skills and experience match the job description.
Use keywords: Use relevant keywords in your resume and cover letter.
Prepare for interviews
Prepare your answers: Use the STAR method to prepare your answers.
Research the company: Anticipate common interview questions.
Network
Expand your professional network: You may find that more people can recommend you to a new position.
Use your professional network: You can use your network for career advice.
Other tips Don't limit your search to online resources, Optimize your LinkedIn profile, Use several job-search websites, Keep your resume up-to-date, and Develop your interview skills.
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. What are the different app states in an iOS application?
Interview experience
4
Good
Difficulty level
Easy
Process Duration
2-4 weeks
Result
No response

I was interviewed in Feb 2025.

Round 1 - Aptitude Test 

The test was easy basic aptitude questions.

Round 2 - Technical 

(2 Questions)

  • Q1. What is linkedlist
  • Q2. Explain your project

Interview Preparation Tips

Interview preparation tips for other job seekers - Very easy process be confident

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 180 min
Round difficulty - Hard

  • Q1. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

  • Ans. 

    The problem involves finding the length of the longest common subsequence between two given strings.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the lengths of common subsequences of substrings.

    • Iterate through the strings to fill the array and find the length of the longest common subsequence.

    • Example: For input STR1 = 'abcde' and STR2 = 'ace', the longest common subsequence is 'ac

  • Answered by AI
  • Q2. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

    • Iterate through each item and update the array based on whether including the item would increase the total value.

    • The final value in the array at index W will be the maximum value that can be stolen.

  • Answered by AI
  • Q3. 

    K Largest Elements Problem Statement

    You are given an unsorted array containing 'N' integers. Your task is to find the 'K' largest elements from this array and return them in non-decreasing order.

    Input:

    T...
  • Ans. 

    Yes, the problem can be solved in less than O(N*log(N)) time complexity using the Quick Select algorithm.

    • Implement Quick Select algorithm to find the Kth largest element in O(N) time complexity.

    • Partition the array around a pivot element and recursively search in the left or right partition based on the position of the pivot.

    • Once you find the Kth largest element, return all elements greater than or equal to it in non-de

  • Answered by AI
Round 2 - Coding Test 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Size of Largest BST in a Binary Tree

    Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a Binary Search Tree (BST).

    Explanation:

    A Binary Search Tree (BST) is def...

  • Ans. 

    Find the size of the largest BST subtree in a binary tree.

    • Traverse the tree in a bottom-up manner to check if each subtree is a BST.

    • Keep track of the size of the largest BST found so far.

    • Recursively check if the current subtree is a BST and update the size accordingly.

  • Answered by AI
  • Q2. 

    Matrix Chain Multiplication Problem

    Given 'N' 2-dimensional matrices and an array ARR of length N + 1, where the first N integers denote the number of rows in each matrix and the last integer represents t...

  • Ans. 

    Find the minimum number of multiplication operations required to multiply a series of matrices together.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the minimum number of operations needed to multiply matrices.

    • Iterate through different combinations of matrices to find the optimal solution.

    • Consider the dimensions of the matrices to determine the number of operations required.

    • Calcu...

  • Answered by AI
  • Q3. 

    Rotate Linked List Problem Statement

    Given a linked list consisting of 'N' nodes and an integer 'K', your task is to rotate the linked list by 'K' positions in a clockwise direction.

    Example:

    Input:
    Li...
  • Ans. 

    Rotate a linked list by K positions in a clockwise direction.

    • Traverse the linked list to find the length and the last node.

    • Connect the last node to the head to form a circular linked list.

    • Find the new head by moving (length - K) steps from the last node.

    • Break the circular list at the new head to get the rotated linked list.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

  • Q1. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...

  • Ans. 

    Given a string, find the longest palindromic substring within it.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found so far

    • Return the longest palindromic substring

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. Eligibility criteria7 CGPAJosh Technology Group interview preparation:Topics to prepare for the interview - DSA, OOPS, OS, CN, DBMS, atleast one languageTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : be thoroughly prepared with dsa
Tip 2 : focus on dbms.
Tip 3 : be prepared with skills mentioned in resume

Application resume tips for other job seekers

Tip 1 : mention some good projects
Tip 2 : don't put false statement

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.

Round 1 - MCQ 

(1 Question)

  • Q1. IT WAS MCQ CODING OUTPUT BASED ROUND IN WHICH TOTAL 45 QUESTION
Round 2 - SUBJECTIVE ROUND 

(1 Question)

  • Q1. IT WAS SUBJECTIVE CODING ROUND IN WHICH 1 OUTPUT BASED AND 3 CODING ROUND
Round 3 - Coding Test 

IT WAS 3RD CODING ROUND IN WHICH 3 CODING QUESTIONS AND DURATION 75MIN

Interview Preparation Tips

Interview preparation tips for other job seekers - PREPRARE FOR
LINKEDLIST
TREE
AND ADVANCE DSA

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

Students who qualified in first round gets link for this round, this round had 4 questions in total, out of which 1 was output based and 3 was DSA based.

  • Q1. 

    Validate Binary Tree Nodes Problem

    You are provided with 'N' binary tree nodes labeled from 0 to N-1, where node i has two potential children, recorded in the LEFT_CHILD[i] and RIGHT_CHILD[i] arrays. Dete...

  • Ans. 

    The task is to determine if the given binary tree nodes form exactly one valid binary tree.

    • Check if there is only one root node (a node with no parent)

    • Check if each node has at most one parent

    • Check if there are no cycles in the tree

    • Check if all nodes are connected and form a single tree

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 75 minutes
Round difficulty - Medium

This round was of 70-75 minutes and had 3 coding questions of easy to medium level. There was some restrictions like we cannot use built-in functions in both second and third subjective round.

  • Q1. 

    Balanced Binary Trees Problem Statement

    You are provided with an integer 'H'. Your task is to determine and print the maximum number of balanced binary trees possible with height 'H'.

    A balanced binary t...

  • Ans. 

    The maximum number of balanced binary trees possible with a given height is to be counted and printed.

    • A balanced binary tree is one in which the difference between the left and right subtree heights is less than or equal to 1.

    • The number of balanced binary trees can be calculated using dynamic programming.

    • The number of balanced binary trees with height 'H' can be obtained by summing the product of the number of balanced...

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was face to face interview round of 60 minutes. It was mostly based on DSA, some questions was also asked related to my projects and DBMS. Interviewer was kind and good.

  • Q1. 

    Wave Array Sorting Problem

    Your goal is to sort a given unsorted array ARR such that it forms a wave array.

    Explanation:

    After sorting, the array should satisfy the wave pattern conditions:

    • ARR[0] &...
  • Ans. 

    The task is to sort an array in a wave form, where each element is greater than or equal to its adjacent elements.

    • Iterate through the array and swap adjacent elements if they do not follow the wave pattern

    • Start from the second element and compare it with the previous element, swap if necessary

    • Continue this process until the end of the array

    • Repeat the process for the remaining elements

    • Return the sorted wave array

  • Answered by AI
  • Q2. 

    Maximum Sum BST Problem Statement

    You are presented with a Binary Tree 'root', which may not necessarily be a Binary Search Tree (BST). Your objective is to identify the maximum sum of node values in any ...

  • Ans. 

    The task is to find the maximum sum of node values of any subtree that is a Binary Search Tree(BST).

    • Traverse the binary tree in a bottom-up manner

    • For each node, check if it forms a BST and calculate the sum of its subtree

    • Keep track of the maximum sum encountered so far

    • Return the maximum sum

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 135 minutes
Round difficulty - Hard

This was the final technical round, it was around 2.5 hours long and based on mostly DSA and little bit Projects, DBMS, OS. Josh mainly focus on DSA and on Tree Data Structure in interview.

  • Q1. 

    Pair Sum in BST Problem Statement

    Given a Binary Search Tree (BST) and a target value K, determine if there exist two unique elements in the BST such that their sum equals K.

    Input:

    An integer T, the nu...
  • Ans. 

    The task is to check if there exist two unique elements in the given BST such that their sum is equal to the given target 'K'.

    • Traverse the BST in-order and store the elements in a sorted array

    • Use two pointers, one at the beginning and one at the end of the array

    • Check if the sum of the elements at the two pointers is equal to the target 'K'

    • If the sum is less than 'K', move the left pointer to the right

    • If the sum is grea...

  • Answered by AI
  • Q2. 

    Find Nodes at Distance K in a Binary Tree

    Your task is to find all nodes that are exactly a distance K from a given node in an arbitrary binary tree. The distance is defined as the number of edges between ...

  • Ans. 

    The task is to find all nodes in a binary tree that are at a distance K from a given node.

    • Implement a function that takes the binary tree, target node, and distance K as input.

    • Use a depth-first search (DFS) algorithm to traverse the tree and find the nodes at distance K.

    • Keep track of the distance from the current node to the target node while traversing.

    • When the distance equals K, add the current node to the result lis...

  • Answered by AI
Round 5 - HR 

Round duration - 20 minutes
Round difficulty - Easy

This was the simple 20 minutes round

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Raj Kumar Goel Institute Of Technology. Eligibility criteriaNo criteriaJosh Technology Group interview preparation:Topics to prepare for the interview - Linked list, Tree, Graph, Dynamic Programming, Recursion, BacktrackingTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Try to solve some good questions from every topic.
Tip 2 : If not have much time, then you can solve top interview questions from Leetcode.
Tip 3 : Made 2-3 good projects using any technology

Application resume tips for other job seekers

Tip 1 : Keep resume short and crispy.
Tip 2 : Add coding profile handles and github link.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

All multiple-choice questions on object-oriented programming and pointers.

Round 2 - Coding Test 

Questions related to linked lists and trees.

Round 3 - Coding Test 

Three questions, all regarding LinkedIn, focusing on lists and trees.

Interview experience
3
Average
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
No response

I applied via Campus Placement and was interviewed in Jul 2024. There were 3 interview rounds.

Round 1 - Aptitude Test 

Basic multiple-choice questions on programming languages.

Round 2 - Coding Test 

DSA round 1 , 3 questions on arrays, LL, trees

Round 3 - Coding Test 

DSA round 2 : 3 questions on stack and queue, trees, dp

Interview experience
3
Average
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

In first round there were two test
1st is the personality test.
2nd is the aptitude test were they asked about 10 aptitude questions and around 40 coding based questions, some of them were mcq and rest were output based.

Round 2 - Coding Test 

Contains 4 DSA based questions, 1 question was hard, and other 3 questions were of medium level.

Interview Preparation Tips

Interview preparation tips for other job seekers - You should be well prepared of the Josh Technology Group, you should be very good in coding and should know DSA very well.
Contribute & help others!
anonymous
You can choose to be anonymous

Paxcom India Interview FAQs

How to prepare for Paxcom India Full Stack Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Paxcom India. The most common topics and skills that interviewers at Paxcom India expect are Angularjs, React.Js, Java, Node.Js and Javascript.

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

Paxcom India

No Interviews

REVIEWS

Keolis Hyderabad Metro

No Reviews

REVIEWS

Keolis Hyderabad Metro

No Reviews

INTERVIEWS

Bhanzu

No Interviews

INTERVIEWS

Paxcom India

No Interviews

INTERVIEWS

Bhanzu

No Interviews

INTERVIEWS

Marble Box

No Interviews

INTERVIEWS

Paxcom India

No Interviews

Tell us how to improve this page.

Paxcom India Full Stack Developer Salary
based on 9 salaries
₹6 L/yr - ₹11 L/yr
14% less than the average Full Stack Developer Salary in India
View more details
Software Engineer
77 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
35 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

E-Commerce Analyst
35 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Analyst
18 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

QA Engineer
18 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Paxcom India with

TCS

3.7
Compare

Infosys

3.6
Compare

Wipro

3.7
Compare

HCLTech

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview