- 1 089
- 121 861
Sleepy Cracker
Taiwan
เข้าร่วมเมื่อ 17 เม.ย. 2021
#LeetCode 1421 |. NPV Queries #SQL
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing
Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
มุมมอง: 0
วีดีโอ
#LeetCode 3005 | Count Elements With Maximum Frequency #Java
มุมมอง 14 ชั่วโมงที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 570 | Managers with at Least 5 Direct Reports #SQL
มุมมอง 14 ชั่วโมงที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 1784 | Check if Binary String Has at Most One Segment of Ones #Java
มุมมอง 14 ชั่วโมงที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 2989 | Class Performance #SQL
4 ชั่วโมงที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 3000 | Maximum Area of Longest Diagonal Rectangle #Java
4 ชั่วโมงที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 1571 | Warehouse Manager #SQL
มุมมอง 14 ชั่วโมงที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 2390 | Removing Stars From a String #Java
มุมมอง 1521 ชั่วโมงที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 1633 | Percentage of Users Attended a Contest #Java
มุมมอง 721 ชั่วโมงที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 2923 | Find Champion I #Java
มุมมอง 621 ชั่วโมงที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 2570 | Merge Two 2D Arrays by Summing Values #Java
มุมมอง 1014 วันที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 1874 | Minimize Product Sum of Two Arrays #Java
มุมมอง 1714 วันที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 1083 | Sales Analysis II #Java
มุมมอง 1521 วันที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 2176 | Count Equal and Divisible Pairs in an Array #Java
มุมมอง 1221 วันที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 2853 | Highest Salaries Difference #Java
มุมมอง 621 วันที่ผ่านมา
Questions in English: docs.google.com/spreadsheets/d/1QNSEok-WD4LCPTrZlqq5VVTX0NbXQf27WUjkGi3aBu0/edit?usp=sharing Questions in Mandarin: docs.google.com/spreadsheets/d/1aMCmSLucm7I_7BIRz1SqHy8c1D9h_6M8XAkrqWXSy8Y/edit?usp=sharing
#LeetCode 3024 | Type of Triangle #Java
มุมมอง 821 วันที่ผ่านมา
#LeetCode 3024 | Type of Triangle #Java
#LeetCode 3014 | Minimum Number of Pushes to Type Word I #Java
มุมมอง 1021 วันที่ผ่านมา
#LeetCode 3014 | Minimum Number of Pushes to Type Word I #Java
#LeetCode 2960 | Count Tested Devices After Test Operations #Java
มุมมอง 1021 วันที่ผ่านมา
#LeetCode 2960 | Count Tested Devices After Test Operations #Java
#LeetCode 1865 | Finding Pairs With a Certain Sum #Java
มุมมอง 621 วันที่ผ่านมา
#LeetCode 1865 | Finding Pairs With a Certain Sum #Java
#LeetCode 2937 | Make Three Strings Equal #Java
มุมมอง 721 วันที่ผ่านมา
#LeetCode 2937 | Make Three Strings Equal #Java
#LeetCode 2352 | Equal Row and Column Pairs #Java
มุมมอง 1021 วันที่ผ่านมา
#LeetCode 2352 | Equal Row and Column Pairs #Java
#LeetCode 1661 | Average Time of Process per Machine #SQL
มุมมอง 621 วันที่ผ่านมา
#LeetCode 1661 | Average Time of Process per Machine #SQL
#LeetCode 659 | Split Array into Consecutive Subsequences #Java
มุมมอง 921 วันที่ผ่านมา
#LeetCode 659 | Split Array into Consecutive Subsequences #Java
#LeetCode 1353 | Maximum Number of Events That Can Be Attended #Java
มุมมอง 16หลายเดือนก่อน
#LeetCode 1353 | Maximum Number of Events That Can Be Attended #Java
#LeetCode 2210 | Count Hills and Valleys in an Array #Java
มุมมอง 11หลายเดือนก่อน
#LeetCode 2210 | Count Hills and Valleys in an Array #Java
#LeetCode 2520 | Count the Digits That Divide a Number #Java
มุมมอง 10หลายเดือนก่อน
#LeetCode 2520 | Count the Digits That Divide a Number #Java
#LeetCode 1380 | Lucky Numbers in a Matrix #Java
มุมมอง 70หลายเดือนก่อน
#LeetCode 1380 | Lucky Numbers in a Matrix #Java
#LeetCode 1399 | Count Largest Group #Java
มุมมอง 17หลายเดือนก่อน
#LeetCode 1399 | Count Largest Group #Java
Very cool technique. Thank you :-)
U could provide a link to the codebase or preferably give the code in the comments. :)
good advice, but I don't like to give away code like that.
Bruteforce method and 5 ms runtime :(
thanks a lot!
If you are making video of something , shouldn't you be clear and well heard . additionally you should pronounce words properly .just a feedback after watching your video
thanks for watching. I am making the video for myself. Best,
Good Approach💯
Thank you for the code and the explanation. Keep up the good work.
Best Explaination
thank you man :)
Dude, thanks!
NICE SUPER EXCELLENT MOTIVATED
Bro's cooking very quiet in silence
those keyboard clicks are so irritating
I am a gamer
Thank you bhaiya, it is very helpful 😊
❤me too lol
similar question: th-cam.com/video/hwgZAy8oRRk/w-d-xo.html
similar question: th-cam.com/video/HVBxIP1zcPY/w-d-xo.html
the old video can be accessed through here: th-cam.com/video/rtkAsSUjpQ0/w-d-xo.html However, youtube currently disable people to view it report: th-cam.com/users/postUgkxRzAU91_3AwBrjd3otZb0lrKsueNfbiac
nice explanation!
Bro get a decent mic
Apologies, it was crafted two years back. However, the setup wasn't prepared at that time.
@@sleepycracker4732 No worries, great explanation tho
good solutions and easily understandable.
awesome, keep it up!
❤
I really appreciate your channel 🙌. I'm going to start doing leetcode again this month
great logic bro ...
you use js now!
I only know .length in js
good
Best explanation with Diagram, was struggling to understand this problem
very good solution and explanation
This is a genius solution, I couldn't fathom a bit of this. I tried to do a sliding window and splice out from the window.
Can you explain it clearly
Where did you get lost?
2 Pointer: th-cam.com/video/BAKrAvGFL3Q/w-d-xo.html HashMap: th-cam.com/video/ze_viMxD9n8/w-d-xo.html
DFS version1:th-cam.com/video/KCaledGy-S8/w-d-xo.html DFS version2: th-cam.com/video/O9draJvnIFc/w-d-xo.html BFS: th-cam.com/video/eFRiufqFf2I/w-d-xo.html
AWESOME
old version: th-cam.com/video/IFmj-Jb3Hhg/w-d-xo.html
if we iterate the bucket the tc is o(n) and than we iterate the list the tc is o(k) so why not ther tc of this soln is o(n*k), why its o(n) , if n is 9 and the k is 6 so u cant neglect the k
k is a given input which should be a constant in the question. However, I agree with you that the complexity of this solution is O(N*k).
old version: th-cam.com/video/nglC6G23SOM/w-d-xo.html
Brillant explanation thanks buddy
old version: th-cam.com/video/pxbyjog6BcQ/w-d-xo.html
Array: th-cam.com/video/v2HDOC8usew/w-d-xo.html DP: th-cam.com/video/ZR1TpHJnHq0/w-d-xo.html
DFS: th-cam.com/video/3jzDkW4_WTE/w-d-xo.html BFS: th-cam.com/video/P0xqYQoK3fs/w-d-xo.html
Oh, a reminder I need to practice! Will check out your other videos!
BFS old version: th-cam.com/video/lmoC2alK7nY/w-d-xo.html DFS old version: th-cam.com/video/EaWCmwsW_uc/w-d-xo.html
old version1: th-cam.com/video/ttOCXU2T_dE/w-d-xo.html old version2: th-cam.com/video/NGR2fZ3YAYA/w-d-xo.html
Please explain why atMost(k) - atMost(k-1) needed? I didn't dig deep to understand it.
think about this way. what are the sub array you have when k = 1? using the example 1: Input: nums = [1,2,1,2,3], the answer should be: 5. [1],[2],[1],[2],[3] what if k = 2? the answer is 7. [1,2], [2,1], [1,2], [2,3], [1,2,1], [2,1,2], [1,2,1,2]. but this is the sub arrays after you cut down the k=1 sub arrays. if you don't subtract the sub arrays, you should have [1],[2],[1],[2],[3],[1,2], [2,1], [1,2], [2,3], [1,2,1], [2,1,2], [1,2,1,2]. these are the result we have for atMost(2) in order to get the count of sub array to 7, we must minus atMost(1) hope this helps
@@sleepycracker4732 Yes it was not intuitive enough for me to figure out (j-i+1) is doing what you mentioned.
that is how we get the length of the subarray. it would be clear enough if you draw the index on a paper
@@sleepycracker4732 Yes I went to paper and drew it and it turned out true and made sense. Thanks
Good explanation brother 💯✨
Appreciate. This is the best solution on youtube.
Nice Explanation!
You are awesome 👌 bro. How can I learn coding like you bro. I'm using java for dsa.
keep learning and motivating yourself.
@@sleepycracker4732 actually what I'm facing problem is 1. Facing difficult to understand question. 2. If I get ans difficult to make logic 3. Sometime I able to make logic to unable to write in form of code.
start with easy questions, and think about how you may approach to the solution
@@sleepycracker4732 ok thnx buddy.
So f**king needy solution! Salute!