1367. Linked List in Binary Tree | linked list | Leetcode Daily Challenge | DSA | Java | hindi

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

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

  • @shashwat_tiwari_st
    @shashwat_tiwari_st  2 месяца назад +5

    Like target for this video is 100! Please do like if you have understood the explanation as well as the code 😄

  • @rajaryanbehera8628
    @rajaryanbehera8628 2 месяца назад +1

    No One explains better than you Bhai. And I am an M.Tech student and also use to teach students in each class I used to suggest each student to follow you for DSA using JAVA. You are best

  • @srishtisingh9031
    @srishtisingh9031 2 месяца назад +1

    Thankyou somuch BHaiyaaaa!!!!! :)

  • @gaurigupta4766
    @gaurigupta4766 2 месяца назад

    nice

  • @Harsh-jc2bz
    @Harsh-jc2bz 2 месяца назад

    understood

  • @NishantPandat-l3q
    @NishantPandat-l3q 2 месяца назад

    great sir

  • @anjaligupta7788
    @anjaligupta7788 2 месяца назад

  • @ParamSharma-q1o
    @ParamSharma-q1o 2 месяца назад

    i think there is no need for dfs func if head.val == root.val get true then we will find for head.next in root.left and root.right

  • @saiei
    @saiei 2 месяца назад

    same same only
    fully recurssion only

  • @dayashankarlakhotia4943
    @dayashankarlakhotia4943 2 месяца назад

    please tell kmp algorithm Solution.

  • @Rainy_tech
    @Rainy_tech 2 месяца назад

    Sir Time Complexity O(N+M) hoga ya O(N*M)?

  • @PiyushSharma-we8yd
    @PiyushSharma-we8yd 2 месяца назад +2

    first view reh gaya mera aaj :( chaliye aaj 2nd comment 😛

  • @monugit9
    @monugit9 2 месяца назад