ViewTube

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

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

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:15 Storyboard 01:02 drkode.org 01:10 Code explanation 01:30 Code

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

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

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

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

Valid anagram - English version Problem description: https://leetcode.com/problems/valid-anagram/ Solution code: ...

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

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

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

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

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

Invert binary tree - English Problem statement: https://leetcode.com/problems/invert-binary-tree/description/ Solution code: ...

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

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

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

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