They give a topic to discuss

Q1. Basic oops and dsa
Add your answer
Q2. Pillars of oops, stack , queue and some algorithms
Ans. 
Pillars of OOPs are Abstraction, Encapsulation, Inheritance, and Polymorphism. Stack and Queue are data structures. Algorithms include sorting, searching, and graph traversal.
• Abstraction: Hiding implementation details

• Encapsulation: Binding data and functions together

• Inheritance: Reusing code from parent classes

• Polymorphism: Multiple forms of a function or object

• Stack: Last In First Out (LIFO) data structure

• Queue: First...read more
Answered by AI
Add your answer
Q3. How stack work difference between stack and queues
Ans. 
Stack and queue are data structures used to store and retrieve data. The main difference is in the order of retrieval.
• Stack follows Last In First Out (LIFO) order, while Queue follows First In First Out (FIFO) order.

• In a stack, the element added last is the first one to be removed, while in a queue, the element added first is the first one to be removed.

• Stacks are used in undo-redo functionality, while queues are used
Answered by AI
Add your answer

Q1. Personal information family background, studies etc
Add your answer
Q2. About family, can you relocate to Navi Mumbai
Add your answer

5-10 mins
Topic - Ecommerce vs Brick n Mortar Shops

Q1. Questions on python in detail
Add your answer
Q2. Software Development Lifecycle
Ans. 
Software Development Lifecycle is a process used by software development teams to design, develop, test, and deploy software.
• SDLC consists of several phases including planning, analysis, design, implementation, testing, and maintenance.

• Each phase has its own set of activities and deliverables to ensure the software meets requirements and quality standards.

• Examples of SDLC models include Waterfall, Agile, and DevOps.

• SDL...read more
Answered by AI
Add your answer

Q1. This was HR + Tech Round I was asked questions about my resume, my future interests, my field of choice
Add your answer

2 DSA questions were asked of easy level

Q1. I was asked to find the second largest number in an array in O(n) time complexity.
Ans. 
Use a single pass algorithm to find the second largest number in an array of strings in O(n) time complexity.
• Iterate through the array and keep track of the largest and second largest numbers encountered so far.

• Update the second largest number whenever a new number greater than the current second largest is found.

• Return the second largest number at the end of the iteration.
Answered by AI
Add your answer
Q2. It was a leetcode question to find the target sum.
Add your answer

Q1. Basic discussion about family and experiences in college and all
Add your answer

Basic java coding questions

Q1. Basic DSA questions
Add your answer
Q2. Linked list sorting by two pointer
Ans. 
Sorting a linked list using two pointers
• Use two pointers to traverse the linked list and compare values

• Implement sorting algorithm like bubble sort or merge sort

• Update the links between nodes to rearrange them in sorted order
Answered by AI
Add your answer
Q3. Question on Binary search
Add your answer