ViewTube

In this video I will show you how I learned to code in LeetCode, give you some tips and considerations. Amazing channels to learn ...

website: https://drkode.org problem: https://leetcode.com/problems/word-search/description/ solution: ...

website: https://drkode.org Time Stamp 00:00 statement 00:22 Storyboard 01:44 drkode.org 01:52 Code Explanation 02:55 Code

Just a chill LeetCode solving session today Want to improve your problem-solving skills and build a real developer mindset?

website: https://drkode.org Time Stamp 00:00 Statement 00:15 Storyboard 01:02 drkode.org 01:10 Code explanation 01:30 Code

Happy number Complexity: - Time: O(n) - Space: O(n) Problem statement: ...

First letter to appear twice - solution 2 - English version The first solution could be found here: ...

Fizz buzz en español Descripción del problema: https://leetcode.com/problems/fizz-buzz/ Código de la solución: ...

Longest Palindromic substring Complexity: - Time: O(N^2) - Space: O(N) Problem statement: ...

Search insert position Complexity: - Time: O(log(n)) - Space: O(1) Problem statement: ...

Climbing stairs - English Problem statement: https://leetcode.com/problems/climbing-stairs/ Solution code: ...

Fizz buzz Complexity: Time: O(n) Space: O(1) Problem description: https://leetcode.com/problems/fizz-buzz/ Solution code: ...

Merge k sorted lists Complexity: - Time: O(N log N) - Space: O(log N) Problem statement: ...

Two Sum - English version Problem description: https://leetcode.com/problems/two-sum/description/ Solution code: ...

Count the number of good nodes Complexity: - Time: O( V + E) - Space: O(V + E) Problem statement: ...

Generate parenthesis Complexity - Time: O(N^2) - Space: O(2N) Problem statement: ...

LeetCode #CodeClue #code #clue An easy and detailed explanation of Add Two Numbers problem on LeetCode By Sadul Khod, ...

Validate binary search tree Complexity: - Time: O(n) where n is the number of nodes - Space: O (n) where n is the number of ...

Valid palindrome - English version Complexity: - Time: O(n) - Space: O(1) Problem description: ...

Longest valid parentheses Complexity: - Time: O(2N) - Space: O(1) Problem statement: ...