Anish
Anish
  • Видео 42
  • Просмотров 7 680
Kadane's Algorithm In 6 Minutes | LeetCode #53: Maximum Subarray | Top Interview 150
Walkthrough Explaining Kadane's Algorithm In Under 6 Minutes | Solving LeetCode #53: Maximum Subarray | Top Interview 150
Website: anishkganesh.com/
LinkedIn: www.linkedin.com/in/anishkganesh/
GitHub: github.com/anishkganesh
Timestamps:
0:00 - Understanding The Problem
0:40 - Kadane's Algorithm
4:08 - Solutioning through Code
#leetcode #coding #interview #python #programming #walkthrough #tutorial #educational #beginners #easy #solution
Music by Vincent Rubinetti
Download the music on Bandcamp:
vincerubinetti.bandcamp.com/album/the-music-of-3blue1brown
Stream the music on Spotify:
open.spotify.com/playlist/3zNK20qC96mVSww60lVi1k
Просмотров: 64

Видео

LeetCode #874: Walking Robot Simulation | LeetCode Daily
Просмотров 1272 месяца назад
Walkthrough Solving LeetCode #874: Walking Robot Simulation | LeetCode Daily Website: anishkganesh.com/ LinkedIn: www.linkedin.com/in/anishkganesh/ GitHub: github.com/anishkganesh Timestamps: 0:00 - Understanding The Problem 0:18 - Solutioning by Drawing 5:40 - Solutioning through Code #leetcode #coding #interview #python #programming #walkthrough #tutorial #educational #beginners #easy #soluti...
LeetCode #1945: Sum of Digits of String After Convert | LeetCode Daily
Просмотров 862 месяца назад
Walkthrough Solving LeetCode #1945: Sum of Digits of String After Convert | LeetCode Daily Website: anishkganesh.com/ LinkedIn: www.linkedin.com/in/anishkganesh/ GitHub: github.com/anishkganesh Timestamps: 0:00 - Understanding The Problem 1:55 - Solutioning through Code #leetcode #coding #interview #python #programming #walkthrough #tutorial #educational #beginners #easy #solution Music by Vinc...
Avoiding LeetCode Timeout Errors | LeetCode Daily #1894
Просмотров 352 месяца назад
Walkthrough Solving LeetCode #1894: Find the Student that Will Replace the Chalk | LeetCode Daily Website: anishkganesh.com/ LinkedIn: www.linkedin.com/in/anishkganesh/ GitHub: github.com/anishkganesh Timestamps: 0:00 - Understanding The Problem 1:13 - Solutioning by Drawing 4:10 - Solutioning through Code #leetcode #coding #interview #python #programming #walkthrough #tutorial #educational #be...
How do we convert a 1D Array into a 2D Array? | LeetCode Daily #2022
Просмотров 702 месяца назад
Walkthrough Solving LeetCode #2022: Convert 1D Array Into 2D Array | LeetCode Daily Website: anishkganesh.com/ LinkedIn: www.linkedin.com/in/anishkganesh/ GitHub: github.com/anishkganesh Timestamps: 0:00 - Understanding The Problem 1:20 - Solutioning by Drawing 3:14 - Solutioning through Code #leetcode #coding #interview #python #programming #walkthrough #tutorial #educational #beginners #easy ...
LeetCode #162: Find Peak Element | LeetCode 75
Просмотров 792 месяца назад
Walkthrough Solving LeetCode #162: Find Peak Element | LeetCode 75 Website: anishkganesh.com/ LinkedIn: www.linkedin.com/in/anishkganesh/ GitHub: github.com/anishkganesh Timestamps: 0:00 - Understanding The Problem 0:38 - Solutioning by Drawing 7:35 - Solutioning through Code #leetcode #coding #interview #python #programming #walkthrough #tutorial #educational #beginners #easy #solution
LeetCode #334: Increasing Triplet Subsequence | LeetCode 75
Просмотров 412 месяца назад
Walkthrough Solving LeetCode #334: Increasing Triplet Subsequence | LeetCode 75 Website: anishkganesh.com/ LinkedIn: www.linkedin.com/in/anishkganesh/ GitHub: github.com/anishkganesh Timestamps: 0:00 - Understanding The Problem 0:54 - Solutioning by Drawing 6:26 - Solutioning through Code #leetcode #coding #interview #python #programming #walkthrough #tutorial #educational #beginners #easy #sol...
An Introduction to Dynamic Programming: N-th Tribonacci Number | LeetCode 75
Просмотров 1022 месяца назад
Walkthrough Solving LeetCode #509: Fibonacci Number and LeetCode #1137: N-th Tribonacci Number | LeetCode 75 Website: anishkganesh.com/ LinkedIn: www.linkedin.com/in/anishkganesh/ GitHub: github.com/anishkganesh Timestamps: 0:00 - Understanding The Problem 1:20 - Direct Fibonacci Number Solution 3:32 - DP Fibonacci Number Solution 6:32 - DP N-th Tribonacci Number Solution #leetcode #coding #int...
LeetCode #624: Maximum Distance in Arrays | LeetCode Daily
Просмотров 762 месяца назад
Walkthrough Solving LeetCode #624: Maximum Distance in Arrays | LeetCode Daily Website: anishkganesh.com/ LinkedIn: www.linkedin.com/in/anishkganesh/ GitHub: github.com/anishkganesh Timestamps: 0:00 - Understanding The Problem 1:15 - Solutioning by Drawing 3:30 - Solutioning through Code #leetcode #coding #interview #python #programming #walkthrough #tutorial #educational #beginners #easy #solu...
LeetCode #230: Kth Smallest Element in a BST | Top Interview 150
Просмотров 392 месяца назад
Walkthrough Solving LeetCode #230: Kth Smallest Element in a BST | Top Interview 150 Website: anishkganesh.com/ LinkedIn: www.linkedin.com/in/anishkganesh/ GitHub: github.com/anishkganesh Timestamps: 0:00 - Understanding The Problem 0:21 - Solutioning by Drawing 1:50 - Solutioning through Code #leetcode #coding #interview #python #programming #walkthrough #tutorial #educational #beginners #medi...
LeetCode #100: Same Tree | Top Interview 150
Просмотров 192 месяца назад
Walkthrough Solving LeetCode #100: Same Tree | Top Interview 150 Website: anishkganesh.com/ LinkedIn: www.linkedin.com/in/anishkganesh/ GitHub: github.com/anishkganesh Timestamps: 0:00 - Rant 0:16 - Understanding The Problem 2:05 - Solutioning through Code #leetcode #coding #interview #python #programming #walkthrough #tutorial #educational #beginners #easy #solution
LeetCode #530: Minimum Absolute Difference in BST | Top Interview 150
Просмотров 222 месяца назад
Walkthrough Solving LeetCode #530: Minimum Absolute Difference in BST | Top Interview 150 Website: anishkganesh.com/ LinkedIn: www.linkedin.com/in/anishkganesh/ GitHub: github.com/anishkganesh Timestamps: 0:00 - Understanding The Problem 0:16 - Solutioning by Drawing 2:32 - Solutioning through Code #leetcode #coding #interview #python #programming #walkthrough #tutorial #educational #beginners ...
LeetCode #840: Magic Squares In Grid | LeetCode Daily
Просмотров 1892 месяца назад
Walkthrough Solving LeetCode #840: Magic Squares In Grid | LeetCode Daily Website: anishkganesh.com/ LinkedIn: www.linkedin.com/in/anishkganesh/ GitHub: github.com/anishkganesh Timestamps: 0:00 - Understanding The Problem 1:00 - Solutioning by Drawing 5:32 - Solutioning through Code 9:55 - Mood 13:15 - Revelation #leetcode #coding #interview #python #programming #walkthrough #tutorial #educatio...
LeetCode #55: Jump Game | Top Interview 150
Просмотров 3732 месяца назад
LeetCode #55: Jump Game | Top Interview 150
LeetCode #169: Majority Element | Top Interview 150
Просмотров 4342 месяца назад
LeetCode #169: Majority Element | Top Interview 150
LeetCode #3016: Minimum Number of Pushes to Type Word II | LeetCode Daily
Просмотров 1162 месяца назад
LeetCode #3016: Minimum Number of Pushes to Type Word II | LeetCode Daily
LeetCode #2053: Kth Distinct String in an Array | LeetCode Daily
Просмотров 1763 месяца назад
LeetCode #2053: Kth Distinct String in an Array | LeetCode Daily
The Entirety of Linear Algebra in 12 Minutes
Просмотров 1603 месяца назад
The Entirety of Linear Algebra in 12 Minutes
LeetCode #1493: Longest Subarray of 1's After Deleting One Element | LeetCode 75
Просмотров 783 месяца назад
LeetCode #1493: Longest Subarray of 1's After Deleting One Element | LeetCode 75
LeetCode #1508: Range Sum of Sorted Subarray Sums
Просмотров 503 месяца назад
LeetCode #1508: Range Sum of Sorted Subarray Sums
LeetCode #104: Maximum Depth of Binary Tree
Просмотров 723 месяца назад
LeetCode #104: Maximum Depth of Binary Tree
LeetCode #1460: Make Two Arrays Equal by Reversing Subarrays
Просмотров 463 месяца назад
LeetCode #1460: Make Two Arrays Equal by Reversing Subarrays
What ARE The Odds Of That? (Card Trick)
Просмотров 1004 года назад
What ARE The Odds Of That? (Card Trick)
The Secret to REVERSING the Faces of ALL Cards but One (Beginner)
Просмотров 524 года назад
The Secret to REVERSING the Faces of ALL Cards but One (Beginner)
The Second Deal: An In-Depth Tutorial
Просмотров 2154 года назад
The Second Deal: An In-Depth Tutorial
The Secret To Doing The UNBELIEVABLE Two Card Monte
Просмотров 654 года назад
The Secret To Doing The UNBELIEVABLE Two Card Monte
The Secret behind The Spectator FINDING their Card
Просмотров 274 года назад
The Secret behind The Spectator FINDING their Card
Don't Help me reach 1000 subscribers.
Просмотров 924 года назад
Don't Help me reach 1000 subscribers.
How to Perform the Good and Evil Aces Card Trick
Просмотров 804 года назад
How to Perform the Good and Evil Aces Card Trick
How to Predict the Order the Cards End Up In
Просмотров 574 года назад
How to Predict the Order the Cards End Up In

Комментарии

  • @yangshunz
    @yangshunz 23 дня назад

    Minor correction - Grind 75 is not by LeetCode :)

  • @anish9411
    @anish9411 Месяц назад

    Sorry about the buggy audio! I'll get it fixed before next stream

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

    Great stuff! Someone like you deserves more than a 90% in leadership.

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

    Love from sholingnallur

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

    Can you do a video on how to expand (a+b)^3

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

    I think you can also do this in O(1) space without using a map since the majority element occurs more than 50% of time. You can just use a simple count variable.

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

      Hey Akshay! Thanks for the feedback! Do we know a way to find an element that occurs over 50% of the time without going through at least n/2 elements?

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

    Love the thumbnail art style. It’s very unique and you should stick to it

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

      Appreciate the feedback, Haresh! Glad you're enjoying the content

  • @AmyFetcher
    @AmyFetcher 3 месяца назад

    what do you use for your hair?

    • @arjpman5870
      @arjpman5870 3 месяца назад

      word on the street is that he uses head and shoulders 😮

  • @nuggetlover1440
    @nuggetlover1440 3 месяца назад

    Wow, great solution. This was my initial idea: Initialization: Initialize max_length to 0. This variable will store the maximum length of contiguous 1's found after "removing" each element. Iterate Over the Array: For each element in the array, consider it as the element to be removed. This involves temporarily ignoring the element and calculating the length of the longest contiguous subarray of 1's that includes elements before and after the "removed" element. Calculate Length of 1's Around the Removed Element: For each element at index i: If the element is 0, calculate the length of contiguous 1's to the left (left_ones) and to the right (right_ones). The length of contiguous 1's after "removing" this element is the sum of left_ones and right_ones. Update the Maximum Length: Update max_length with the maximum value found by considering the current length of 1's after "removing" the element at index i. Special Case Handling: If the array contains all 1's, the result should be the total number of elements minus one, since we must remove one element. I like yours more, because it is simpler, but it was pretty embarrassing how you didn't realize the last sum wouldn't be appended because I noticed that.

  • @rohandey4667
    @rohandey4667 4 года назад

    vid was too long bro😅...keep it short..

  • @skepster.
    @skepster. 4 года назад

    Smart asf

  • @madisonsummers8302
    @madisonsummers8302 4 года назад

    Good job 👏👍

    • @anish9411
      @anish9411 4 года назад

      Thank you, Madison

  • @ITZ_ANTT_
    @ITZ_ANTT_ 4 года назад

    LOVE THAT TRICK YA PULLED OFF ON ME!! HOPE TO SEE YOU AGAIN DO THEM TRICKS AGAIN

    • @anish9411
      @anish9411 4 года назад

      ayy thank you so much brother

  • @arjpman5870
    @arjpman5870 4 года назад

    gaming content pls with Facecam

  • @madhavkapa5489
    @madhavkapa5489 4 года назад

    Nice video

  • @pancakepiano7892
    @pancakepiano7892 4 года назад

    u did this to me on omegle and i was lost

    • @anish9411
      @anish9411 4 года назад

      haha.. well now you know

  • @krishvora571
    @krishvora571 4 года назад

    if people invest in this will they get a share of sour candy if yes then i'll help

  • @arjpman5870
    @arjpman5870 4 года назад

    Are you sponsored by OCEAN?

    • @anish9411
      @anish9411 4 года назад

      No. i sponsor the OCEAN

  • @krishvora571
    @krishvora571 4 года назад

    0:22 removes 50 cards from pack of 52 remains with 4 cards bro teach us how to get those extra 2 cards teleported into our packs too

    • @krishvora571
      @krishvora571 4 года назад

      (p.s. good trick dont strafe me k thanks :) )

    • @anish9411
      @anish9411 4 года назад

      Bro, 2 jokers are there as well. :)

  • @bvbmusic6989
    @bvbmusic6989 4 года назад

    Nice video and trick man

  • @agrimpandey5157
    @agrimpandey5157 5 лет назад

    Great video but many might not understand such a complex topic like vectors(i.e. i^ or j^). Same stands for matrices. Still all the best. Check out my video though.

  • @thilagaumesh3626
    @thilagaumesh3626 5 лет назад

    Brilliant!! Well presented . Good luck Anish 👍🏻👍🏻

  • @theblockfoot5015
    @theblockfoot5015 5 лет назад

    This was very useful. I understood everything. Thank you! :)

  • @eswarijayachandran4695
    @eswarijayachandran4695 5 лет назад

    Nice presentation, Anish. Good Luck!

    • @srisrinivas
      @srisrinivas 5 лет назад

      Finally I understood linear algebra. Great job Anish !!!