Filter interviews by
The question is asking for the Longest Common Subsequence (LCS) of a given string.
LCS is a dynamic programming problem that finds the longest subsequence common to two or more strings.
The LCS does not require consecutive elements and can be found using a bottom-up approach.
Example: For strings 'ABCDGH' and 'AEDFHR', the LCS is 'ADH'.
Top trending discussions
I applied via Naukri.com and was interviewed in Oct 2021. There were 2 interview rounds.
They ask to many technical question and ask to code also
They ask for your background and thing you learnt in your past
I applied via Naukri.com and was interviewed before Dec 2019. There were 5 interview rounds.
I applied via Walk-in and was interviewed before Aug 2020. There was 1 interview round.
I would concentrate on improving the company's software development process.
Implementing agile methodologies
Investing in automation tools
Encouraging continuous learning and development
Fostering a culture of innovation
I appeared for an interview in Aug 2017.
I appeared for an interview in Aug 2016.
based on 1 interview
Interview experience
Assistant Manager
380
salaries
| ₹7 L/yr - ₹17.1 L/yr |
Deputy Manager
322
salaries
| ₹8.6 L/yr - ₹24 L/yr |
Senior Engineer
305
salaries
| ₹3.6 L/yr - ₹13.2 L/yr |
Sales Executive
304
salaries
| ₹1.4 L/yr - ₹6 L/yr |
Manager
217
salaries
| ₹14.9 L/yr - ₹30.5 L/yr |
Vivo
OPPO
Dell
HARMAN