i
Angel
One
Filter interviews by
I applied via Instahyre and was interviewed before Feb 2022. There were 4 interview rounds.
Count the number of islands in a 2D grid.
Iterate through the grid and for each '1', perform a depth-first search to mark all connected '1's as visited.
Increment the count of islands for each new '1' encountered.
Return the total count of islands.
The coin change problem involves finding the minimum number of coins needed to make a certain amount of change.
Use dynamic programming to solve the problem efficiently
Start with a base case where the amount of change is 0
Iterate through each coin denomination and calculate the minimum number of coins needed for each amount of change
Store the results in a table and use them to calculate the minimum number of coins for l...
Top trending discussions
posted on 30 Sep 2021
I applied via Campus Placement and was interviewed in Aug 2021. There were 3 interview rounds.
Design Twitter - a social media platform for microblogging and sharing thoughts in real-time.
Users can create profiles and follow other users
Users can post tweets (limited to 280 characters)
Tweets can include hashtags and mentions
Users can like, retweet, and reply to tweets
Twitter can use algorithms to curate content for users
Twitter can also offer advertising options for businesses
posted on 23 Sep 2022
I applied via Job Fair and was interviewed in Aug 2022. There were 4 interview rounds.
This round contained 2 coding questions.
posted on 16 Mar 2022
I appeared for an interview in Feb 2022.
3 coding question 1 SQL query
Find the first repeated element in an array of strings in O(n) time complexity.
Create a hash table to store the frequency of each element.
Traverse the array and check if the element is already present in the hash table.
If it is present, return the element as the first repeated element.
If no element is repeated, return null or -1.
Example: ['apple', 'banana', 'orange', 'apple'] => 'apple'
Question about finding complexity of multiplying big integers.
Big integers require more memory and processing power than regular integers.
Multiplying two n-digit integers takes O(n^2) time using the standard algorithm.
There are faster algorithms like Karatsuba and FFT which have lower complexity.
The complexity of multiplying two n-digit integers using Karatsuba algorithm is O(n^log2(3)).
The complexity of multiplying tw...
posted on 7 Oct 2022
I applied via Referral and was interviewed in Sep 2022. There were 3 interview rounds.
15 MCQs and 2 coding questions were given. MCQs include questions from topics like dbms, system design, oops etc.
1st coding question was of dp and 2nd was of a good question of graph.
Create and delete a node in a linked list and print the updated list.
Create a Node class with data and next pointer attributes
Create a LinkedList class with head attribute and methods to add, delete and print nodes
To delete a node, traverse the list and update the next pointer of the previous node to skip the node to be deleted
Print the list by traversing and printing the data of each node
Reverse the first K characters of a given string.
Take the first K characters of the string.
Reverse the selected substring.
Concatenate the reversed substring with the rest of the original string.
I applied via Campus Placement and was interviewed in Nov 2023. There were 4 interview rounds.
Mcqs based on cs fundamentals and 2_3 coding questions
Merge two sorted linked lists into one.
Create a new linked list to store the merged list.
Compare the values of the nodes from both lists and add the smaller value to the new list.
Move the pointer of the list with the smaller value to the next node.
Repeat the comparison and addition until one of the lists is empty.
Add the remaining nodes from the non-empty list to the new list.
Return the new merged list.
I applied via Campus Placement and was interviewed in Dec 2024. There were 2 interview rounds.
Quantitative aptitude, verbal ability, critical reasoning
Use SQL query to find store with highest Average Order Value (AOV).
Use GROUP BY clause to group by store
Calculate AOV by dividing total revenue by total orders
Use ORDER BY and LIMIT to find store with highest AOV
I applied via Campus Placement
General SQL Question
I applied via Naukri.com and was interviewed before May 2023. There was 1 interview round.
It was good. Mostly questions on spark
based on 1 interview experience
Difficulty level
Duration
Senior Executive
359
salaries
| ₹1.5 L/yr - ₹4.8 L/yr |
Relationship Manager
306
salaries
| ₹1.2 L/yr - ₹4.2 L/yr |
Assistant Manager
278
salaries
| ₹2.7 L/yr - ₹7.2 L/yr |
Deputy Manager
175
salaries
| ₹3 L/yr - ₹9.4 L/yr |
Sales Executive
162
salaries
| ₹1 L/yr - ₹4.7 L/yr |
Paytm
AGS Transact Technologies
Hitachi Payment Services
Rupeek