JobsJob TrackerJob alerts

Netcracker · 15 questions

All 15Coding 7Behavioral 3
  • Longest common subsequence variationCoding
  • Sum of alternate level nodes in binary treeCoding
  • Add two numbers in Java using static and non-staticCoding
  • Find the odd string out among N given stringsCoding
  • Difference between C and C++, and OOP concepts in detail
  • Types of DBMS languages and SQL queries
  • Implement a doubly linked listCoding
  • What would you do if your team performs below your expectations?Behavioral
  • Three ants on a triangle puzzle
  • Tell me about yourself.Behavioral
  • Difference between array and queue
  • Why Java is platform independent
  • Do you know about Netcracker Technology and our T&C?Behavioral
  • Find water in a glass / Toy allocation matrixCoding
  • Check if two trees are mirrorCoding
← Netcracker questions
  1. Interview questions
  2. Netcracker
  3. Longest common subsequence variation
Coding

Longest common subsequence variation

Filed under Netcracker

The question

Solve a dynamic programming question similar to the Longest Common Subsequence Problem.

No write-up yet. Related questions below have one.

Related Netcracker questions

  • Sum of alternate level nodes in binary tree
  • Add two numbers in Java using static and non-static
  • Find the odd string out among N given strings
  • Find water in a glass / Toy allocation matrix
Sum of alternate level nodes in binary tree →

Collected from public candidate posts and coding forums. Updated Nov 2026.