Filter interviews by
Clear (1)
I was interviewed in Feb 2021.
Round duration - 70 Minutes
Round difficulty - Medium
Timing was 9:15AM. Platform was not very good. Questions were not well explained.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
Merge overlapping intervals and return sorted list of merged intervals.
Identify overlapping intervals based on start and end times
Merge overlapping intervals to form new intervals
Sort the merged intervals in ascending order of start times
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 to reach its destination, given a matrix representation of the maze.
Use backtracking to explore all possible paths from the starting position to the destination.
Keep track of the current path and explore all possible directions at each step.
Terminate the exploration when reaching the destination or hitting a blocked cell.
Return the list of valid paths found, sorted in alphabe
Given a string STR
consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographically increasing order.
Return all permutations of a given string in lexicographically increasing order.
Generate all permutations of the given string using backtracking algorithm.
Sort the permutations lexicographically before printing them.
Ensure the string contains unique characters for correct output.
Handle multiple test cases efficiently.
Example: For input 'bca', output 'abc acb bac bca cab cba'.
Tip 1 : Prepare maximum algorithms.
Tip 2 : Deep knowledge of data structure.
Tip 3 : OOPS is must.
Tip 1 : Keep it short.
Tip 2 : Mention only your own projects.
I was interviewed in Feb 2021.
Round duration - 70 minutes
Round difficulty - Medium
Timing was 9:15AM. Platform was not very good. Questions were not well explained.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
Merge overlapping intervals and return sorted list of merged intervals.
Identify overlapping intervals based on start and end times
Merge overlapping intervals to form new intervals
Sort the merged intervals in ascending order of start times
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 the valid paths as a list of strings sorted in alphabetical order.
Tip 1 : Prepare maximum algorithms.
Tip 2 : Deep knowledge of data structure.
Tip 3 : OOPS is must.
Tip 1 : Keep it short.
Tip 2 : Mention only your own projects.
I was interviewed in Dec 2020.
Round duration - 120 minutes
Round difficulty - Easy
Given an array of integers ARR
of length N
and an integer Target
, your task is to return all pairs of elements such that they add up to the Target
.
The first line ...
Given an array of integers and a target, find all pairs of elements that add up to the target.
Iterate through the array and for each element, check if the target minus the element exists in a hash set.
If it exists, add the pair to the result. If not, add the element to the hash set.
Handle cases where the same element is used twice in a pair.
Return (-1, -1) if no pair is found.
Tip 1 : Have projects on your resume.
Tip 2 : Good to have internships
Tip 3 : Practice a lot
Tip 1 : Have good projects
Tip 2 : Have knowledge of everything you wrote
Top trending discussions
I applied via Job lever and was interviewed before Sep 2021. There were 2 interview rounds.
Easy leetcode code 2 questions , HTML5 css javascript simple screen design
I applied via LinkedIn and was interviewed before May 2021. There were 2 interview rounds.
var, let, and const are all used to declare variables in JavaScript, but they have different scoping rules and behaviors.
var has function scope and can be redeclared and reassigned
let has block scope and can be reassigned but not redeclared
const has block scope and cannot be reassigned or redeclared
Use const for values that won't change, let for values that will, and avoid var
CSS box model defines the layout of elements on a webpage. Padding and margin can apply to block-level elements but not to inline elements.
CSS box model consists of content, padding, border, and margin around an element.
Padding adds space inside the border of an element.
Margin adds space outside the border of an element.
Padding and margin can apply to block-level elements like <div> but not to inline elements lik
Arrow functions are shorter syntax for writing function expressions.
Arrow functions do not have their own 'this' keyword.
Arrow functions cannot be used as constructors.
Arrow functions do not have the 'arguments' object.
Arrow functions are more concise and easier to read.
Regular functions are better for methods and constructors.
JavaScript asynchronous model allows non-blocking code execution by using callbacks and promises.
JavaScript uses an event loop to handle asynchronous operations.
Callbacks are functions passed as arguments to other functions and executed when the operation is complete.
Promises are objects that represent the eventual completion or failure of an asynchronous operation.
Async/await is a newer syntax that allows writing asyn...
I was interviewed in Aug 2022.
2 hrs duration with 2 easy level dsa questions and 15 around mcqs based on core cs concepts.
Implementing stack using linked list
Create a Node class with data and next pointer
Create a Stack class with top pointer
Implement push() method to add element to top of stack
Implement pop() method to remove element from top of stack
Implement peek() method to return top element without removing it
Find the first duplicate value in an array of strings.
Create a hash table to store the frequency of each string.
Iterate through the array and check if the string already exists in the hash table.
If it does, return the string. If not, add it to the hash table.
If no duplicates are found, return null or an appropriate message.
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 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 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
based on 1 review
Rating in categories
Business Development Associate
262
salaries
| ₹0 L/yr - ₹0 L/yr |
Marketing Associate
150
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Executive
147
salaries
| ₹0 L/yr - ₹0 L/yr |
Online Tutor
73
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Manager
58
salaries
| ₹0 L/yr - ₹0 L/yr |
BYJU'S
Vedantu
Toppr
Unacademy