I Built the Matrix with HTML, CSS & JavaScript 💚💻 #shorts
0:11
I Built the Matrix with HTML, CSS & JavaScript 💚💻 #shorts
601 views2 weeks ago
YouTubeCodeGlow
Playing with NumPy in Python | Matrices #3 | Arrays, Shape & Useful Functions
7:37
Playing with NumPy in Python | Matrices #3 | Arrays, Shape & Useful Functions
3 views2 weeks ago
YouTubeQuick Code Lab
Matrix multiplication in C from scratch
1:22:32
Matrix multiplication in C from scratch
11.6K views1 week ago
YouTubeRichard van der Oost
How to Make Matrix Hacker Effect on Mobile 😈🔥 | SPCK Editor Coding #shorts #coding
0:16
How to Make Matrix Hacker Effect on Mobile 😈🔥 | SPCK Editor Coding #shorts #coding
134 views1 week ago
YouTubeChirag Code
C++ 2D Arrays: Sum Each Column and Store in a 1D Array
14:16
C++ 2D Arrays: Sum Each Column and Store in a 1D Array
1 views3 weeks ago
YouTubeSHIN
Dynamic Programming Explained: Code Walkthrough for Optimal Solutions
0:42
Dynamic Programming Explained: Code Walkthrough for Optimal Solutions
7 views1 week ago
YouTubeAlgoJS
Minimum String Deletions with 2D Matrix!
0:56
Minimum String Deletions with 2D Matrix!
334 views1 week ago
YouTubeAlgoJS
8:10
Create Grid With Exactly One Path | LeetCode 3963 | Java Code | Developer Coder
7 views1 week ago
YouTubeDeveloper Coder
0:43
This simple code makes your Micro:bit sparkle #microbit #coding #diy
413 views3 weeks ago
YouTubeMoonpreneur
0:06
This Tiny Ring Displays the Iconic Matrix Code! 🤯
12.2K views2 weeks ago
YouTubeWonderLab
0:15
The Matrix Code Secret You Never Knew 🍣💚
178 views2 weeks ago
YouTubeFrame Minded
19:42
A Secret Message… DECODE It! — Elementary Matrices Explained |Linear Algebra Lecture 5 | ZMathLab
12 views4 weeks ago
YouTubeMuhammad Zubair
9:44
LeetCode POTD 27 Oct 2026 | 3963. Create Grid With Exactly One Path | C++
1 week ago
YouTubeSkillHub Student
3:37
Search a 2D Matrix (LeetCode 74) — Flatten It In Your Head | Code With Ian
3 weeks ago
YouTubeCode With Ian
2:49
Spiral Matrix | LeetCode 54 — 3 Ways Explained
150 views2 weeks ago
YouTubeCS in Frames
2:11
Leetcode until I land SWE internship Day 60 - 1143. Longest Common Subsequence (Bottom-Up DP) Time: O(m*n), Space: O(min(m, n)) Intuition: instead of creating m 1 by n 1 dp matrix, create two n 1 lists of 0s since we only need the row ahead of the current to update the current 1. check the length of text1 and text2 so that text1 points to shorter length string and text2 longer length string 2. define cur and prev, both of 0s of size n 1 to represent dp[i] and dp[i 1] 3. iterate i from m-1 to 0 4
353 views1 week ago
TikTokyourselflearning
0:23
Can you guess this Python list output? #shorts
604 views2 weeks ago
YouTubeWither codes
🔴 24/7 MATRIX MODE ⚡ Hacker Music • Cyberpunk Coding Ambient • Deep Focus
5K views1 week ago
YouTubeVIBE MOTORS
See more
Static thumbnail place holder