Filter interviews by
Clear (1)
Print Longest Common Subsequence of a string
Use dynamic programming to find the LCS of two strings
Create a 2D array to store the lengths of LCS for each pair of characters
Trace back through the array to find the actual LCS string
Example: For strings 'ABCBDAB' and 'BDCAB', the LCS is 'BCAB'
Top trending discussions
One easy , one medium question Array based
I applied via Recruitment Consulltant and was interviewed before May 2023. There was 1 interview round.
Coin Change Problem from DSA
I applied via LinkedIn and was interviewed in Feb 2024. There were 4 interview rounds.
Merge sort is a divide and conquer algorithm that recursively splits an array into halves, sorts them, and then merges them back together.
Merge sort is efficient for sorting large arrays.
It has a time complexity of O(n log n).
It is a stable sorting algorithm.
Example: ['apple', 'banana', 'orange', 'grape', 'kiwi']
I applied via Approached by Company
I applied via Walk-in and was interviewed in Dec 2020. There was 1 interview round.
posted on 31 Oct 2021
I applied via Referral and was interviewed in May 2021. There was 1 interview round.
I was interviewed before Sep 2020.
I applied via Referral and was interviewed before Jun 2021. There were 2 interview rounds.
based on 1 interview
Interview experience
Operations Executive
108
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
22
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive Operations
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Manager
10
salaries
| ₹0 L/yr - ₹0 L/yr |
BlackBuck
Delhivery
Ecom Express
Shadowfax Technologies