Filter interviews by
Clear (1)
I was interviewed before May 2021.
Round duration - 60 minutes
Round difficulty - Easy
Timing - flexible 12 hours window to take the test. (9AM - 9PM)
Test was proctored
Given three integers X
, Y
, and Z
, calculate the sum of all numbers that can be formed using the digits 3, 4, and 5. Each digit can be used up to a maximum of X
, Y
, and Z
...
Calculate the sum of all numbers that can be formed using the digits 3, 4, and 5 with given constraints.
Iterate through all possible combinations of 3, 4, and 5 based on the given constraints.
Calculate the sum of each combination and add them up.
Return the final sum modulo 10^9 + 7.
Given a Weighted Directed Acyclic Graph (DAG) comprising 'N' nodes and 'E' directed edges, where nodes are numbered from 0 to N-1, and a source node 'Src'....
The task is to find the longest distances from a source node to all nodes in a weighted directed acyclic graph.
Implement a function that takes the number of nodes, edges, source node, and edge weights as input.
Use a topological sorting algorithm to traverse the graph and calculate the longest distances.
Return an array of integers where each element represents the longest distance from the source node to the correspondi
Round duration - 40 minutes
Round difficulty - Easy
Timing - 9:00 AM - 9:40 AM
You are provided with a positive integer N. Your goal is to determine the smallest number whose factorial has at least N trailing zeros.
N = 1
Find the smallest number whose factorial has at least N trailing zeros.
Calculate the number of 5's in the prime factorization of the factorial to determine the trailing zeros.
Use binary search to find the smallest number with at least N trailing zeros.
Consider edge cases like N = 0 or N = 1 for factorial trailing zeros problem.
Given a singly linked list of integers, your task is to return the head of the reversed linked list.
The given linked list is 1 -> 2 -> 3 -&g...
To reverse a singly linked list of integers, return the head of the reversed linked list.
Iterate through the linked list, reversing the pointers to point to the previous node instead of the next node.
Keep track of the previous, current, and next nodes while traversing the list.
Update the head of the reversed linked list to be the last element of the original list.
Round duration - 40 minutes
Round difficulty - Easy
Timing - 12:00 Pm to 12:40 PM
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...
Implement a priority queue using a heap data structure by completing the provided functions: push(), pop(), getMaxElement(), and isEmpty().
Understand the operations: push() to insert element, pop() to remove largest element, getMaxElement() to return largest element, and isEmpty() to check if queue is empty.
Implement a heap data structure to maintain the priority queue.
Handle different types of queries based on the inp...
Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a BST (Binary Search Tree).
The first line contains an integer 'T', represen...
The problem involves finding the size of the largest subtree that is also a Binary Search Tree in a given binary tree.
Traverse the binary tree in a bottom-up manner to check if each subtree is a BST.
Keep track of the size of the largest BST subtree encountered so far.
Use recursion to solve the problem efficiently.
Consider edge cases like empty tree or single node tree.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1
Round duration - 40 minutes
Round difficulty - Medium
Timing - 6:00 PM - 6:30 PM
Design a system similar to Splitwise and suggest three features for improvement.
Implement a real-time notification system for updates on shared expenses
Integrate a feature for automatic currency conversion for international transactions
Enhance the user interface with data visualization tools for better expense tracking
Tip 1 : For fresher role, System design is not very important.
Tip 2 : Do at least 1-2 good quality projects.
Tip 1 : Have 1-2 good engaging projects in resume.
Tip 2 : Internships are helpful.
Top trending discussions
I was interviewed before Sep 2020.
Round duration - 140 minutes
Round difficulty - Medium
Test timing was at 2:00 pm , it was conducted in a college and the environment was good for the test. Camera was a primary part of test, so no suspicious activity.
Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two numbers and return this sum as an ar...
Given two numbers represented as arrays, calculate their sum and return the result as an array.
Iterate through the arrays from right to left, adding digits and carrying over if necessary
Handle cases where one array is longer than the other by considering the remaining digits
Ensure the final sum array does not have any leading zeros
Round duration - 20 minutes
Round difficulty - Easy
The round was conducted at around 12 p.m. I was called at the college location and then it was conducted. The interviewer was quite polite and frank.
Round duration - 8 minutes
Round difficulty - Easy
This round was conducted right after finishing and clearing the technical round at the same place and on the same day.
Tip 1 : Practice atleast 2-3 Coding problems daily so your logic building becomes stronger.
Tip 2 : Exercise problems based on OOPS concepts and others too.
Tip 3 : If you can have your own project built, then it's the major point and will act as a plus point.
Tip 1 : Your resume should be in standard form, short and simple will be more effective.
Tip 2 : Whatever you have learned, you need to mention it in your resume as that will be your primary source of selection and having project on your resume is important.
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Feb 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
I was interviewed before Jun 2021.
Round duration - 180 minutes
Round difficulty - Easy
It was an mcq + coding round. There were aptitude and ouput based question in mcq. And coding questions were easy
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...
Find the duplicate number in an array of integers from 0 to (N-2).
Iterate through the array and keep track of the frequency of each number using a hashmap.
Return the number with a frequency greater than 1 as the duplicate number.
Time complexity can be optimized to O(N) using Floyd's Tortoise and Hare algorithm.
You are provided with a string S
and an array of integers A
of size M
. Your task is to perform M
operations on the string as specified by the indices in array A
...
Given a string and an array of indices, reverse substrings based on the indices to obtain the final string.
Iterate through the array of indices and reverse the substrings accordingly
Ensure the range specified by each index is non-empty
Return the final string after all operations are completed
Round duration - 60 Minutes
Round difficulty - Easy
It was technical + hr round. there were 2 people as interviewer. They stated from intro and asked some basic puzzles and hr questions. After that they asked about my projects, technologies and some ds algo and dbms questions.
Tip 1 : Practice aptitude
Tip 2 : Focus on practicing coding
Tip 3 : Learn from mistakes
Tip 1 : Mention some projects that you have done
Tip 2 : Try to have skills that are required for the role
I applied via Job Portal and was interviewed before Jan 2021. There were 3 interview rounds.
Technical Support Engineer
935
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Consultant
327
salaries
| ₹0 L/yr - ₹0 L/yr |
Member Technical Staff
270
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Member of Technical Staff
249
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Technical Consultant
229
salaries
| ₹0 L/yr - ₹0 L/yr |
SAP
Zoho
Oracle
Adobe