JobsJob TrackerJob alerts

Works Applications ยท 13 questions

All 13Coding 13
  • Find least 10% elements and reverse data structureCoding
  • Check if a string is a substring of anotherCoding
  • Segregate zeroes and ones in an arrayCoding
  • Reduction of strings by replacing charactersCoding
  • Longest monotonically increasing subsequenceCoding
  • Minimum distance in orienteering map with checkpointsCoding
  • Implement an Immutable QueueCoding
  • Optimize and print path for orienteering mapCoding
  • Print all permutations of a string in sorted orderCoding
  • Missing number in arrayCoding
  • Detect and reverse a loop in linked listCoding
  • Leaders in an arrayCoding
  • Rotate a Linked ListCoding
โ† Works Applications questions
  1. Interview questions
  2. Works Applications
  3. Longest monotonically increasing subsequence
Coding

Longest monotonically increasing subsequence

Filed under Works Applications

The question

Find the longest monotonically increasing subsequence in an array, print all possible such subsequences, and handle hexadecimal string inputs.

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

Related Works Applications questions

  • Find least 10% elements and reverse data structure
  • Check if a string is a substring of another
  • Segregate zeroes and ones in an array
  • Reduction of strings by replacing characters
  • Minimum distance in orienteering map with checkpoints
โ† Reduction of strings by replacing charactersMinimum distance in orienteering map with checkpoints โ†’

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