i
Classplus
Filter interviews by
Clear (1)
I applied via Recruitment Consulltant and was interviewed in Apr 2024. There was 1 interview round.
Props in ReactJS are used to pass data from parent to child components.
Props are read-only and cannot be modified by the child component.
Props can be any type of data, including strings, numbers, arrays, objects, functions, etc.
Props are passed down the component tree from parent to child using the syntax
Optimize code, minimize network requests, use lazy loading, implement caching
Optimize code by removing unnecessary code, using efficient algorithms, and reducing render times
Minimize network requests by combining multiple requests, using server-side rendering, and implementing data caching
Use lazy loading to only load resources when needed, improving initial load times
Implement caching for frequently accessed data to r
Top trending discussions
I was interviewed in Dec 2017.
To find the maximum water pond formed between buildings.
Identify the lowest point between the buildings.
Calculate the area of the pond using the distance between the buildings and the depth of the pond.
Consider any obstacles or uneven ground that may affect the pond's shape.
Use a surveying tool or satellite imagery to get accurate measurements.
Take into account any drainage systems or natural water flow that may affect
Design a dictionary using trie with insert, update and delete operations.
Implement a Trie data structure with nodes containing a character and a boolean flag to indicate end of word
For insert operation, traverse the trie and add nodes for each character in the word
For update operation, delete the existing word and insert the updated word
For delete operation, mark the end of word flag as false and delete the node if it ...
Find the odd repeating element from an array of strings
Use a hash table to count the frequency of each element
Iterate through the hash table to find the element with an odd count
Finding an element in a sorted 2D matrix
Start from the top right corner or bottom left corner
Compare the target element with the current element
Move left or down if the target is smaller, else move right or up
Repeat until the target is found or all elements are checked
SQL query to find Nth highest salary from table
Use ORDER BY and LIMIT clauses
Use subquery to get the Nth highest salary
Handle cases where there are less than N distinct salaries
Function to swap '3' and '4' without using if-else
Use XOR operator to swap the values
Convert the input to ASCII code and perform the swap
Use a lookup table to map the values
I am a software developer with experience in Java and Python.
Proficient in Java and Python programming languages
Experience in developing web applications using Spring framework
Familiarity with database management systems like MySQL and MongoDB
PAYTM is a leading digital payment platform in India with a wide range of services.
PAYTM has a user-friendly interface and offers a seamless payment experience.
It provides a variety of services like mobile recharges, bill payments, and online shopping.
PAYTM has a strong focus on security and fraud prevention measures.
It has a large user base and is widely accepted by merchants across India.
PAYTM is constantly innovatin...
Yes, I am open to pursuing further studies in the future.
I believe in continuous learning and staying updated with the latest technologies.
Further studies can help me specialize in a particular field and enhance my skills.
I may consider pursuing a master's degree in computer science or a related field.
However, my immediate focus is on gaining practical experience and contributing to the organization.
PAYTM grew fast due to its innovative approach and early adoption of digital payments.
Early adoption of digital payments in India
Innovative approach with features like mobile recharges, bill payments, and cashback offers
Expansion into e-commerce and financial services
Strategic partnerships with major companies like Uber and Alibaba
DS/ALGO and problem-solving was asked in round one
I was interviewed in Jan 2021.
Round duration - 60 Minutes
Round difficulty - Easy
4 Questions which were of Easy, Medium, and Hard level.
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
You are provided with two nodes,...
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.
Compare the two lists and find the last common node.
Return the last common node as the lowest common ancestor.
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...
The problem is to find a subarray with the maximum sum in a given array.
Iterate through the array and keep track of the maximum sum and the current sum.
If the current sum becomes negative, reset it to 0.
Update the maximum sum if the current sum is greater.
Also keep track of the start and end indices of the subarray with the maximum sum.
Return the subarray using the start and end indices.
Round duration - 50 Minutes
Round difficulty - Easy
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
The task is to find the next greater element for each element in an array.
Iterate through the array from right to left.
Use a stack to keep track of the elements that have a greater element to their right.
For each element, pop elements from the stack until a greater element is found or the stack is empty.
If a greater element is found, it is the next greater element for the current element.
If the stack becomes empty, the...
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.
Sum up the amount of water trapped at each bar to get the total amo
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality round, asked basic questions like relocation and joining date etc
Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well
Tip 3 : focus on basics
Tip 1 : Try to make a single-page resume.
Tip 2 : Don't write unnecessary details like hobbies, family, etc.
I was interviewed before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
I was interviewed in Mar 2022.
Round duration - 120 Minutes
Round difficulty - Medium
Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach
Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question
Round duration - 60 Minutes
Round difficulty - Medium
2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...
The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.
Use dynamic programming to solve the problem efficiently.
The number of structurally unique BSTs can be calculated using Catalan numbers.
For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.
Example: For N=3, the number of structurally unique BSTs is 5.
You are provided with a string 'STR'
that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...
Generate all possible subsequences of a given string.
Use recursion to generate all possible subsequences by including or excluding each character in the string.
Maintain a current index to keep track of the characters being considered.
Append the current character to each subsequence generated so far.
Recursively call the function with the next index to include or exclude the next character.
Base case: When the current ind...
Round duration - 60 Minutes
Round difficulty - Easy
HIRING MANAGER ROUND
Discussion about the organisation now questions
Tip 1 : Practice is they to success, every person will need a different path for preparation, the resources that you should use will depend upon your current expertise.
Tip 2 : For Machine Coding Rounds speed is key, you need to practice atleast 20 questions, Try to figure out techniques to common out code, code out your first question, and then spend good 2-3 hours in reducing no of lines and removing redundancy, try to note down methods you used to achieve less redundancy and for all the next questions you practice try to achieve that same quality from the beginning which will automatically increase your speed
Tip 3 : Do company wise preparation, look for interview experiences and try to map out commonly asked questions and categories of those questions and practice accordingly
Tip 1 : If applying for any non FE role (or any role that does not require designing or creative skills) keep a minimalistic resume
Tip 2 : Ensure to add a summary at the top which mentions all the criterias HRs consider while short listing resumes (Experience, Degree and Branch, Languages you have experience in, City, Willingness to Relocate, Notice Period, If already on notice period mention your last working day)
I was interviewed before May 2021.
Round duration - 90 Minutes
Round difficulty - Medium
1 easy and 2 medium-hard DSA problems to solve
Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).
Given the total number ...
Given the total number of hurdles Kevin has jumped, determine how many levels he has cleared.
Iterate through levels while subtracting hurdles from total jumped until remaining hurdles are less than current level
Return the current level as the number of levels cleared
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate valid configurations recursively and backtrack when a solution is not possible.
Bob is given a triangular pyramid with vertices 'O', 'X', 'Y', and 'Z'. He is also provided with an integer 'N'. Bob can move to any adjacent vertex in a single ste...
Calculate the number of ways Bob can complete a journey in a triangular pyramid after N steps.
Bob can move to any adjacent vertex in a single step
Bob must return to vertex 'O' after exactly 'N' steps
Calculate the number of different ways Bob can complete the journey
Return the result modulo 1000000007
Consider the constraints provided
Round duration - 60 Minutes
Round difficulty - Medium
2 DSA problems and computer subject questions
Given an integer K
, your task is to produce all binary strings of length 'K' that do not contain consecutive '1's.
The input begins with an integer ...
Generate all binary strings of length 'K' with no consecutive '1's in lexicographically increasing order.
Use backtracking to generate all possible binary strings of length 'K' with no consecutive '1's.
Start with an empty string and recursively add '0' or '1' based on the condition of no consecutive '1's.
Sort the generated strings in lexicographically increasing order before outputting them.
You are provided with three strings A
, B
, and C
. The task is to determine if C
is formed by interleaving A
and B
. C
is considered an interleaving of A
and B
if:
Check if a string is formed by interleaving two other strings.
Iterate through characters of A, B, and C simultaneously to check if C is formed by interleaving A and B.
Use dynamic programming to efficiently solve the problem.
Handle edge cases like empty strings or unequal lengths of A, B, and C.
Example: A = 'aab', B = 'abc', C = 'aaabbc' should return True.
Round duration - 60 Minutes
Round difficulty - Easy
DSA round
You are given coordinates for two lines on a 2D plane: Line 'AB' is defined by points 'A' and 'B', and Line 'PQ' is defined by points 'P' and 'Q'. Your task is to find the ...
Find the intersection point of two lines on a 2D plane given their coordinates.
Calculate the slopes of both lines using the given coordinates.
Use the slope-intercept form of a line to find the equations of the two lines.
Solve the equations simultaneously to find the intersection point.
Return the coordinates of the intersection point with precision up to 6 decimal places.
Determine if a given directed graph contains a cycle. If the graph has at least one cycle, return true
. Otherwise, return false
.
The first line of input contains...
Detect cycles in a directed graph and return true if a cycle exists, false otherwise.
Use Depth First Search (DFS) to detect cycles in the directed graph.
Maintain a visited array to keep track of visited vertices and a recursion stack to detect back edges.
If a vertex is visited and is present in the recursion stack, then a cycle exists.
Example: For the input 4 4, the graph has a cycle 0 -> 1 -> 2 -> 3 -> 1.
Round duration - 30 Minutes
Round difficulty - Easy
It is a managerial round
A URL is a web address that specifies the location of a resource on the internet. A load balancer distributes incoming network traffic across multiple servers to ensure optimal resource utilization and prevent overload.
A URL (Uniform Resource Locator) is a reference to a web resource that specifies its location on a computer network and the mechanism for retrieving it.
URLs typically consist of a protocol (such as HTTP ...
Tip 1 : Practice Trees, Graphs, DP
Tip 2 : Be sure about your projects
Tip 1 : Be genuine about your resume
Tip 2 : Have at least two projects on resume
based on 1 interview
Interview experience
Business Development Manager
170
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
85
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Key Account Manager
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Program Manager
38
salaries
| ₹0 L/yr - ₹0 L/yr |
Teachmint
BYJU'S
Unacademy
Toppr