Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Nov 2022. There were 3 interview rounds.
Spring bean scope defines the lifecycle and visibility of a bean in the Spring container.
Singleton scope: Only one instance of the bean is created and shared across the application.
Prototype scope: A new instance of the bean is created every time it is requested.
Request scope: A new instance of the bean is created for each HTTP request.
Session scope: A new instance of the bean is created for each HTTP session.
Global se...
HashMap is a data structure that stores key-value pairs and uses hashing to provide constant time complexity for basic operations.
HashMap internally uses an array of linked lists called buckets to store the key-value pairs.
When a key-value pair is added, the hash code of the key is computed and used to determine the index of the bucket.
If multiple key-value pairs have the same hash code, they are stored as a linked lis...
The main difference is that Spring singleton is managed by the Spring container, while Java singleton is managed by the developer.
Spring singleton is created and managed by the Spring container, while Java singleton is created and managed by the developer.
Spring singleton is a design pattern used in Spring framework to create a single instance of a class, while Java singleton is a design pattern used in Java to create ...
No
Singleton is not inherently thread-safe
Multiple threads can access and modify the singleton instance simultaneously
To make it thread-safe, synchronization or double-checked locking can be used
Alternatively, an enum implementation of singleton is inherently thread-safe
I applied via Campus Placement and was interviewed in May 2024. There were 3 interview rounds.
It lasted for around 1hr 30 minutes, I have a nice developer profile, so they asked me simple DSA questions. I was asked to write the code on an online IDE and the question was given to me on google docs while the platform for the interview was gather.
The first question was a medium array question and the other one was a medium DP question.
It lasted to 2hrs, they asked to design a system related to a payment application, I had to write a working implementation for the task given. the requirements were 5 pages on google docs and I had to implement that on the online IDE. After this, I was asked a lot of Core concepts related to DBMS, OOPS, OS, Network security and Computer Networks.
I applied via LinkedIn and was interviewed in Nov 2023. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Sep 2023. There were 3 interview rounds.
Given a problem in DSA related to stack, queues, binary search, and binary tree
Nuclei interview questions for popular designations
I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.
I was asked 3 coding questions.
Top trending discussions
I was interviewed in Sep 2020.
posted on 29 Nov 2024
I applied via Approached by Company and was interviewed in Aug 2024. There were 2 interview rounds.
The interviewer asked me to build an accordion, the interview was 1 hour long
Rate limiting algorithm is used to control the rate of traffic sent or received by a system.
Rate limiting helps prevent abuse, protect against DoS attacks, and ensure fair usage of resources.
Common rate limiting algorithms include token bucket, leaky bucket, and fixed window.
Token bucket algorithm allows bursts of traffic up to a certain limit, while leaky bucket algorithm smooths out traffic over time.
Fixed window alg...
I applied via LinkedIn and was interviewed in Aug 2024. There were 3 interview rounds.
It was mostly around Frontend and JavaScript, asked basic questions on javascript. Then they gave me a problem to make form with multiple steps where every step has some form fields, handle state and validations for such form. After building the solution he asked follow up questions like what if form is dynamic.
I was interviewed in Aug 2021.
Round duration - 70 minutes
Round difficulty - Medium
There were 3 problems 1 was easy and 2 were of medium types.
Given a binary tree, the task is to compute the modulus of the difference between the sum of nodes at odd levels and the sum of nodes at even levels.
The first line...
The task is to compute the modulus of the difference between the sum of nodes at odd levels and the sum of nodes at even levels in a binary tree.
Traverse the binary tree level by level and calculate the sum of nodes at odd and even levels separately.
Find the absolute difference between the sums and return the modulus of this difference.
Handle null nodes by skipping them during the sum calculation.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges in a grid.
Create a queue to store the rotten oranges and their time of rotting.
Iterate through the grid to find all rotten oranges and add them to the queue.
Simulate the rotting process by checking adjacent cells and updating their status.
Track the time taken to rot all fresh oranges and return the result.
Handle edge cases like unreachable fresh oranges or already
Round duration - 50 minutes
Round difficulty - Medium
the interviewer was very polite and straightforward, he didn't ask me to introduce myself and he directly jumps to the coding problems.
What is new about the relationship between the and tags in HTML5?
Explain Components, Modules and Services in Angular
You have a robot currently positioned at the origin (0, 0) on a two-dimensional grid, facing the north direction. You are given a sequence of moves in the form of a string ...
Determine if a robot's movement path is circular on a 2D grid given a sequence of moves.
Iterate through the move sequence and update the robot's position based on the moves ('L' - turn left, 'R' - turn right, 'G' - move forward).
Check if the robot returns to the starting position after completing the move sequence.
If the robot ends up at the starting position and facing the north direction, the movement path is circula
Round duration - 70 minutes
Round difficulty - Easy
What is a View in sql? What are the TRUNCATE, DELETE and DROP statements?
Given a square matrix 'MATRIX' of non-negative integers, rotate the matrix by 90 degrees in an anti-clockwise direction using only constant extra space.
Rotate a square matrix by 90 degrees in an anti-clockwise direction using constant extra space.
Iterate through each layer of the matrix from outer to inner layers
Swap elements in groups of 4 to rotate the matrix
Handle odd-sized matrices by adjusting the center element if needed
Given a string STR
of length N
, determine the minimum number of characters to be added to the front of the string to make it a palindrome.
The first...
The task is to find the minimum number of characters needed to be added to the front of a string to make it a palindrome.
Iterate through the string from both ends and count the number of characters that need to be added to make it a palindrome.
Use two pointers approach to compare characters from start and end of the string.
Keep track of the count of characters needed to be added to form a palindrome.
Round duration - 20 minutes
Round difficulty - Easy
Tip 1 : Deep knowledge of the projects mentioned in your resume is a must.
Tip 2 : Practice as many problems as you can from leetcode.
Tip 1 : mention 1 or 2 projects in your resume.
Tip 2 : don't put false things in your resume.
I was interviewed before Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
It was in the evening, at around 3 - 4 PM. There were 3 coding questions. One easy, two moderate ones. The platform had autocomplete feature too.
You have an array of integers, and your task is to modify the array by moving all even numbers to the beginning while placing all odd numbers at the end. The order within ev...
Move all even numbers to the beginning and odd numbers to the end of an array.
Iterate through the array and swap even numbers to the front and odd numbers to the back.
Use two pointers, one starting from the beginning and one from the end, to achieve the desired arrangement.
Return the modified array with even numbers at the start and odd numbers at the end.
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...
Determine if two strings are anagrams of each other by checking if they have the same characters in different order.
Create a character frequency map for both strings and compare them.
Sort both strings and compare if they are equal.
Use a hash table to store character counts and check if they are the same for both strings.
You are given a binary search tree (BST) containing N nodes. Additionally, you have references to two nodes, P and Q, within this BST.
Your task is to determine the Lowest Com...
Find the Lowest Common Ancestor (LCA) of two nodes in a Binary Search Tree (BST).
Traverse the BST from the root node to find the LCA of the given nodes.
Compare the values of the nodes with the values of P and Q to determine the LCA.
If the values of P and Q are on opposite sides of the current node, then the current node is the LCA.
Round duration - 50 Minutes
Round difficulty - Medium
They asked 2 coding questions and 2 sql queries in this round
Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.
If there are multiple longest palin...
Find the longest palindromic substring in a given string, returning the rightmost one if multiple exist.
Iterate through each character in the string and expand around it to find palindromes
Keep track of the longest palindrome found and its starting index
Return the substring starting from the index of the longest palindrome found
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
A nested SQL query is a query within another query, used to retrieve data from multiple tables in a single query.
Nested queries are enclosed within parentheses and can be used in SELECT, INSERT, UPDATE, or DELETE statements.
They are commonly used to perform subqueries to filter results based on the output of the inner query.
Example: SELECT * FROM table1 WHERE column1 IN (SELECT column2 FROM table2 WHERE condition);
Round duration - 50 Minutes
Round difficulty - Medium
This round was about OS, networking and my projects. What are the different ways to style a React component?
Name a few techniques to optimize React app performance.
Round duration - 30 Minutes
Round difficulty - Easy
It was a fun round, in which they ask about your preferences about programming languages, technologies or your hobbies. If you reach this round, it means that your chances of selection are 99%.
Tip 1 : If weak in coding, enroll for Coding Ninjas eminence course
Tip 2 : Practice everyday, atleast 2- 3 questions
Tip 3 : Participate in weekly coding contests on leetcode
Tip 1 : Keep in One page
Tip 2 : Don't mention your hobbies, recruiters are not interested in them and moreover hobbies take up space
Tip 3 : Have some unique projects on your resume. The projects should be self made, not from code-along sessions from youtube.
based on 6 interviews
Interview experience
Product Manager
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Product Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
IOS Developer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Razorpay
Paytm
PhonePe
Mobikwik