OFF-SITE 23 VIDEOS

Videos.

Gameplay runs and coding walkthroughs from the studio, hosted on YouTube — new uploads land here.

YOUTUBE CHANNEL @the-luci-studio View channel ↗
SHORTS 16 SHORTS

Sixty-second cuts of the walkthroughs — tap a card to play it right here.

Shorts
Written twice, divided never — LeetCode 238 in Dart
Shorts
The tallest day is worth almost nothing — LeetCode 121 in Dart
Shorts
Some steps compare nothing at all — LeetCode 125 in Dart
Shorts
The map vanishes when the shelf is sorted — LeetCode 167 in Dart
Shorts
Ask first, write after — LeetCode 1 in Dart
Shorts
A match is not an answer — LeetCode 34 in Dart
Shorts
Nothing is ever flipped — LeetCode 1004 in Dart
Shorts
The maximum is allowed to be wrong — LeetCode 424 in Dart
Shorts
It passes all three examples LeetCode prints — LeetCode 3 in Dart
Shorts
The two tallest lines are a decoy — LeetCode 11 in Dart
Shorts
Match brackets by subtracting them — LeetCode 20 in Dart
Shorts
Sorting is the deduplication, not the speed-up — LeetCode 15 in Dart
Shorts
MATCH counts filled slots, not letters — LeetCode 76 in Dart
Shorts
The wall is the pointer — LeetCode 42 in Dart
Shorts
LeetCode 209: 1196 ms vs under 1 ms — sliding window in Dart
Shorts
[1,1,1] answers 2, not 3 — LeetCode 1493 in Dart
LeetCode 20. Valid Parentheses in Dart — 3 stack solutions YouTube
Coding
LeetCode 20. Valid Parentheses in Dart — 3 stack solutions
LeetCode 15. 3Sum in Dart — O(n²) YouTube
Coding
LeetCode 15. 3Sum in Dart — O(n²)
LeetCode 76. Minimum Window Substring in Dart — O(n + m) YouTube
Coding
LeetCode 76. Minimum Window Substring in Dart — O(n + m)
LeetCode 42. Trapping Rain Water in Dart — O(n) YouTube
Coding
LeetCode 42. Trapping Rain Water in Dart — O(n)
LeetCode 1493. Longest Subarray of 1's After Deleting One Element in Dart — O(n) YouTube
Coding
LeetCode 1493. Longest Subarray of 1's After Deleting One Element in Dart — O(n)
LeetCode 424. Longest Repeating Character Replacement in Dart — sliding window, O(n) YouTube
Coding
LeetCode 424. Longest Repeating Character Replacement in Dart — sliding window, O(n)
LeetCode 3. Longest Substring Without Repeating Characters in Dart — sliding window, O(n) YouTube
Coding
LeetCode 3. Longest Substring Without Repeating Characters in Dart — sliding window, O(n)
LeetCode 34. Find First and Last Position of Element in Sorted Array in Dart — O(log n) YouTube
Coding
LeetCode 34. Find First and Last Position of Element in Sorted Array in Dart — O(log n)
LeetCode 1004. Max Consecutive Ones III in Dart — sliding window, O(n) YouTube
Coding
LeetCode 1004. Max Consecutive Ones III in Dart — sliding window, O(n)
LeetCode 209. Minimum Size Subarray Sum in Dart — sliding window, O(n) YouTube
Coding
LeetCode 209. Minimum Size Subarray Sum in Dart — sliding window, O(n)
LeetCode 11. Container With Most Water in Dart — two pointers, O(n) YouTube
Coding
LeetCode 11. Container With Most Water in Dart — two pointers, O(n)
LeetCode 121. Best Time to Buy and Sell Stock in Dart — O(n) YouTube
Coding
LeetCode 121. Best Time to Buy and Sell Stock in Dart — O(n)
LeetCode 125. Valid Palindrome in Dart — O(n) YouTube
Coding
LeetCode 125. Valid Palindrome in Dart — O(n)
LeetCode 167. Two Sum II - Input Array Is Sorted in Dart — O(n) YouTube
Coding
LeetCode 167. Two Sum II - Input Array Is Sorted in Dart — O(n)
LeetCode 238. Product of Array Except Self in Dart — O(n) YouTube
Coding
LeetCode 238. Product of Array Except Self in Dart — O(n)
LeetCode 110. Balanced Binary Tree in Dart — O(n) YouTube
Coding
LeetCode 110. Balanced Binary Tree in Dart — O(n)
LeetCode 347. Top K Frequent Elements in Dart — bucket sort, O(n) YouTube
Coding
LeetCode 347. Top K Frequent Elements in Dart — bucket sort, O(n)
LeetCode 49. Group Anagrams in Dart — O(n·k) YouTube
Coding
LeetCode 49. Group Anagrams in Dart — O(n·k)
LeetCode 104. Maximum Depth of Binary Tree in Dart — O(n) YouTube
Coding
LeetCode 104. Maximum Depth of Binary Tree in Dart — O(n)
LeetCode 1. Two Sum in Dart — hash map, O(n) YouTube
Coding
LeetCode 1. Two Sum in Dart — hash map, O(n)
LeetCode 222. Count Complete Tree Nodes in Dart — O(log²n) YouTube
Coding
LeetCode 222. Count Complete Tree Nodes in Dart — O(log²n)
LeetCode 27. Remove Element in Dart — two pointers, O(n) / O(1) YouTube
Coding
LeetCode 27. Remove Element in Dart — two pointers, O(n) / O(1)
Free 2.5D falling-block puzzle in your browser — Faldrop gameplay YouTube
Gameplay
Free 2.5D falling-block puzzle in your browser — Faldrop gameplay
END OF SHEET — LET'S BUILD

Got a hard problem? Let's talk.