ViewTube

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

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

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

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

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

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

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

website: https://drkode.org Time Stamp 00:00 statement 00:14 Basics 00:38 Storyboard 01:52 drkode.org 01:59 Code explanation ...

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

In our first episode, we explore the classic problem of reversing a singly linked list with an animated conceptual explanation, and ...

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

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

Date: 23 July 2022 Collabwriting HackMD: https://hackmd.io/@pycontw/SkXlXpKoc Learning Python - A Journey (English) ...

Strengthen your skills in algorithmics and graph theory, and gain experience in programming in Python along the way. To follow ...

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

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

Create a fizz buzz game using python. Let's try the learn things in a fun way. Please Like, share, and subscribe.

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

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

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