Filter interviews by
Top trending discussions
I applied via Naukri.com and was interviewed in Jul 2021. There was 1 interview round.
posted on 9 Jul 2024
I applied via Company Website and was interviewed in Jun 2024. There was 1 interview round.
I have implemented various technical improvements in codes to enhance performance and functionality.
Implemented caching mechanisms to reduce load times
Optimized database queries for faster retrieval of data
Introduced error handling techniques to improve code reliability
Utilized design patterns to make the codebase more maintainable
Refactored legacy code to adhere to best practices
posted on 17 Apr 2024
I was surprised to see that all applications were gathered at a huge meeting room. We were handed out 4 pages of a case study and we were told to create a business plan for our responsible market.
posted on 25 Aug 2023
2 questions were given , one was easy, other one leetcode hard
A class is a blueprint for creating objects in object-oriented programming. Basic OOP concepts include encapsulation, inheritance, and polymorphism. SQL concepts include querying databases using SQL commands.
A class is a template for creating objects with properties and methods.
Encapsulation is the concept of bundling data and methods that operate on the data within a single unit.
Inheritance allows a class to inherit p...
Polymorphism is the ability of a function or method to behave differently based on the object it is called with.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
There are two types of polymorphism: compile-time (method overloading) and runtime (method overriding).
Example: Inheritance in object-oriented programming languages like Java allows for polymorphism.
Example: A met...
posted on 13 Sep 2023
I applied via campus placement at Delhi College of Engineering (DCE), Delhi
1.5 hours long, platform was hackerearth.
Reverse a linked list by changing the pointers direction.
Start with three pointers: current, previous, and next.
Iterate through the linked list, updating the pointers to reverse the direction.
Update the head pointer to the last node to complete the reversal.
I applied via LinkedIn and was interviewed in Sep 2021. There were 3 interview rounds.
Two questions
I worked as a Software Development Engineer at XYZ Company.
Developed and maintained software applications using Java and Python.
Collaborated with cross-functional teams to gather requirements and design solutions.
Implemented unit tests and performed code reviews to ensure code quality.
Participated in Agile development processes and attended daily stand-up meetings.
Troubleshot and resolved software defects and issues re...
Seeking new challenges and growth opportunities in software development.
Looking for a change to expand my skill set and work on more complex projects.
Seeking a company with a strong focus on innovation and cutting-edge technologies.
Wanting to join a team that encourages collaboration and continuous learning.
Desire to work in a more dynamic and fast-paced environment.
Looking for better career prospects and advancement o
I am a software development engineer with experience in building scalable and efficient applications.
Proficient in programming languages like Java, C++, and Python
Strong understanding of data structures and algorithms
Experience in developing web applications using frameworks like Spring and Django
Familiar with version control systems like Git
Worked on projects involving database management and optimization
Passionate ab...
I applied via Company Website and was interviewed in Jun 2020. There was 1 interview round.
posted on 16 Jan 2024
I applied via Company Website and was interviewed in Dec 2023. There were 2 interview rounds.
All models should be made available or their complete information should be given in fresher training.
posted on 15 Jul 2024
I applied via Approached by Company and was interviewed before Jul 2023. There was 1 interview round.
Zigzag level order traversal of tree involves traversing the tree level by level in a zigzag pattern.
Use a queue to perform level order traversal of the tree
Alternate between left to right and right to left traversal for each level
Store the nodes at each level in separate arrays
A vector is a dynamic array that can resize itself as needed.
A vector is typically implemented using a dynamically allocated array.
It provides constant time access to elements using index.
Vectors can grow in size by reallocating memory when needed.
Example: vector
Example: vec.push_back(10);
Trust and Safety Specialist
73
salaries
| ₹5.5 L/yr - ₹9 L/yr |
Software Engineer
65
salaries
| ₹15 L/yr - ₹58.8 L/yr |
Senior Software Engineer
57
salaries
| ₹23 L/yr - ₹88.2 L/yr |
Content Reviewer
37
salaries
| ₹3.6 L/yr - ₹9.9 L/yr |
Account Director
31
salaries
| ₹15 L/yr - ₹39 L/yr |
Microsoft Corporation
Amazon