i
Apple
Filter interviews by
I applied via Company Website and was interviewed in Aug 2024. There was 1 interview round.
Difficult coding question, and 30 MCQs. MCQs are mix of technical and QA Theory questions. Coding question is from dynamic programming.
String reverse is the process of reversing the order of characters in a string.
Create a new string and iterate through the original string in reverse order, appending each character to the new string.
Use built-in functions like reverse() in some programming languages to reverse the string directly.
Implement a custom algorithm to swap characters from the beginning and end of the string until reaching the middle.
Top trending discussions
Good it was nice information and Engineering
Good it was nice information and Engineering
Good it was nice information and Engineering
Great experience it was really smooth process
Great Experience it was a smooth process
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
To verify if a record is deleted from a page with 10 records, we can check if the record is no longer displayed.
Locate the record on the page
Verify that the record is no longer visible
Confirm that the total number of records displayed is now 9
posted on 30 Jun 2022
I applied via Naukri.com and was interviewed in Jun 2022. There were 4 interview rounds.
Good it was nice information and Engineering
Good it was nice information and Engineering
Good it was nice information and Engineering
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
It was easy - medium leetcode question
Find the maximum value in an array of strings with complexity
Convert strings to integers before finding the maximum value
Use a loop to iterate through the array and compare each value to find the maximum
Handle edge cases such as empty array or non-numeric strings
Find two numbers in an array that add up to a specific target value.
Use a hashmap to store the difference between the target value and each element in the array.
Iterate through the array and check if the current element's complement exists in the hashmap.
Return the indices of the two numbers that add up to the target value.
posted on 15 Nov 2021
I applied via Hackerearth contest and was interviewed in Oct 2021. There was 1 interview round.
Reverse a linked list
Iterate through the linked list and change the direction of the pointers
Use three pointers to keep track of the current, previous, and next nodes
Make sure to update the head and tail pointers accordingly
Swap 2 numbers without using a third variable
Use the XOR operation to swap the numbers
Assign the first number to the second number using XOR
Assign the second number to the first number using XOR
Height of a binary tree is the maximum number of edges from the root node to any leaf node.
The height of an empty tree is 0.
The height of a tree with only one node is 1.
The height of a tree can be calculated recursively by finding the height of its left and right subtrees and adding 1 to the maximum of the two heights.
The time complexity of finding the height of a binary tree is O(n), where n is the number of nodes in
Sum queries on a 2D matrix
Iterate through each query and calculate the sum of elements in the given range
Use prefix sum technique to optimize the solution
Preprocess the matrix to store the sum of elements in each row and column for faster calculation
based on 3 interviews
Interview experience
Software Engineer
168
salaries
| ₹18 L/yr - ₹64.1 L/yr |
Ipro
111
salaries
| ₹2 L/yr - ₹5.1 L/yr |
Sales Executive
102
salaries
| ₹1.6 L/yr - ₹4.8 L/yr |
Software Developer
87
salaries
| ₹12 L/yr - ₹49.4 L/yr |
Senior Software Engineer
72
salaries
| ₹15.1 L/yr - ₹53.4 L/yr |
Amazon
Microsoft Corporation
Samsung