Filter interviews by
I applied via Naukri.com and was interviewed in Jun 2024. There was 1 interview round.
Priority is the importance of fixing a bug, severity is the impact of the bug on the system.
High priority, low severity: Spelling mistake in a button label
Low priority, high severity: Critical security vulnerability
APIs tested: RESTful, SOAP, GraphQL
GET: Retrieve data, POST: Create data, PUT: Update data
REST and SOAP APIs are two different types of web service protocols. @Before and @BeforeMethod are annotations used in TestNG for setup tasks.
REST API is lightweight and uses standard HTTP methods like GET, POST, PUT, DELETE. SOAP API is more rigid and uses XML for communication.
@Before annotation is used in TestNG to run setup tasks before each test method. @BeforeMethod is used to run setup tasks before each test met...
Javascript MCQ
AWS MCQ
Sliding window: smallest substring with unique characters
Code review involves checking for code quality, functionality, security, and adherence to coding standards.
Checking for code quality and readability
Ensuring the code functions as intended
Identifying and fixing security vulnerabilities
Verifying adherence to coding standards and best practices
Providing constructive feedback to the developer
App performance should consider factors like code optimization, network efficiency, memory management, and user experience.
Optimizing code for efficiency and speed
Minimizing network requests and optimizing data transfer
Efficient memory management to prevent crashes and slowdowns
Prioritizing user experience for smooth navigation and responsiveness
I applied via Naukri.com and was interviewed before Nov 2023. There were 3 interview rounds.
Java 8 introduced several new features including lambda expressions, functional interfaces, streams, and default methods.
Lambda expressions allow you to pass functionality as an argument to a method.
Functional interfaces have a single abstract method and can be used with lambda expressions.
Streams provide a way to process collections of objects in a functional style.
Default methods allow interfaces to have method imple...
They give you assignment to complete in 1 hour.
Paxcom India interview questions for popular designations
I applied via Campus Placement and was interviewed in May 2022. There were 4 interview rounds.
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.
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
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
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.'
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
Get interview-ready with Top Paxcom India Interview Questions
I applied via Company Website and was interviewed in Jul 2022. There were 2 interview rounds.
2 problems in Microsoft Excel where they'll see your problem solving skills
I applied via Approached by Company and was interviewed before Jun 2023. There were 4 interview rounds.
To build a classifier given complex dataset
I was interviewed in Jan 2021.
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.
Ninja enjoys working with numbers, and Alice challenges him to find the Kth largest value from a given list of numbers.
The first line contains an integer 'T...
The task is to find the Kth largest element from a given list of numbers for each test case.
Read the number of test cases 'T'
For each test case, read the number of elements 'N' and the Kth largest number to find 'K'
Sort the array in descending order and output the Kth element
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...
Given an arithmetic expression, place parentheses to maximize the value of the expression.
Identify the operators in the expression ('+', '-', '*').
Consider the precedence of operators to determine where to place parentheses.
Calculate the value of the expression with different placements of parentheses to find the maximum value.
Round duration - 45 minutes
Round difficulty - Easy
The interview took place in the morning and the interviewer was very friendly.
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...
The task is to determine the weight of the minimum spanning tree of a given connected undirected weighted graph.
Implement Kruskal's algorithm to find the minimum spanning tree weight.
Sort the edges based on their weights in non-decreasing order.
Iterate through the sorted edges and add them to the MST if they don't form a cycle.
Keep track of the total weight of the MST and return it as the output.
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...
Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return the preorder traversal of the sum tree.
Traverse the tree in a bottom-up manner to calculate the sum of children for each node.
Set leaf nodes to 0 and update non-leaf nodes with the sum of their children.
Return the preorder traversal of the modified 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...
To determine the left view of a binary tree, we need to find the nodes that are visible when the tree is viewed from the left side.
Traverse the binary tree in a level order manner and keep track of the first node at each level (leftmost node).
Store the leftmost nodes in an array as they are encountered during the traversal.
Return the array containing the left view of the binary tree.
Tip 1 : Just be confident during interview and if you are stuck in between any question, then ask for a hint from the interviewer. The practice is key for success, so practice hard for Data Structures and Algorithms coding problems on Coding ninjas as it is the best platform for coding. Also you may practice on Geeks For Geeks or any other interview portal.
Tip 2 : Try to do as much as Data structures related questions as practice made a man perfect.
Tip 3 : If you have already done similar types of questions then you will get a solution approach very fastly during the interview.
Tip 1 : Mention all internships which you have done, as it increases your chances of shortlisting your resume.
Tip 2 : Keep resume short and up to the point and try to keep it on a single page.
Tip 3 : Also just write that skills which you are pretty confident about.
I was interviewed before May 2021.
Round duration - 50 Minutes
Round difficulty - Easy
50 questions - 1 hour
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...
Find the maximum area of an island in a grid of 0s and 1s.
Iterate through the grid and perform depth-first search (DFS) to find connected 1s.
Keep track of the area of each island found and return the maximum area.
Consider all four directions (horizontal, vertical, and diagonal) while exploring the island.
Handle edge cases like grid boundaries and already visited cells during DFS.
If no island is present, return 0 as the
Round duration - 60 Minutes
Round difficulty - Easy
2 question of coding - 1 hour
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 ...
Determine if a robot's movement path is circular on a 2D grid given a sequence of moves in the form of a string.
Create a variable to track the robot's position (x, y) and direction (north, east, south, west).
Iterate through the move sequence and update the position and direction based on the current move.
Check if the robot returns to the starting position after completing the move sequence.
Return true if the robot ends
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.
S : abcdg
1...
The task is to find the frequency of each character from 'a' to 'z' in a given string.
Create an array of size 26 to store the frequency of each character from 'a' to 'z'.
Iterate through the string and increment the count of the corresponding character in the array.
Print the array of frequencies as the output for each test case.
Round duration - 20 Minutes
Round difficulty - Easy
Introduction
Projects
DBMS
Oops
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.
Count occurrences of a digit in a given range.
Iterate through the range [A, B] and count occurrences of digit K.
Convert integers to strings for easier digit comparison.
Handle edge cases like when A or B is equal to K.
Optimize by considering the position of K in the range.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Alternatively, you can use built-in functions like reverse() or slicing in some programming languages.
Remember to handle different types of characters like alphabets, numbers, and special characters.
Ensure to consider the constraints on the input
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)
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 ...
Find the missing integer in binary form from an array of unique binary strings.
Iterate through the binary strings and convert them to integers.
Calculate the sum of all integers from 0 to N using the formula (N*(N+1))/2.
Subtract the sum of integers in the array from the total sum to find the missing integer.
Convert the missing integer to binary form and return it as a string.
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....
Given an array of unique integers with two missing numbers, identify and return the missing numbers.
Iterate through the array and mark the presence of each number in a separate array.
Find the missing numbers by checking which numbers are not present in the marked array.
Return the missing numbers in increasing order.
Tip 1 : Main focus on DS algo
Tip 2 : Do Subject also (dbms, os, etc)
Tip 3 : Do some good projects
Tip 1 : Highlight your strong points
Tip 2 : Change resume according to required skills by comapny
I was interviewed in Nov 2020.
Round duration - 50 minutes
Round difficulty - Easy
Round duration - 50 Minutes
Round difficulty - Easy
Create a program to print a numeric pattern based on the given input integer N
which specifies the number of rows.
N = 4
1
23
345
4567
Ea...
Generate a numeric pattern based on the given input integer N specifying the number of rows.
Iterate from 1 to N to print each row
Start each row with the row index and increase consecutively per row count
Use nested loops to handle the increasing numbers in each row
Round duration - 10 Minutes
Round difficulty - Easy
Tip 1 : Conduct a Mock Interview
Tip 2 : Do Extensive Research on the Company
Tip 1 : Make Your Contact Info Prominent
Tip 2 : Design for Skimmability
I applied via Campus Placement and was interviewed before Sep 2020. There were 4 interview rounds.
Top trending discussions
based on 7 interviews
Interview experience
based on 61 reviews
Rating in categories
Software Engineer
77
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
E-Commerce Analyst
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
18
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech