i
HashedIn by Deloitte
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Campus Placement and was interviewed in Oct 2024. There were 2 interview rounds.
Arrays and dp questions
The maximum depth of a binary tree is the longest path from the root node to a leaf node.
The maximum depth of a binary tree can be calculated recursively by finding the maximum depth of the left and right subtrees and adding 1.
The maximum depth of an empty tree is 0.
Example: For a binary tree with root node A, left child B, and right child C, the maximum depth would be 2.
Top trending discussions
I was interviewed in Dec 2024.
It consistered of multiple section including mental ability and English
It was an easy question I was asked to write one easy dsa in anuy language
I applied via Campus Placement
Basic maths and reasoning
I applied via Campus Placement and was interviewed before Feb 2023. There were 3 interview rounds.
The first round includes 3 sections as follows:
1) Aptitude (Quantitative and Logical)
2) Coding Questions (Given two questions of Java Collection)
3) SQL Queries (Given three intermediate level queries)
posted on 5 Mar 2023
I applied via Recruitment Consulltant and was interviewed in Sep 2022. There were 3 interview rounds.
I applied via campus placement at Vellore Institute of Technology (VIT) and was interviewed before Aug 2023. There were 3 interview rounds.
Reasoning, English grammar
Get the duplicate numbers, what is api, what is XML file
Baic knowledge in number system and traditional aptitude questions can we expect
Artificial Intelligence (AI) is the current growing technology.
AI is being used in various industries such as healthcare, finance, and transportation.
Machine learning and deep learning are key components of AI.
Examples of AI applications include virtual assistants, autonomous vehicles, and fraud detection systems.
I applied via campus placement at Visvesvaraya National Institute of Technology (VNIT), Nagpur and was interviewed in Jan 2023. There were 4 interview rounds.
First round is written test which consists of Aptitude, verbal, coding question.
Yes, one try can have two catches in a try-catch block.
A try block can have multiple catch blocks to handle different types of exceptions.
The catch blocks are executed in the order they are written.
If an exception is caught in the first catch block, the subsequent catch blocks are not executed.
Example: try { //code } catch (ExceptionType1 e) { //handle exception } catch (ExceptionType2 e) { //handle exception }
I applied via Recruitment Consulltant and was interviewed in Sep 2022. There were 2 interview rounds.
Inheritance is a mechanism in OOP where a new class is derived from an existing class.
It allows the new class to inherit the properties and methods of the existing class.
Types of inheritance: Single, Multiple, Multilevel, Hierarchical, Hybrid.
Example: A class 'Car' can inherit from a class 'Vehicle' which has properties like 'speed', 'fuel type', etc.
Encapsulation is the process of hiding implementation details and restricting access to an object's data and methods.
Encapsulation helps in achieving data abstraction and security.
It allows for better control over the data and prevents accidental modification.
It also enables easy modification of implementation details without affecting the rest of the code.
For example, a class can have private variables and public meth
I applied via Campus Placement and was interviewed in Apr 2022. There were 3 interview rounds.
There was normal apti questions ( quantitative, verbal, reasoning) and codes were given in which we have to correct error and run the code, and then there was behavioural questions
based on 1 interview
Interview experience
Software Engineer
414
salaries
| ₹5 L/yr - ₹16.1 L/yr |
Software Engineer2
374
salaries
| ₹9.5 L/yr - ₹23.3 L/yr |
Senior Software Engineer
206
salaries
| ₹8 L/yr - ₹26.5 L/yr |
Software Engineer II
173
salaries
| ₹9.7 L/yr - ₹20 L/yr |
Senior Product Specialist
163
salaries
| ₹12.4 L/yr - ₹27 L/yr |
TCS
Infosys
Wipro
HCLTech