Filter interviews by
You are given an array/list of integers with length 'N'. A sliding window of size 'K' moves from the start to the end of the array. For each of the 'N'-'K'+1 possib...
Sliding window maximum problem where we find maximum element in each window of size K.
Use a deque to store indices of elements in decreasing order within the window.
Pop elements from the deque that are out of the current window.
Append the maximum element from the front of the deque to the result for each window.
Given an array of distinct positive integers ARR
and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be ch...
Find all unique combinations in an array where the sum is equal to a given target sum, with elements in non-decreasing order.
Use backtracking to generate all possible combinations of elements in the array that sum up to the target sum.
Sort the array to ensure elements in each combination are in non-decreasing order.
Handle duplicate elements in the array to avoid duplicate combinations.
Consider edge cases like empt...
You are provided with a string S
of length N
, consisting of lowercase English alphabet letters, and a positive integer K
.
Your task is to determine the maximum...
Find the longest substring with at most K distinct characters in a given string.
Use a sliding window approach to keep track of the characters and their counts in the substring.
Maintain a hashmap to store the characters and their frequencies.
Update the window size and characters count as you iterate through the string.
Return the maximum length of the substring with at most K distinct characters.
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determin...
Detect if an undirected graph contains a cycle.
Use depth-first search (DFS) to detect cycles in the graph.
Maintain a visited array to keep track of visited vertices.
If a visited vertex is encountered again during DFS, a cycle exists.
Consider disconnected graphs as well.
Example: For input N=3, Edges=[[1, 2], [2, 3], [1, 3]], output is Yes.
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
A Binary Search Tre...
Validate if a given binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Recursively check if both the left and right subtrees are also binary search trees.
Example: For each node, validate if its left child is less than the node and ...
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is ...
Given constraints and rules, find maximum vaccines administered on a specific day during a vaccination drive.
Iterate through each test case and calculate the maximum number of vaccines distributed on the specified day.
Distribute vaccines evenly across days while maximizing the number on the specified day.
Ensure that the sum of vaccines administered does not exceed the maximum allowed.
Consider edge cases like when ...
I appeared for an interview in Jan 2021.
Round duration - 75 Minutes
Round difficulty - Medium
This round was with SDE-1
After my introduction , he asked me 3 Questions
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
A Binary Search Tr...
Validate if a given binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Recursively check if both the left and right subtrees are also binary search trees.
Example: For each node, validate if its left child is less than the node and right...
You are provided with a string S
of length N
, consisting of lowercase English alphabet letters, and a positive integer K
.
Your task is to determine the maximu...
Find the longest substring with at most K distinct characters in a given string.
Use a sliding window approach to keep track of the characters and their counts in the substring.
Maintain a hashmap to store the characters and their frequencies.
Update the window size and characters count as you iterate through the string.
Return the maximum length of the substring with at most K distinct characters.
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...
Detect if an undirected graph contains a cycle.
Use depth-first search (DFS) to detect cycles in the graph.
Maintain a visited array to keep track of visited vertices.
If a visited vertex is encountered again during DFS, a cycle exists.
Consider disconnected graphs as well.
Example: For input N=3, Edges=[[1, 2], [2, 3], [1, 3]], output is Yes.
Round duration - 90 Miinutes
Round difficulty - Medium
This round was with a Senior Data Engineer as this position was a mix of Backend and Big Data.
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...
Given constraints and rules, find maximum vaccines administered on a specific day during a vaccination drive.
Iterate through each test case and calculate the maximum number of vaccines distributed on the specified day.
Distribute vaccines evenly across days while maximizing the number on the specified day.
Ensure that the sum of vaccines administered does not exceed the maximum allowed.
Consider edge cases like when the n...
Given an array of distinct positive integers ARR
and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c...
Find all unique combinations in an array where the sum is equal to a given target sum, with elements in non-decreasing order.
Use backtracking to generate all possible combinations of elements in the array that sum up to the target sum.
Sort the array to ensure elements in each combination are in non-decreasing order.
Handle duplicate elements in the array to avoid duplicate combinations.
Consider edge cases like empty arr...
Round duration - 75 Minutes
Round difficulty - Easy
This round was taken by Engineering Manager
There were 2 sections to this round
Technical and Non Techincal
You are given an array/list of integers with length 'N'. A sliding window of size 'K' moves from the start to the end of the array. For each of the 'N'-'K'+1 possi...
Sliding window maximum problem where we find maximum element in each window of size K.
Use a deque to store indices of elements in decreasing order within the window.
Pop elements from the deque that are out of the current window.
Append the maximum element from the front of the deque to the result for each window.
Tip 1 : Be solid with the basics of Ds, Algo. Good to have end to end projects which are hosted on cloud.
Tip 2 : Its always good to be presentable and have good communications skills
Tip 3 : Be honest, clear in approach and always walkthrough your thought process to the interviewer
Tip 1 : Mention your projects and experience at the top. Be clear on what was done, a brief on how it was done, language /tech stack involved. If possible try to host and make it accessible. You never know if you can present it with just one click.
Tip 2 : Choose a balance between, white spaces and text, it should be well indented, no grammatical errors.
Tip 3 : It takes less than 2 min to scan a resume. Don't mention things which are irrelevant.
Top trending discussions
I appeared for an interview in Dec 2020.
Round duration - 40 minutes
Round difficulty - Easy
Given an integer array ARR
of size N
, your task is to find the total number of subsequences in which all elements are equal.
A subsequence of an array i...
Count the total number of subsequences in which all elements are equal in an integer array.
Iterate through the array and count the frequency of each element.
Calculate the total number of subsequences for each element using the formula (frequency * (frequency + 1) / 2).
Sum up the total number of subsequences for all elements and return the result modulo 10^9 + 7.
Tip 1 : Do practice as much as you can
Tip 2 : Coding is key to crack
Tip 1 : It should look nice
Tip 2 : Skills should be mentioned properly
I applied via Campus Placement and was interviewed in Oct 2021. There was 1 interview round.
Software configuration management is the process of tracking and controlling changes made to software throughout its lifecycle.
It involves version control, build management, and release management.
It ensures that changes are made in a controlled and systematic manner.
Examples include Git, SVN, and Jenkins.
It helps to maintain the integrity and quality of the software.
It is essential for collaboration among team members...
Software requirements are the functional and non-functional specifications that a software system must meet.
Software requirements define what the software should do and how it should behave
They include functional requirements (what the software should do) and non-functional requirements (how well it should do it)
Requirements are typically documented in a requirements specification document
They are used to guide the dev...
I appeared for an interview in Nov 2020.
Round duration - 2 hours
Round difficulty - Medium
In the 1st round
Aptitude
Reasoning
English
Automata fix( code debug)
Timing in morning
Environment is good
Interviewer was very cool and interactive
Given a text message, your task is to return the Run-length Encoding of the given message.
Run-length encoding is a fast and simple method of encoding strings, repres...
Implement a function to encode a text message using run-length encoding.
Iterate through the message and count consecutive characters
Append the character and its count to the encoded message
Handle edge cases like single characters or empty message
Round duration - 30 minutes
Round difficulty - Medium
This is interview round
Ques from basic electronics
C language
Create a class named Person
with a string variable 'name'
and an integer variable 'age'
, such that these variables are not accessible outside the class. Implement a me...
Create a class Person with private variables name and age, and methods to set and get their values.
Create a class Person with private variables 'name' and 'age'.
Implement a method setValue to set the variables' values.
Implement a method getValue to print the variables' values.
Ensure the name is a non-empty string and the age is a non-negative integer.
Encapsulate the data and provide a clear interface for setting and ge...
Tip 1 : Do aptitude from indiabix. Go through your basics. At least one language u know. Learn about your branch basics. Know concept of data structure and oops.
Tip 2 : prepare your final project well.
Tip 1 : the skills you know very well mention in resume
Tip 2 : mention project in resume
HTML
Aptitude and resume shortlist and HTML
based on 1 review
Rating in categories
Product Marketing Manager
7
salaries
| ₹15 L/yr - ₹17 L/yr |
Associate Product Manager
6
salaries
| ₹17 L/yr - ₹19 L/yr |
Data Analyst
6
salaries
| ₹4.6 L/yr - ₹7.6 L/yr |
Associate Software Engineer
5
salaries
| ₹8 L/yr - ₹9 L/yr |
Senior Software Engineer
5
salaries
| ₹15 L/yr - ₹42.5 L/yr |
TCS
Accenture
Wipro
Cognizant