(Hard) Minimum Operations to Make the Array K-Increasing | Leetcode Weekly Contest 272

Поділитися
Вставка
  • Опубліковано 22 лис 2024

КОМЕНТАРІ • 3

  • @kumarpriyansh4238
    @kumarpriyansh4238 2 роки тому +1

    How we would have solved this if it ask to min operation to make longest increasing subsequence. Ex 1 2 4 3 4 5 6. Here answer according to above code is 1. But actual answer should be 4

  • @mudrad1930
    @mudrad1930 Рік тому

    thanks brother got the intuition very well

  • @aakashparmar560
    @aakashparmar560 2 роки тому +2

    badhiya bhai!