Linked List Coding Interview Questions in Java | Cycle Detection | Find Middle node | Code Decode

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

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

  • @yogitamittal6967
    @yogitamittal6967 2 ปีที่แล้ว +6

    Hi . Great video . The same question was asked to me in L-1 round in Morgan Stanley . Please upload more videos on Linkedlist and arraylist Questions.

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

      Thanks Yogita. Sure we will upload them 👍🙂

    • @ramyal5371
      @ramyal5371 ปีที่แล้ว

      Could you please let me know other coding questions which were asked in further rounds

  • @akhtar-afreen
    @akhtar-afreen 2 ปีที่แล้ว +2

    Mam! I have been following your videos since a month and a half and I got placed recently as a Full Stack Developer. Many Many thanks to you😇

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

      Many congratulations Afreen. 🎉🎉🎊🎊well deserved 👏👏👏👏keep learning keep shining ⭐✨⭐✨

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

    This is the best video of LinkedList I have ever encountered. Have always struggled with LinkedList but this was phenomenal. Hats off to your explanation🎉

    • @CodeDecode
      @CodeDecode  ปีที่แล้ว

      Thanks Nidhi. Keep learning keep shining girl ❤️🌟🌟

  • @akashsaha9366
    @akashsaha9366 2 ปีที่แล้ว +3

    Thanks maam. You are making me interview ready. The same question was asked me at oracle and adobe.

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

      Thanks Akash 🙂👍

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

    Hi
    Your vedios are very very useful for me to understand concepts and understand the concepts... Really great work.... Appreciate your effort

    • @CodeDecode
      @CodeDecode  ปีที่แล้ว

      Thanks 😊👍👍

  • @srisureshshetty
    @srisureshshetty 5 หลายเดือนก่อน

    Great work and Good video. Thanks for providing this kind of tutorial.👍

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

    These videos are helpful even for experience .Please also upload basic tree question asked in interviews

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

      Thanks Pranjal. Sure🙂👍

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

    These videos are really very helpful to crack interviews. Thank you

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

      Thanks Santhosh 🙂👍

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

    Eagerly waits for ur video. .🤗🤗

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

      Thanks varun

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

      In my new organization I'm started learning microservies so urs videos are helping me lot thanks..

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

      Thanks Varun. Glad to hear this. Is there any thing else you need in the playlist which we should cover

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

      @@CodeDecode defienetly I'll let you know.. right now previous videos helping me .to do things

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

    Plz share more such videos
    Thank you for your efforts

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

      Sure Nishant 🙂👍

  • @srivigneshcreations.9204
    @srivigneshcreations.9204 2 ปีที่แล้ว +1

    Tq so much madam love u so much ur vedeos are helping a lot tq a lot .

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

      Thanks Vignesh 🙂👍

  • @AshishYadav-se4db
    @AshishYadav-se4db 2 ปีที่แล้ว +1

    Great 👍👍. Thank you mam.

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

      🙂🙂👍👍

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

    Thank you mam..thank you so much 👍👍👍👍👍

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

      you're welcome tulsi

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

    You explained very nicely and clearly but speed is high :)

    • @CodeDecode
      @CodeDecode  ปีที่แล้ว

      Sure Nilesh. Wil try to reduce speed in upcoming videos 👍

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

    Great explaination

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

    Great 👍👍. Thank you mam. Please create few more videos on linked list like complete reversal, reversing two nodes at time, queues,etc.

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

      Nice topics Sourabh. Sure we will create a video on these 🙂👍

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

    Why only 199 like you deserve more than 1m like

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

      Thanks Neha🙂

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

    Hi just one question, if there are 100 nodes, is this still valid? Since middle node should be 51 isn't it?

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

    Mam please keep your speed little slow while teaching the concept.. because for the first time it is going over head for me.. otherwise concept wise it was excellent

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

    Long time didnt hear from you...

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

      Hey, we put video every week man. Please press bell icon so that we don't miss any new uploads 🙂👍

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

    Pls do few more videos on LinkedList...

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

      Sure Nagendra 🙂👍

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

    LinkedList allows duplicates so if two nodes having same data means its cyclic??

    • @CodeDecode
      @CodeDecode  ปีที่แล้ว

      Hey Ramya. u r getting confused in pointer and data in nodes. These are 2 different things . Nodes have data and pointer. Here it says data is duplicate , pointer can point to next node with no cyclic dependency

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

      For the same program I tried inserting same data as 1 in first node nd again 1 in second node.. Getting output as cycle detection at node 1

    • @CodeDecode
      @CodeDecode  ปีที่แล้ว

      Can you check pointers Ramya. M sure you messed up with pointers

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

    in else condition in addNodes method
    instead of
    tail.next = new_Node;
    tail=tail.next;
    can we assign directly like this
    tail = new_node;

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

      No you can't Naresh. Because u have created a new node but it's yet not linked to any linklist. Hence first u have to add it to the linked list then only u can move tail to next. If u directly do this then u will loose your tail pointer. It will start pointing to anywhere in memory which is not linked to any node in linked list.

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

      @@CodeDecode Thank you for the reply.. You mean Node also have internal implementation i.e the tail pointer which will take the tail value which we are adding? Is Node a predefined class?

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

    very helpful video . want you to cover more data structure questions like Btree

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

      Sure Nidhi. We will do that🙂👍

  • @sumant9189
    @sumant9189 ปีที่แล้ว

    who is the other instructor mam?

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

    Please start with graph problems

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

    Please go some slow u are telling very fast

    • @CodeDecode
      @CodeDecode  ปีที่แล้ว

      Sure gayathri 🙂👍