JobsJob TrackerJob alerts

1mg ยท 12 questions

All 12Coding 11System Design 1
  • Arrange numbers to yield the largest valueCoding
  • Longest increasing subsequence count after replacementCoding
  • Design an Authentication systemSystem Design
  • Find minimum element in a sorted and rotated arrayCoding
  • Maximum length substring for even palindromeCoding
  • Shortest string of accelerations and reverses to reach NCoding
  • Implement rand3() using rand2()Coding
  • Find repeating elements in O(n) and constant spaceCoding
  • Count frequency of elements in an unsorted arrayCoding
  • Check if a binary tree is BSTCoding
  • Print characters and their frequenciesCoding
  • Quicksort vs Mergesort, Binary Tree Left View, String ReversalCoding
โ† 1mg questions
  1. Interview questions
  2. 1mg
  3. Longest increasing subsequence count after replacement
Coding

Longest increasing subsequence count after replacement

Filed under 1mg

The question

Find the count of the Longest Increasing Subsequence (LIS) for each change made at the ith position in an array from 1 to n.

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

Related 1mg questions

  • Arrange numbers to yield the largest value
  • Find minimum element in a sorted and rotated array
  • Maximum length substring for even palindrome
  • Shortest string of accelerations and reverses to reach N
  • Implement rand3() using rand2()
โ† Arrange numbers to yield the largest valueDesign an Authentication system โ†’

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