Filter interviews by
It was like 5 MCQ and two coding questions with difficult level of moderate
React components go through various stages in their life cycle, from initialization to destruction.
Initialization: Component is created and initialized with default props and state.
Mounting: Component is rendered on the DOM for the first time.
Updating: Component re-renders when props or state change.
Unmounting: Component is removed from the DOM.
Examples: componentDidMount() for mounting, componentDidUpdate() for updati...
I applied via Campus Placement and was interviewed in Feb 2021. There were 4 interview rounds.
To find the middle of a linked list in one iteration, use two pointers with different speeds.
Initialize two pointers, one slow and one fast, both pointing to the head of the linked list.
Move the slow pointer one step at a time and the fast pointer two steps at a time.
When the fast pointer reaches the end of the linked list, the slow pointer will be at the middle node.
A binary tree is a data structure consisting of nodes, where each node has at most two children.
Binary tree is used to represent hierarchical relationships between nodes
Traversal of binary tree can be done in three ways: inorder, preorder, postorder
Binary search tree is a type of binary tree where left child is smaller and right child is greater than parent
Balanced binary tree has height difference of at most 1 between...
Top trending discussions
I am a software developer with experience in Java and Python.
I have a Bachelor's degree in Computer Science.
I have worked on various projects involving web development and data analysis.
I am proficient in Java and Python programming languages.
I am a quick learner and enjoy working in a team environment.
DBMS stands for Database Management System. It is used to manage and organize data in a structured manner.
DBMS is used in various industries such as healthcare, finance, education, and more.
It helps in creating, modifying, and deleting data in a database.
DBMS provides security features to protect data from unauthorized access.
Examples of DBMS include MySQL, Oracle, Microsoft SQL Server, and PostgreSQL.
An object is a self-contained entity that contains data and behavior.
Objects are instances of classes
They have attributes (data) and methods (behavior)
Objects can interact with each other through method calls
Example: A car object has attributes like color, make, and model, and methods like start and stop
Sorting is the process of arranging data in a particular order.
Sorting can be done in ascending or descending order.
Common sorting algorithms include bubble sort, insertion sort, and quicksort.
Sorting can be done on various data types, including strings, numbers, and objects.
Sorting can be done using built-in functions in programming languages such as sort() in JavaScript.
Sorting can be optimized for performance by cho...
C is a procedural programming language while C++ is an object-oriented programming language.
C++ supports classes and objects while C does not.
C++ has better support for polymorphism and inheritance than C.
C++ has a larger standard library than C.
C++ allows function overloading while C does not.
C++ supports exception handling while C does not.
I am a software developer with experience in Java and Python. I am passionate about coding and always eager to learn new technologies.
Experienced in Java and Python
Passionate about coding
Eager to learn new technologies
Yes, my family is supportive of my career and relocation decisions.
My family understands the importance of career growth and is supportive of my decisions.
We have discussed the possibility of relocation and they are willing to make the necessary adjustments.
They trust my judgment and believe that this move will be beneficial for my career.
We have also considered the quality of life in Hyderabad and believe that it will...
posted on 3 Feb 2021
I applied via Approached by Company and was interviewed before Mar 2021. There were 4 interview rounds.
DSA
About Social changes
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
We were supposed to give test in any time between 3 PM to 9 PM.
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...
The problem involves finding the total number of unique paths from the top-left to bottom-right cell of a matrix by moving only right or down.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the number of unique paths at each cell.
Initialize the first row and first column with 1 as there is only one way to reach them.
For each cell (i, j), the number of unique paths is the sum of paths...
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...
Given a tree with N nodes, find the number of elements in each subtree rooted at every node.
Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.
Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.
The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.
Round duration - 120 minutes
Round difficulty - Medium
Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM
Focus Areas: Problem solving and implementation of extensions.
The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array S...
Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.
Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.
Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.
Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.
Round duration - 120 minutes
Round difficulty - Medium
Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
Return the element pointed to by the slow pointer
Tip 1 : Have good grasp on OOPS since they have a round named Pair Programming round which is focused upon this.
Tip 2 : Write clean, modular and functional code.
Tip 3 : Practice Data Structures and Algorithms
Tip 4 : You should know breadth and depth of whatever is mentioned in your resume.
Tip 5 : Be loud and clear.
Tip 1 : Make single page resume.
Tip 2 : Mention relevant things on resume.
Tip 3 : Do not put any false things on resume. Projects, internships you are mentioning be ready to answer questions related to it regarding what you solved, idea, databases, design.
Tip 4 : Contribute in open source, participate in hackathons.
Singleton design pattern ensures a class has only one instance and provides a global point of access to it.
Ensures a class has only one instance by providing a global access point to it
Uses a private constructor to restrict instantiation of the class
Provides a static method to access the single instance
Commonly used in scenarios where only one instance of a class is needed, such as database connections or configuration...
posted on 6 Apr 2023
posted on 9 Nov 2022
I applied via Naukri.com
OOPS concepts of Java include encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation: bundling data and methods within a class
Inheritance: creating new classes from existing ones
Polymorphism: using a single interface to represent multiple classes
Abstraction: hiding implementation details and showing only necessary information
based on 2 interview experiences
based on 13 reviews
Rating in categories
Senior Software Engineer
115
salaries
| ₹9 L/yr - ₹25.1 L/yr |
Software Engineer
113
salaries
| ₹5 L/yr - ₹17.5 L/yr |
Software Developer
92
salaries
| ₹5.5 L/yr - ₹13.4 L/yr |
Lead Software Engineer
69
salaries
| ₹17 L/yr - ₹29.9 L/yr |
Senior GIS Analyst
64
salaries
| ₹4.3 L/yr - ₹6.4 L/yr |
ITC Infotech
HTC Global Services
Exela Technologies
HERE Technologies