ViewTube

LeetCode 2207: Maximize Number of Subsequences in a String Difficulty: Medium Topics: Array, Dynamic Programming, ...

LeetCode 2030: Smallest K-Length Subsequence With Occurrences of a Letter Difficulty: Medium Topics: Array, Dynamic ...

LeetCode 1713: Minimum Operations to Make a Subsequence Difficulty: Hard Topics: Array, Binary Search, Dynamic ...

LeetCode 2014: Longest Subsequence Repeated k Times Difficulty: Hard Topics: Array, Backtracking, Breadth-First Search, ...

LeetCode 1955: Count Number of Special Subsequences Difficulty: Hard Topics: Array, Backtracking, Binary Search, Dynamic ...

LeetCode 2098: Subsequence of Size K With the Largest Even Sum Difficulty: Medium Topics: Array, Dynamic Programming, ...

LeetCode 1930: Unique Length-3 Palindromic Subsequences Difficulty: Medium Topics: Array, Backtracking, Dynamic ...

Join us live for Leetcode Weekly Contest 477 as we break down Problems A, B, C and D. New to CP or unsure of your level?

LeetCode 2015: Count Number of Special Subsequences Difficulty: Hard Topics: Array, Backtracking, Dynamic Programming, ...

LeetCode 1755: Closest Subsequence Sum Difficulty: Hard Topics: Array, Backtracking, Binary Search, Dynamic Programming, ...

LeetCode 2099: Find Subsequence of Length K With the Largest Sum Difficulty: Easy Topics: Array, Heap, Sorting ...

LeetCode 2002: Maximum Product of the Length of Two Palindromic Subsequences Difficulty: Medium Topics: Backtracking, ...

LeetCode 2005: Subtree Removal Game with Fibonacci Tree Difficulty: Hard Topics: Array, Binary Search, Binary Tree, ...

LeetCode 1923: Longest Common Subpath Difficulty: Hard Topics: Array, Binary Search, Dynamic Programming, Math, Sliding ...

LeetCode 1698: Number of Distinct Substrings in a String Difficulty: Medium Topics: Array, Dynamic Programming, Graph, ...

LeetCode 1987: Number of Unique Good Subsequences Difficulty: Hard Topics: Array, Dynamic Programming, Math, ...

https://neetcode.io/yt - A better way to prepare for Coding Interviews ‍ LinkedIn: ...

LeetCode 1911: Maximum Alternating Subsequence Sum Difficulty: Medium Topics: Array, Dynamic Programming, Greedy, ...

LeetCode 1898: Maximum Number of Removable Characters Difficulty: Hard Topics: Array, Binary Search, Dynamic ...

In this video, I explain the Russian Doll Envelopes problem (LeetCode 354) using an optimal O(n log n) approach. We start by ...