i
BYJU'S
Filter interviews by
I applied via Campus Placement and was interviewed before Oct 2023. There were 2 interview rounds.
General Aptitude Test for college freshers
I would implement more practical, hands-on learning experiences in addition to traditional classroom instruction.
Introduce more project-based learning opportunities to help students apply theoretical knowledge in real-world scenarios
Offer more internships, apprenticeships, and co-op programs to give students practical work experience
Provide more opportunities for students to collaborate with industry professionals on r...
I was interviewed in Dec 2020.
Round duration - 135 minutes
Round difficulty - Easy
There was no sectional time limit for the coding questions.The test was online with audio and video both on for continuous monitoring.
Find the N-th term of a Geometric Progression (GP) series given the first term A, the common ratio R, and the term position N.
The general form of a GP se...
Calculate the N-th term of a Geometric Progression series given the first term, common ratio, and term position.
Use the formula A * R^(N-1) to find the N-th term of the GP series.
Remember to return the result modulo 10^9 + 7 as the term can be very large.
Handle multiple test cases efficiently by iterating through each case.
For a given M x N sized 2D array 'MATRIX', find and return the value of (i * i + j * j) for elements where the sum of the cubes of its digits equals the element itself. Her...
Find and return the value of (i * i + j * j) for elements in a 2D array where the sum of the cubes of its digits equals the element itself.
Iterate through the 2D array and check if the sum of the cubes of digits equals the element itself.
Calculate (i * i + j * j) for elements that satisfy the condition.
Return the calculated values as a new 2D array.
If no element satisfies the condition, return -1.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer was very calm and listened very carefully to the solutions. There was a lot of discussion on my projects and the interviewer seems to be very interested in knowing about the workflows of my projects.They also give me some coding questions which were related to problem solving also.
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
Calculate the number of distinct subsequences in a string with possible duplicates.
Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.
Consider the cases where the current character is included or excluded in the subsequence.
Handle duplicates by using a hashmap to store the last occurrence index of each character.
Modulo the final count by 10^9 + 7 to avoid overfl
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
Remove the Kth node from the end of a singly linked list given the position from the end to be removed.
Traverse the list to find the length 'N' of the linked list.
Calculate the position from the beginning to be removed as 'N - K + 1'.
Delete the node at the calculated position from the beginning.
Identify and output the common strings present in both given arrays of lowercase alphabets for each test case.
The first line contains an integer 'T' representin...
The task is to find common strings in two arrays of lowercase alphabets for each test case.
Iterate through the elements of the second array and check if they are present in the first array.
Use a hash set to store the strings of the first array for efficient lookup.
Return the common strings in the order they appear in the second array.
Tip 1 : If you have time for your interviews, I would recommend going through Leetcode as it has a good variety of questions sorted on topic wise difficulty level where you can try to solve at least 20-30 questions for each data structure and algorithm. Moreover, you should regularly participate in the weekly contests happening there so that you could know about your weak areas to improve.
Tip 2 : Practice DSA everyday and make sure that you are giving timed mock tests periodically.
Tip 3 : Keep revising your Computer Science fundamentals(OS, DBMS, Software Engineering principles).
Tip 4 : Also brush-up your aptitude skills.
Tip 1 : The most important tip is that never lie on your resume and like If you have worked upon some technology for the project part only and don't know the proper depth you could write basics only in your resume.
Tip 2 : Customize your resume for a company based on their Job Description (highlight necessary skills)
Tip 3 : Include only those points about which you're fully confident. Sometimes including too much increases expectations and then the bar is set high for you which impacts the assessment
Tip 4 : Don't put anything in resume that you are not sure of.
Tip 5 : if you don't have any internship experience then you can show your good technical projects and certifications too.
I was interviewed in Jan 2021.
Round duration - 70 minutes
Round difficulty - Easy
We're provided with 60 minutes.
We're provided with desktop as it was online test.
Determine if a given year, represented as an integer 'N', is a leap year.
A leap year is defined as a year with 366 days, unlike a normal year which has 365 days.
The initial i...
The task is to determine if a given year is a leap year or not.
Check if the year is divisible by 4, if yes then proceed to next step
If the year is divisible by 100, then it should also be divisible by 400 to be a leap year
If the year satisfies both conditions, output 'Yes', else output 'No'
Round duration - 25 minutes
Round difficulty - Easy
They basically ask questions related to operating system
Round duration - 15 minutes
Round difficulty - Easy
There were 2 interviewers who talked to me and ask different questions regarding my company, my experience in college etc.
It was kind of chit chat but basically they were testing my conversation skills.
Tip 1 : Try to give mock interview as much as you can
Tip 2 : Good with technical skills
Tip 1 : Mention good projects
Tip 2 : Any internship will be add-on
I was interviewed before Sep 2020.
Round duration - 120 minutes
Round difficulty - Easy
It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium level. Time was enough and no sectional time was present. 1-2 MCQs on SQL were also present.
This round was immediately followed by an SHL aptitude test which was basically a quick limited time check of your verbal ability and math because many questions were to be done in 1 hour.
Given a 2-dimensional boolean matrix mat
of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...
Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.
Iterate through the matrix and mark rows and columns to be modified
Use additional arrays to keep track of rows and columns to be modified
Update the matrix in-place based on the marked rows and columns
Round duration - 60 minutes
Round difficulty - Easy
It was an online video interview round on HackerEarth with simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class which required inheritance was asked by the interviewer to write. I was helped by the interviewer if i got stuck somewhere, Some questions on implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.
Tip 1 : Never give up
Tip 2 : When u start a topic, don't move on to next topic before you are 100% confident in previous topic
Tip 3 : Try to give maximum time on basics of a topic especially OOPS
Tip 4 - Practice Atleast 250 Questions
Tip 5 - Ex- Do atleast 2 projects
Tip 1 : Write only those things in resume in which you are 100% confident
Tip 2 : Write maximum projects you have and be ready to explain them thoroughly
Tip 3 : Don't make any silly spelling mistakes on resume
SDLC lifecycle involves planning, designing, developing, testing, deploying, and maintaining software components and architecture.
SDLC (Software Development Life Cycle) includes phases like planning, designing, coding, testing, and maintenance.
Components are designed, developed, tested, and integrated into the overall architecture.
Architecture involves defining the structure, behavior, and interactions of software comp...
I was interviewed before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
It was an coding round
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
Iterate through the buildings and create a list of critical points (x, y) where the height changes.
Sort the critical points based on x-coordinate and process them to form the skyline.
Merge consecutive horizontal segments of equal height into one to ensure no duplicates.
Return the fin...
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Recursively try moving in all directions (up, down, left, right) until reaching the destination.
Return a list of strings representing valid paths sorted in alphabetical order.
Round duration - 30 Minutes
Round difficulty - Easy
It was an HR round with some general questions. it was just for formality.
Tip 1 : Stay focused
Tip 2 : Practice coding questions.
Tip 3 : View previous interviews of the companies
Tip 1 : Don't lie on resume
Tip 2 : Just write in format that is catchy
I applied via Naukri.com and was interviewed in Jan 2023. There were 3 interview rounds.
Aptitude test was first round. it was hard level
Program on string, oops , exception handling
I applied via Job Fair and was interviewed before Nov 2023. There were 3 interview rounds.
3 coding question around prime number arrays and strings
I applied via LinkedIn and was interviewed in Feb 2023. There were 6 interview rounds.
I applied via Naukri.com and was interviewed before Aug 2023. There was 1 interview round.
Android lifecycle refers to the series of states that an activity or fragment goes through from creation to destruction.
Android lifecycle includes states like onCreate, onStart, onResume, onPause, onStop, onDestroy, etc.
Activities and fragments transition between these states based on user interactions and system events.
Understanding Android lifecycle is crucial for managing resources, saving state, and handling config...
Fragment lifecycle refers to the series of events that occur in the lifespan of a fragment in an Android app.
Fragments go through various states like created, started, resumed, paused, stopped, and destroyed.
Fragment lifecycle methods include onCreate(), onCreateView(), onResume(), onPause(), onStop(), onDestroy(), etc.
Fragment lifecycle is closely tied to the hosting activity's lifecycle.
Understanding fragment lifecyc...
based on 1 interview
Interview experience
Business Development Associate
11.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Manager
3.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Executive
3.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Business Development Associate
3k
salaries
| ₹0 L/yr - ₹0 L/yr |
BDA
2.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Unacademy
Vedantu
Toppr
Whitehat jr