D-367 Frequencies of Limited Range Array Elements |GFG POTD| GeeksForGeeks Problem Of the Day|01 Nov

Поділитися
Вставка
  • Опубліковано 29 вер 2024
  • Prerequisite:
    Time Complexity - Logic of 10^8- Find algo to any problem
    • Trick the TLE | How t...
    USE Code "AKSHAYS10" to avail10% off on all GFG courses:
    Problem Link: www.geeksforge...
    Source Code JAVA/C++ : github.com/Aks...
    Methods -
    1. TC: O(N), SC: O(N) - Map
    2. TC: O(N), SC: O(1) - Inplace
    GFG POTD Playlist - • DAY 1 | Filling Bucket...
    Number Theory playlist - • 204. Count Primes - (A...
    Arrays - • Reverse a String | Ep-01
    LinkedList - • Reverse a Linked List ...
    Strings - • Day 300 - Multiply two...
    Bitwise - • Non Repeating Numbers|...
    Stacks - • DAY - 280 Reverse a St...
    Heaps - • How to Build Heap and ...
    Recursion - • Lec-1 What is Recursio...
    Map - • Non Repeating Characte...
    Graphs Playlist Link - • Course Schedule II (To...
    Binary Trees Playlist - • What is a Binary Tree ?
    DP playlist - • What is Dynamic Progra...
    GitHub: github.com/Aks...
    Hello everyone, I am Akshay and I appreciate you stopping by my channel. I have made this channel to help all ready to learn, grow, and do something big in the field of Tech.
    It's a free UA-cam channel dedicated to students developing problem-solving skills.
    Let's connect on
    Instagram
    / itzz_aksh_yay
    / dsa_with_akshay
    LinkedIn
    / akshay-a-26672a172
    Lets connect: Linktree: linktr.ee/aksh...
    Happy Coding 🤝
    .
    .
    .
    .
    #AkshayAnil #dsa #dsa_with_akshay #programming #gfg #gfgpotd #problemsolving #coding #softwareengineer #faang #amazon #microsoft #competitiveprogramming #dsasheet #interviewpreparation

КОМЕНТАРІ • 11

  • @S__Khan__
    @S__Khan__ Місяць тому

    is P a distraction ? coz lets say if we take some random P like, P=P+100, then also it's working.

  • @rushabhlegion2560
    @rushabhlegion2560 11 місяців тому +1

    Nice video yr. I was able to code it using extra space but not with O(1). Thanks bhaiya.

  • @BaburaoSanivada
    @BaburaoSanivada 11 місяців тому

    very well explained

  • @sudhadevi6692
    @sudhadevi6692 11 місяців тому +3

    I was able to solve it in O(1) and O(N)

  • @sandip_kanzariya8476
    @sandip_kanzariya8476 11 місяців тому +1

    Thanks !
    can anybody give me the case which fail if i not write ( index < N ) ?

    • @Brute_Coder
      @Brute_Coder 11 місяців тому +1

      hi
      you can take a array of size 4 and p as 8 now suppose you have 7 in your array then after using the index formulae you will get
      6 which is indeed > 4 so without this condition it will give out of bound exception.
      hope it made sense 😃

  • @akshaykalidatta7062
    @akshaykalidatta7062 3 місяці тому

    Thanks for the solution. I see you always derive some kind of mathematical equation which relates both previous given value and the new desired value with a common number. Is there a fixed way to think in that direction? Any technique or even a trick would help.

    • @AkshayAnil0-1
      @AkshayAnil0-1  3 місяці тому

      Yup we need to solve 100 prerequisite question
      After that you will be able to observe the pattern
      Please refer to our leetcode preparation palylist

    • @majdywowbajashahag
      @majdywowbajashahag Місяць тому

      @@AkshayAnil0-1 sir can you please link me those 100 preq. questions?

  • @jatinsood9277
    @jatinsood9277 3 місяці тому

    👍