Filter interviews by
Clear (1)
I was interviewed in Nov 2020.
Round duration - 60 minutes
Round difficulty - Easy
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...
Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.
Use Dijkstra's algorithm to find the shortest path between the given vertices.
Create a graph data structure to represent the weighted, undirected graph.
Handle cases where no path exists between the given vertices by returning -1.
Optimize the algorithm to handle multiple queries efficiently.
Consider edge cases such as...
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Merge Sort is a divide-an...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively
Sort the two halves separately
Merge the sorted halves to produce a fully sorted array
Time complexity of Merge Sort is O(n log n)
Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]
You are provided with an N * N
maze where a rat is positioned at starting cell MAZE[0][0]
. The goal is to determine and print all possible paths that the rat can take to r...
Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.
Use backtracking to explore all possible paths from the starting cell to the destination cell.
At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.
Keep track of the path taken so far and mark the cells accordingly.
Once the destination cell i...
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Top trending discussions
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.
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 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
Hard test dsa question practice more leetcode
I was interviewed in Oct 2024.
Explain about DSA and its example in realtime.
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 2 reviews
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