Argano Software Senior Software Engineer Interview Questions and Answers

Q1. Delete node in BST
Ans. 
Deleting a node in a Binary Search Tree (BST) involves finding the node, handling different cases, and rearranging the tree.
• Find the node to delete by traversing the tree

• Handle different cases: node has no children, node has one child, node has two children

• Rearrange the tree by replacing the node with its successor or predecessor
Answered by AI
Add your answer
Q2. Producer Consumer problem
Ans. 
Producer Consumer problem involves two processes sharing a common buffer.
• Producer adds data to the buffer

• Consumer removes data from the buffer

• Buffer size must be managed to prevent overflow or underflow
Answered by AI
Add your answer

Q1. Salary And previous exp
Add your answer

A coding test may include a LeetCode medium-level question that you can expect.

Q1. Why you are accepting refrence people got a job this organisation....they are no skilled....nikhila is a skilled employee but she's replaced person Surya is very low power skill...bcz of sarath Chandra rou...read more
Add your answer
Q2. Prakash Kumar sahoo is very skilled person but why pradeep reference her old colleague Karthik and jeeva ,,,,then etc people from Wipro company....bcz pradeep thinking is (already I left from this golden e...read more
Add your answer

Consisted of technical+ mathematical Aptitude questions

Q1. How to reverse a linked list
Ans. 
To reverse a linked list, iterate through the list and change the direction of pointers.
• Iterate through the linked list and keep track of the previous, current, and next nodes.

• Update the pointers of each node to reverse the direction.

• Set the head of the linked list to the last node after reversing.
Answered by AI
Add your answer
Q2. How to implement stack using queue and vice versa
Ans. 
To implement a stack using a queue, we can use two queues. To implement a queue using a stack, we can use two stacks.
• To implement a stack using a queue, we can use two queues. One queue will act as the main stack, while the other will be used for temporary storage during push operations.

• For example, when pushing an element onto the stack, we can dequeue all elements from the main queue and enqueue them into the tempora...read more
Answered by AI
Add your answer

Assignment test will be intrested to me

Aptitude test will be intrested to me

Q1. How does Angular work ?
Ans. 
Angular is a front-end web application framework that allows developers to build dynamic single-page applications.
• Angular uses TypeScript for building applications.

• It follows the MVC (Model-View-Controller) architecture.

• Angular provides two-way data binding, which means changes in the model are automatically reflected in the view and vice versa.

• It uses directives to extend HTML with new attributes and tags.

• Angular has ...read more
Answered by AI
Add your answer
Q2. Array based javascript question
Add your answer
Q3. What is hoisting ?
Ans. 
Hoisting is a JavaScript mechanism where variable and function declarations are moved to the top of their containing scope during compilation.
• In JavaScript, variable and function declarations are hoisted to the top of their scope.

• This means that you can use a variable or function before it is declared.

• However, only the declarations are hoisted, not the initializations.
Answered by AI
Add your answer
Q4. What is temporal dead zone ?
Ans. 
Temporal dead zone is the period between entering scope and being able to access a variable.
• Occurs when trying to access a variable before it has been declared

• Caused by hoisting in JavaScript

• Results in a ReferenceError

• Example: const x = 10; console.log(x); // ReferenceError: Cannot access 'x' before initialization
Answered by AI
Add your answer