Design Algorithm for Longest Increasing Subsequence Length
Company: Experian
Role: Data Scientist
Category: Coding & Algorithms
Difficulty: Medium
Interview Round: Technical Screen
##### Scenario
Programming assessment and infrastructure panel
##### Question
Design an algorithm to return the length of the Longest Increasing Subsequence of an array.
Seat students so that no two listed friends sit next to each other; provide algorithm and complexity.
How would you sort a file containing 50 numbers? How would your approach change for a 1-million-number file stored on disk?
##### Hints
Use O(n log n) patience sorting + binary search; graph/constraint satisfaction; external merge-sort for large files.
Quick Answer: This question evaluates algorithm design and data structure skills, covering subsequence analysis, constraint/graph modeling for seating, and external-memory sorting considerations for scalability.