Filter interviews by
Good test it was difficult also
2 coding questions asked difficultly level hard
Top trending discussions
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
Linked list and trees
ArrayList is a dynamic array in Java that can grow or shrink in size as needed.
ArrayList is a class in Java that implements the List interface.
It allows for dynamic resizing of the array, unlike regular arrays.
Elements can be added, removed, or accessed by index.
Example: ArrayList
Object-oriented programming concepts focus on creating objects that interact with each other to accomplish tasks.
Encapsulation: Bundling data and methods that operate on the data into a single unit (object)
Inheritance: Allowing a class to inherit properties and behavior from another class
Polymorphism: Objects of different classes can be treated as objects of a common superclass
Abstraction: Hiding complex implementation
I have written a project code for a web application that tracks user activity and generates reports.
Used HTML, CSS, and JavaScript for front-end development
Utilized PHP and MySQL for back-end development
Implemented user authentication and data visualization features
I applied via LinkedIn and was interviewed in Jul 2024. There were 4 interview rounds.
Aptitude test is to easy
Coding test easy too good
I was interviewed in Apr 2022.
Round duration - 180 minutes
Round difficulty - Hard
There was 1 round of 180 minutes which contains of 3 questions from DSA. the two question was of medium level but one question is of neither difficult nor medium level question based on tree
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to keep track of the longest increasing subsequence ending at each element.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the ar...
Check whether a given graph is bipartite or not. Return true
if the graph's vertices can be divided into two independent sets, ‘U’ and ‘V’, such that every edge (‘u’, ‘v’) either c...
Check if a given graph is bipartite by dividing vertices into two independent sets.
Use BFS or DFS to traverse the graph and assign colors to vertices to check for bipartiteness.
If an edge connects vertices of the same color, the graph is not bipartite.
Return true if all edges connect vertices of different colors, else return false.
Given an integer array ARR
of size N
containing all distinct values, determine the total number of inversions present in the array.
An inversion is defined for a pair o...
Count the total number of inversions in an integer array.
Iterate through the array and for each pair of elements, check if the conditions for inversion are met.
Use a nested loop to compare each element with all elements to its right.
Keep a count of the inversions found and return the total count at the end.
Round duration - 50 minutes
Round difficulty - Medium
In interview I was asked about some question related to Data structures , DBMS . Some output based question was asked and 2 coding problems was given to solve.
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
A subset of an array 'ARR' is a tupl...
Given an array and an integer, return all subsets that sum to the given integer.
Use backtracking to generate all possible subsets of the array.
For each subset, check if the sum equals the given integer 'K'.
Print the subsets that satisfy the condition.
Example: For input [1, 2, 3] and K=3, subsets [1, 2] and [3] have sum 3.
Given a binary tree of integers, your task is to print the boundary nodes of the binary tree in an anti-clockwise direction starting from the root node.
The boundary...
Boundary traversal of a binary tree in anti-clockwise direction starting from the root node.
Implement a function to calculate the boundary traversal of a binary tree
Include nodes from left boundary, leaf nodes, and right boundary in sequence
Ensure only unique nodes are included in the output
Print the boundary nodes separated by single spaces for each test case
Tip 1 - Practice At least 250 Questions of DS algo
Tip 2 - Do at least 2 application based projects
Tip 3 - Practice questions with optimized approaches
Tip 1 : Have some application based projects on resume.
Tip 2 : Do not put false things on resume.
Tip 3 : Project should clear and crisp
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
Learn about techstack
Easy interview which mainly focus on concepts
I applied via Naukri.com and was interviewed before Jun 2023. There were 2 interview rounds.
Good - 20 min, basics
based on 1 interview
Interview experience
based on 8 reviews
Rating in categories
Software Developer
582
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
551
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
472
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
432
salaries
| ₹0 L/yr - ₹0 L/yr |
Deputy Manager
366
salaries
| ₹0 L/yr - ₹0 L/yr |
Jio
Reliance Industries
Bharti Airtel
Vodafone Idea