ViewTube

验证回文串复杂度： - 时间：O(n) - 空间：O(1) 问题描述： https://leetcode.cn/problems/valid-palindrome/ 解决方案代码： ...

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

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

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

Starting with the psychology of practice, this episode breaks down how to overcome fear and build coding skills through platforms ...

Addition of two numbers in Python using for loop. #shorts #viralvideo addition of two numbers in python using for loop. add two ...

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

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

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

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

First letter to appear twice - English version Problem description: https://leetcode.com/problems/first-letter-to-appear-twice/ ...

Longest substring without repeating characters Complexity: - Time: O(n) - Space: O(1) Problem statement: ...

Toeplitz Matrix Complexity: - Time: O (m x n) - Space: O (1) Problem statement: https://leetcode.com/problems/toeplitz-matrix/ ...

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

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

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

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

Performance optimization case study on LeetCode 52 "N-Queens". In the video I'll show path of optimization already decent ...

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

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