Filter interviews by
It was a link from hackerEarth, only aptitude question were there
Got 1 hr to complete 2 coding questions on the complier provided by them.
I applied via Referral and was interviewed in Jul 2021. There were 2 interview rounds.
Indexing in MySQL is a technique to improve the performance of database queries by creating a data structure that allows for faster data retrieval.
Indexes are created on one or more columns of a table.
They help in speeding up the search, sorting, and joining of data.
Indexes can be created using different algorithms like B-tree, hash, or bitmap.
Using indexes appropriately can significantly enhance query performance.
Exam...
Object-oriented programming concepts in PHP
Encapsulation: bundling data and methods together in a class
Inheritance: creating new classes based on existing ones
Polymorphism: using a single interface to represent different types
Abstraction: hiding unnecessary details and exposing only essential features
Class: blueprint for creating objects
Object: instance of a class
Method: function defined inside a class
Property: variabl
posted on 10 Mar 2024
I applied via Campus Placement and was interviewed before Mar 2023. There was 1 interview round.
posted on 28 Aug 2023
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
Held on interview bit. 3 ques were asked. Questions were from range query and DP.
I applied via Campus Placement and was interviewed in Aug 2023. There was 1 interview round.
A process is an instance of a program while a thread is a subset of a process that can run concurrently with other threads.
Processes have their own memory space while threads share the same memory space within a process.
Processes are independent of each other while threads within the same process can communicate with each other.
Processes are heavier in terms of resource consumption compared to threads.
Example: A web br...
I appeared for an interview before Oct 2023.
It was based on frontend technologies
posted on 19 Feb 2024
I applied via Campus Placement and was interviewed in Aug 2023. There were 4 interview rounds.
It will be around 3 hours and 2 questions of leetcode hard difficulty will be asked in the interview and 1 question is of codeforces 2400+ difficulty question.
posted on 16 Sep 2021
I appeared for an interview in Dec 2020.
Round duration - 75 minutes
Round difficulty - Easy
This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.
1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes
This Round was Conducted on Hackerrank (Webcam Enabled).
To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.
Understand the problem statement and expected output
Review the code for syntax errors, logical errors, and potential bugs
Use debugging tools like breakpoints, print statements, and IDE debuggers
Test the code with different inputs and edge cases to identify the bug
Make necessary corrections and re
Given a Binary Tree of distinct integers and two integers, target
and K
, return a list of values of all nodes located at a distance K
from the target no...
Find nodes at distance K from target node in a Binary Tree.
Use BFS to traverse the tree and keep track of the distance of each node from the target node.
Maintain a set to keep track of visited nodes to avoid revisiting them.
Return the values of nodes at distance K from the target node.
Round duration - 90 minutes
Round difficulty - Medium
I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input beg...
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
Iterate through the array and maintain a count of 0s and 1s encountered so far.
Store the count difference in a hashmap with the index as key.
If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.
Return the length of the longest subarray found.
Round duration - 45 minutes
Round difficulty - Easy
The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.
Tip 1 : Practice daily 4-5 medium level problems on sites like Leetcode, CodeZen, Hackerearth
Tip 2 : Even though Data Structures and Algorithms is the base but study Course Subjects like DBMS,OS,OOPS too.
Tip 3 : Try to Participate in Contests on LeetCode,Codeforces.
Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Associate Manager
238
salaries
| ₹6 L/yr - ₹16 L/yr |
Business Manager
149
salaries
| ₹6.8 L/yr - ₹18 L/yr |
Senior Associate
137
salaries
| ₹7.8 L/yr - ₹26 L/yr |
Analyst
118
salaries
| ₹3.2 L/yr - ₹9 L/yr |
Associate
110
salaries
| ₹3.2 L/yr - ₹12.3 L/yr |
R.R. Donnelley
Epsilon
Smollan Group
ChannelPlay