3404. Count Special Subsequences | HashMap | GCD | Pattern Identification

Поделиться
HTML-код
  • Опубликовано: 1 янв 2025

Комментарии • 13

  • @ARYANMITTAL
    @ARYANMITTAL  3 дня назад +1

    Never do this mistake in your OAs - ruclips.net/user/shortsRCJwPU619g4?feature=share
    Q4 - ruclips.net/video/QPKyT2YGnHY/видео.html

  • @monsuruokuniyi1234
    @monsuruokuniyi1234 3 дня назад +3

    It's funny. I just realized I wasn't subscribed even though I've been watching your videos for a while now. Subscribed now and liked. I loved this intuition.
    By the way, "Maqsad". I had to browse what it means. Nigerian guy here, you may force me to learn Urdu

  • @JeetuKumar-wd1uw
    @JeetuKumar-wd1uw 3 дня назад +4

    why dp is not working here

  • @aryavyadav9345
    @aryavyadav9345 День назад

    Great explanation. This was indeed a hard question.

  • @AvradipDas
    @AvradipDas 2 дня назад

    Amazing Explanation. You made it pretty easy to understand. Thanks.
    The key could also be a Pair of Integers.

  • @dhruvrawatt9
    @dhruvrawatt9 3 дня назад +1

    Very well explained and question was very intuitive

  • @ajayc815
    @ajayc815 3 дня назад

    big fan of your work 🥰🥰🥰🥰🥰

    • @ARYANMITTAL
      @ARYANMITTAL  3 дня назад +1

      Thank you so much broooo 😀

  • @amardeep7714
    @amardeep7714 День назад

    this ques comes in google just 2 months back in OA.

  • @nitinjha4863
    @nitinjha4863 2 дня назад

    Why is my DP approach giving TLE?
    class Solution {
    unordered_map memo;
    bool check(vector& nums, string& index) {
    int p = index[0] - '0';
    int q = index[1] - '0';
    int r = index[2] - '0';
    int s = index[3] - '0';
    if (q - p

    • @anujnagpure9113
      @anujnagpure9113 2 дня назад

      because the solution is taking much time😌

  • @surajpatra6779
    @surajpatra6779 3 дня назад +1

    @ARYANMITTAL why dp didn't work here ?