Filter interviews by
Be the first one to contribute and help others!
posted on 4 Nov 2024
I applied via LinkedIn and was interviewed in Oct 2024. There were 3 interview rounds.
Questions were based on basic aptitude like seating arrangement
2 Questions - One Easy and One Medium
I applied via Campus Placement
One medium and one standard DP question
Design Google Pay - a digital wallet platform for online payments and transactions.
Allow users to securely store payment information such as credit/debit cards, bank accounts, and loyalty cards.
Enable users to make payments in stores, online, and within apps using their stored payment methods.
Implement security features like biometric authentication, tokenization, and encryption to protect user data.
Provide features fo...
High Level Design (HLD) of recursive functions in software development.
Recursive functions call themselves to solve smaller instances of the same problem.
HLD of recursive functions involves defining the base case, recursive case, and termination condition.
Example: HLD of a recursive function to calculate factorial of a number involves defining base case as factorial(0) = 1.
Maths and communication based questions
Estimate and SQL and coding was there
Time ,speed ,distance
Java application using oops concept
I applied via Referral and was interviewed in Sep 2023. There were 3 interview rounds.
Java 8, Mysql, sprin, c, c++
posted on 18 Jul 2023
I applied via Campus Placement and was interviewed in Jan 2023. There were 4 interview rounds.
Basic quant questions and logical reasoning, c++ and java
To find palindromes in a string, compare characters from both ends towards the middle.
Iterate through each string in the array
Check if the string is equal to its reverse to determine if it's a palindrome
Examples: 'level', 'radar', 'madam'
Arrays store elements in contiguous memory locations, while linked lists store elements in nodes with pointers to the next node.
Arrays have fixed size, while linked lists can dynamically grow or shrink.
Accessing elements in arrays is faster (O(1)), while in linked lists it is slower (O(n)).
Inserting or deleting elements in arrays can be inefficient, while in linked lists it is efficient.
Example: Array - [1, 2, 3, 4], L
I applied via Campus Placement
There is some aptitude questions along with some subject question(C++,DBMS,OS). And also there is one easy/medium coding question
I applied via Company Website and was interviewed in May 2021. There were 3 interview rounds.
Exceptions are errors that occur during program execution and can be handled using try-catch blocks.
Checked exceptions: must be handled or declared in the method signature
Unchecked exceptions: occur at runtime and do not need to be declared
Error: serious problems that cannot be handled, such as OutOfMemoryError
Examples: NullPointerException, ArrayIndexOutOfBoundsException
Exceptions should be handled gracefully to prevent application crashes.
Use try-catch blocks to catch exceptions.
Handle exceptions at the appropriate level of abstraction.
Log exceptions to aid in debugging.
Provide meaningful error messages to the user.
Avoid catching generic exceptions.
Use finally blocks to release resources.
Consider using custom exceptions for specific error conditions.
To create a custom read-only list, use the ReadOnlyCollection class in C#.
Create a List
Use the AsReadOnly() method to create a read-only wrapper around the list.
Use the ReadOnlyCollection
Example: List
Example: var readOnlyList = myList.AsReadOnly();
Example: var trulyReadOnlyList = new ReadOnlyCollect
Collections are data structures that store and manipulate groups of related objects.
Collections are used to store and manipulate groups of related objects
They can be classified into three main categories: Lists, Sets, and Maps
Lists maintain the order of elements and allow duplicates (e.g. ArrayList, LinkedList)
Sets do not allow duplicates and do not maintain order (e.g. HashSet, TreeSet)
Maps store key-value pairs and d...
Binary search is a search algorithm that finds the position of a target value within a sorted array.
The array must be sorted before applying binary search
Compare the target value with the middle element of the array
If the target value is smaller, search the left half of the array
If the target value is larger, search the right half of the array
Repeat until the target value is found or the search space is exhausted
Software Engineer
19
salaries
| ₹10 L/yr - ₹22.3 L/yr |
Product Owner
12
salaries
| ₹16 L/yr - ₹25.5 L/yr |
Senior Test Analyst
9
salaries
| ₹9.4 L/yr - ₹14 L/yr |
Associate Software Engineer
7
salaries
| ₹7 L/yr - ₹9 L/yr |
Java Developer
7
salaries
| ₹9 L/yr - ₹13.2 L/yr |
Paytm
PhonePe
Mobikwik
Payed