ViewTube

Two Sum - English version Problem description: https://leetcode.com/problems/two-sum/description/ 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

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

Add two numbers Complexity: - Time: O(n) - Space: O(1) Problem statement: https://leetcode.com/problems/add-two-numbers/ ...

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

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

Linked list cycle Complexity: Time: O(n + m) Space: O(1) Problem statement: ...

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

Container with most water Complexity: - Time: O(N) - Space: O(1) Problem statement: ...

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

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

Find first and last position of element in sorted array Complexity: - Time: O(log(n)) - Space: O(1) Problem statement: ...

Roman to integer - English version Complexity: - Time: O(n) - Space: O(1) Problem description: ...

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

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

Binary search - English Problem statement: https://leetcode.com/problems/binary-search/description/ Solution code: ...

we provide you tips and tricks of computer science to be tech geeks. the motive of this channel is to provide basics to advanced ...

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

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

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