LeetCode 3723 Java Solution 🔥 | Maximize Sum of Squares of Digits | Greedy Algorithm
0:13
LeetCode 3723 Java Solution 🔥 | Maximize Sum of Squares of Digits | Greedy Algorithm
已浏览 151 次3 周前
YouTubeEslihai_coding
Remove Duplicates from Sorted Array | LeetCode 26 | Two Pointers
1:27
Remove Duplicates from Sorted Array | LeetCode 26 | Two Pointers
已浏览 870 次3 周前
YouTubeAlgoMonster
LRU Cache FAILS With Redis (And How To Fix It) | LeetCode LRU Cache Question
1:33
LRU Cache FAILS With Redis (And How To Fix It) | LeetCode LRU Cache Question
已浏览 769 次1 周前
YouTubeVivek Gupta
Valid Parentheses Explained Visually | LeetCode 20 | Stack
1:32
Valid Parentheses Explained Visually | LeetCode 20 | Stack
已浏览 183 次2 周前
YouTubeTech with Mathan
Validate Binary Search Tree: The Common Mistake | LeetCode 98
1:20
Validate Binary Search Tree: The Common Mistake | LeetCode 98
已浏览 593 次2 周前
YouTubeJames Peralta
LeetCode 56 - Merge Intervals
2:33
LeetCode 56 - Merge Intervals
已浏览 1667 次2 周前
YouTubeDev Rick
Climbing Stairs | LeetCode 70 | Dynamic Programming
1:29
Climbing Stairs | LeetCode 70 | Dynamic Programming
已浏览 1612 次1 个月前
YouTubeAlgoMonster
0:27
Stop Doing Random LeetCode Problems as a Beginner
已浏览 1411 次3 个月之前
YouTubeJames Peralta
0:12
leetcode 1541 || Java || String || balanced || #dsa #java #programming #codinglife #ai #journey
已浏览 402 次1 个月前
YouTubeCoderX
0:13
This looks like a DP problem… but there’s a beautiful combinatorics trick hiding underneath
已浏览 439 次1 个月前
YouTubeEslihai_coding
0:43
LeetCode Is Dead For AI Hiring. Here's What Replaced It.
已浏览 1.3万 次1 个月前
YouTubecodebasics
0:37
The Future of Amazon's Frontier AI Models - Insider Reveals
已浏览 540 次2 个月之前
YouTubeNaman Pandey
0:14
#leetcode #csmajor #interstellar #internship | leetcode
已浏览 4.4万 次1 周前
TikTokandythropic
2:45
My Coding interview cheat sheet for Google / Amazon. I've done 1300 problems solved, but communication is key. Roadmap for high-paying tech jobs explained. #CodingInterview #TechJobs #LeetCode #SoftwareEngineering #Waymo #Raymond
已浏览 2.3万 次4 周前
TikToktherealraymondjones
0:37
La entrevista técnica: LeetCode Son difíciles (yo me eché muchas) y en Chile no tenemos cultura de LeetCode. Te ponen un puzzle, casi de matemática pura, y tienes que programarlo compartiendo pantalla, o a veces hasta en papel o en Google Docs. #leetcode #entrevistas #programacion #trabajoenusa #chile
已浏览 637 次2 周前
TikTokvicente.id
1:22
Bắt tay vào giải luôn nhé ae Dev - Leetcode bài tuyển dụng: Tìm kí tự không lặp lại đầu tiên trong 1 chuỗi (P1: Phân tích bài toán) 👉 Xem bản đầy đủ tại Youtube: MindX Technology School #coding #developer #IT #leetcode #fullstackdeveloper #fullstackwebsite #mindx
已浏览 9092 次8 个月之前
TikTokmindxschool
1:20
Reverse Degree of a String — LeetCode 3498 Full Submission(Python) Given a string s, calculate its reverse degree. The reverse degree is calculated as follows: For each character, multiply its position in the reversed alphabet ('a' = 26, 'b' = 25, ..., 'z' = 1) with its position in the string (1-indexed). Sum these products for all characters in the string. Return the reverse degree of s. Example 1: Input: s =
已浏览 315 次1 周前
TikToklindorcodes
0:29
Google is piloting a coding interview that allows AI, and people say LeetCode is dead. It isn't. The new round grades catching Gemini when it's wrong, and that takes knowing the code. Code and sources: github.com/Sun-Deep/coding-chops #google #leetcode #dsa #softwareengineering #coding
已浏览 383 次2 周前
TikTokcodingchops.dev
0:51
Chris Lattner, creator of Swift and LLVM, says LLMs being great at LeetCode doesn't mean programmers are done. They can reverse a linked list like crazy and memorize standard answers, but building real things is about working with people, understanding the problem and figuring out what customers actually need. His take: we don't have to compete with LLMs, they'll help automate the mechanical stuff, and we're not going to be done with coding. Need an internship? Visit sweintern.dev #softwareengin
已浏览 303 次1 周前
TikTokatraktosmm
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 次1 周前
TikTokyourselflearning
展开
静态缩略图占位符