i
BlackBerry
Filter interviews by
I applied via Company Website and was interviewed before Mar 2023. There were 3 interview rounds.
The minimum number of swaps required to sort a list is equal to the number of inversions in the list.
Count the number of inversions in the list to determine the minimum number of swaps needed to sort it.
An inversion occurs when a larger element appears before a smaller element in the list.
For example, in the list [4, 3, 2, 1], there are 6 inversions (4,3), (4,2), (4,1), (3,2), (3,1), (2,1), so at least 6 swaps are need
A URL shortener is a tool that takes a long URL and generates a shorter, unique link that redirects to the original URL.
Generate a unique key for each long URL
Store the mapping of long URL to unique key in a database
Create a redirect service that takes the unique key and redirects to the original URL
posted on 13 May 2022
I applied via Naukri.com and was interviewed before May 2021. There were 2 interview rounds.
Based on Core Java & problem solving
posted on 30 Jul 2024
I applied via Newspaper Ad and was interviewed in Jan 2024. There were 2 interview rounds.
Trains bus car boat stream blood
Dp array string hash map gd
posted on 13 May 2024
I applied via Job Portal and was interviewed before May 2023. There was 1 interview round.
Sorting an array of strings using Python code
Use the sorted() function to sort the array of strings
You can specify the key parameter to sort based on a specific criteria
You can also use the sort() method to sort the array in place
posted on 29 Sep 2024
Queue question - create queue from array
I applied via Walk-in and was interviewed before Jun 2023. There were 3 interview rounds.
It was on c and elimanating round
Asked many c fundamental question
Internal swc platform, no autocomplete, hard question
I applied via Company Website and was interviewed before May 2023. There was 1 interview round.
I applied via LinkedIn and was interviewed in Apr 2023. There were 4 interview rounds.
Leetcode hard 2 questions cat chicken problem
Leetcode hard lld questions and mr round
I applied via LinkedIn and was interviewed in Apr 2023. There were 3 interview rounds.
You better prepare for dynamic programming
Max sub array refers to the contiguous subarray within an array that has the largest sum of elements.
Max sub array problem is a common algorithmic problem in computer science.
It involves finding the subarray with the largest sum of elements.
Example: Given array [1, -2, 3, 4, -1, 2, 1, -5, 4], the max sub array is [3, 4, -1, 2, 1] with a sum of 9.
based on 1 interview
Interview experience
Senior Software Engineer
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Store Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
5
salaries
| ₹0 L/yr - ₹0 L/yr |
System Software Engineer 2
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Apple
Samsung
Nokia
Huawei Technologies