Paxcom India DOT NET Developer Interview Questions and Answers

Q1. DSA questions on arrays
Add your answer
Q2. Add 1 in last array element and make it 10 and add carry to second index element
Ans. 
Increment last element of array by 1 and carry over to second last element
• Iterate through the array in reverse order

• Increment the last element by 1 and check if it becomes 10

• If last element becomes 10, set it to 0 and carry over 1 to the second last element
Answered by AI
Add your answer

Code Snept question with 3-4 Reasoning question. Google form

Pen paper coding round. String , Array . Linkedlist , graph, questions

Q1. Maximum Spaning
Add your answer
Q2. Nearest Prime number
Ans. 
To find the nearest prime number, iterate from the given number in both directions until a prime number is found.
• Start iterating from the given number in both directions to find the nearest prime number.

• Check if a number is prime by dividing it by all numbers less than its square root.

• Keep track of the closest prime number found during the iteration.
Answered by AI
Add your answer
Q3. Second Maximum Number in Array
Ans. 
Find the second maximum number in an array of strings.
• Convert the array of strings to an array of integers.

• Sort the array in descending order.

• Return the second element in the sorted array.
Answered by AI
Add your answer

Q1. Project Question
Add your answer
Q2. Robot question of DSA
Add your answer
Q3. Stock Buy and sell - VI . Leetcode Hard
Add your answer
Q4. Leetcode Medium
Add your answer

Q1. How make a queue using a stack
Ans. 
To implement a queue using a stack, use two stacks and simulate the queue operations.
• Use two stacks, one for enqueue operation and one for dequeue operation.

• For enqueue operation, simply push elements onto the stack used for enqueueing.

• For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.

• Then pop from the dequeue stack to simulate dequeue operation.
Answered by AI
Add your answer
Q2. Create a linked list
Ans. 
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
• Create a Node class with data and next pointer

• Initialize a head pointer to null

• Add nodes by updating next pointers

• Traverse the list by following next pointers
Answered by AI
Add your answer

It is very impressive work on Josh technology assessment because we learn many new skills.

Q1. What is api and how it is work ?
Ans. 
API stands for Application Programming Interface. It is a set of rules and protocols that allows different software applications to communicate with each other.
• APIs define the methods and data formats that applications can use to request and exchange information.

• APIs can be used to access services provided by other software applications, such as retrieving data from a database or sending notifications.

• Examples of APIs ...read more
Answered by AI
Add your answer
Q2. What is software development life cycle and which steps are following?
Ans. 
Software development life cycle (SDLC) is a process used by software developers to design, develop, and test software.
• 1. Planning: Define the project scope, requirements, and objectives.

• 2. Analysis: Gather and analyze user requirements.

• 3. Design: Create a detailed design of the software.

• 4. Implementation: Develop the software based on the design.

• 5. Testing: Test the software for bugs and issues.

• 6. Deployment: Release t...read more
Answered by AI
Add your answer

It was ok. I was not able to solve all the questions.

Q1. Remove the last element from a linkedlist
Add your answer
Q2. Some basic questions on oops dbms and os
Add your answer

The interviewer asked about javascript basics and DSA questions and some typescript questions

Q1. Tell me about
Add your answer
Q2. Your self they are asking
Add your answer
Q3. What is your weakness
Add your answer
Q4. Any questions ask for me
Add your answer
Q5. All the best future
Add your answer

Coding for international

Quantitative arithmetic,verbal reasoning,non-verbal reasoning,etc