Build Normal Queue | Solution

แชร์
ฝัง
  • เผยแพร่เมื่อ 25 ม.ค. 2025

ความคิดเห็น • 16

  • @sudhanshusharma9123
    @sudhanshusharma9123 4 ปีที่แล้ว +3

    Thankyou sir for a great explanation. I wasn't able to implement the circular way of utilizing the array earlier.

    • @Pepcoding
      @Pepcoding  4 ปีที่แล้ว +2

      I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem.
      If you like our efforts, we request a review - g.page/Pepcoding/review?rc

    • @sudhanshusharma9123
      @sudhanshusharma9123 4 ปีที่แล้ว

      @@Pepcoding yes sir, thankyou for letting me develop a habit of extracting and understanding what, how and why of problem. Yes sir, given a review too!!

  • @BhumikaJain-zh3kt
    @BhumikaJain-zh3kt 2 ปีที่แล้ว

    your videos are helping a lot!

  • @krishnapatel1209
    @krishnapatel1209 2 ปีที่แล้ว

    Awesome explanation.. Thank u very much sir

  • @apoorvdixit2856
    @apoorvdixit2856 4 ปีที่แล้ว +1

    sir apne front ki value badha di aur size decrease kar diya, to usse array par farak thodi padhna chahiyeh as the operations were not performed on the array.

  • @LegitGamer2345
    @LegitGamer2345 4 ปีที่แล้ว +1

    sir this implementation uses all n-1 spots of array right? where n is size of array

    • @Pepcoding
      @Pepcoding  4 ปีที่แล้ว +1

      Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.

  • @jobanpreetsingh2370
    @jobanpreetsingh2370 3 ปีที่แล้ว

    Gr8 sirji

  • @aditiT
    @aditiT 4 ปีที่แล้ว

    Could you please make a video on LRU Cache problem?

    • @Pepcoding
      @Pepcoding  4 ปีที่แล้ว +1

      Hanji beta zrur, I have noted it

  • @jatinbhatoya8420
    @jatinbhatoya8420 2 ปีที่แล้ว

    too good

  • @algoman6589
    @algoman6589 3 ปีที่แล้ว

    Sir ,mujhe ek doubt hai
    remove wale method m jo aapne front ko ek se increase kr dya esse toh data Array m rahega hi ..remove thodi hoga ......jab hum dubara add krenge kisi number ko tab ye overflow show krega..kyoki data toh pahle se mojud hai wanha ...bas humlogo ne front ke index change kr dya tha 🤕

    • @ashutoshmanorkar5556
      @ashutoshmanorkar5556 3 ปีที่แล้ว +1

      idx = (front + i)% data.length; iske upar meditate karo

    • @kashba
      @kashba 2 ปีที่แล้ว

      hmara check karne ka tareeka ke queue overfow hai ya nahi is by checking size of filled queue
      aur jab remove krte hai to size bhi ghta dete hai aur front aage
      jab circularly aayenge to bas hum value change kar denge jo existing values padhi hongi array me, they won't give us any problem. as sab kuch front, front + size (rear) se related hai

    • @HAMBIKASHARMA
      @HAMBIKASHARMA 2 ปีที่แล้ว +1

      @@kashba ya you are right.