#leetcodemedium 搜索结果
Solved another problem which is based on sliding window technique. Leetcode 1004 - Max Consecutive Ones III Check reply to view my solution. #LeetcodeMedium #SlidingWindow #Arrays
Stop using arrays to solve linked list leetcode problems. Leetcode 92 - Reverse Linked List 2 - C++ #LeetcodeMedium #LinkedList
452. Minimum Number of Arrows to Burst Balloons. Leetcode problem solution in Golang. #Leetcode150 #LeetcodeMedium #Golang
I think this is the first medium level problem which I have solved using Go 🥳 Leetcode 2095 - Delete middle node of linked list - Solution in Go. #LeetcodeMedium #LinkedList #100DaysOfCode
I started my weekend by solving a Leetcode medium level problem. Leetcode 1493 - Longest subarray of ones after deleting one element - Solution in Go. #Leetcode #TwoPointers #LeetcodeMedium #Go #Golang
This problem can be easily solved if you are familiar with sliding window technique. Leetcode 1456 - Maximum number of vowels in a substring of given length - Leetcode Medium. Problem link - leetcode.com/problems/maxim… #Leetcode #LeetcodeMedium #Arrays
I spent some time to understand mathematical proof from editorial solution, this solution depends more on mathematical proof than coding skills for sure. Leetcode 179: Largest Number: Solution in Go. #LeetcodeMedium #DSA #Golang #Go
“Marked the numbers, flipped the signs, and caught the sneaky duplicates. Clean, fast, and memory-wise. ⚡ #LeetCodeMedium #JavaMastery #CodeSmart”
C++ developers love linked list based questions 😇 Leetcode 19 - Remove Nth node from end of the list. Problem link - leetcode.com/problems/remov… #LeetcodeMedium #LinkedList #cpp #LeetcodeSolution
🔢 #50 Pow(x, n) — Raise x to power n ⚡ Don’t multiply x again & again! Use Fast Power: 👉 If n even: xⁿ = (x²)ⁿ⁄² 👉 If n odd: xⁿ = x × (x²)ⁿ⁄² 👉 If n < 0: flip → x = 1/x, n = -n ⏱ Time: O(log n) 📦 Space: O(1) #SmartMath #BinaryPower #LeetCodeMedium
🚧 #63 Unique Paths II Robot in m×n grid w/ obstacles (1). Only moves ⬇️➡️. Find unique paths to bottom-right! 📦 Ex: [[0,0,0],[0,1,0],[0,0,0]] → 2 ✅ 📊 DP: dp[i][j]=0 if obs; else dp[i-1][j]+dp[i][j-1] ⏱ O(mn), 🗂 O(mn) #UniquePathsII #DP #LeetCodeMedium #InterviewReady
🛤️ #64 Minimum Path Sum Find the min path sum in an m×n grid, moving only ⬇️ or ➡️. Ex: [[1,3,1],[1,5,1],[4,2,1]] → 7 ✅ (path: 1→3→1→1→1) 💡 DP trick: dp[i][j] = grid[i][j] + min(top,left) ⏱ O(mn), 🗂 O(mn)/O(n). #DynamicProgramming #LeetCodeMedium #InterviewReady
🔢 #57 Insert Interval You’ve got sorted, non-overlapping intervals & a new one barging in 🛬 💥 Slide it in! ✅ Add before it 🔄 Merge overlaps 🚀 Drop it in 📥 Add the rest! Ex: [[1,3],[6,9]], [2,5] → [[1,5],[6,9]] ⏱️ O(n) | 📦 O(n) #SmartMerge #GreedyMoves #LeetCodeMedium
🛣️ #71 Simplify Path Simplify a Unix-style absolute path. / separates dirs, . = current, .. = parent. Remove extra slashes. Ex: "/home/"→"/home", "/a/./b/../../c/"→"/c" ✅ ⏱ O(n) | 📦 O(n) #SimplifyPath #StringParsing #LeetCodeMedium #UnixPaths #EdgeCases
#74 Search 2D Matrix Matrix sorted row-wise & first of each row > last of prev. Find target ✅ ⚡ Trick: treat it as 1D → Binary Search! row=mid/n, col=mid%n ⏱ O(log(mn)) | 💾 O(1) #Search2DMatrix #BinarySearch #LeetCodeMedium #InterviewReady
#73 Set Matrix Zeroes 🟦 Given an m×n matrix, if an element = 0 → set its row & col to 0. ⚡ In-place, O(1) space: use 1st row/col as markers → mark, zero out, then fix 1st row/col. 📊 Time: O(mn) | Space: O(1) #SetMatrixZeroes #LeetCodeMedium #InterviewReady
Something went wrong.
Something went wrong.
United States Trends
- 1. Seahawks 31.5K posts
- 2. Rams 42K posts
- 3. Cooper Kupp 1,180 posts
- 4. Puka 29.6K posts
- 5. Salem 28.5K posts
- 6. Sam Darnold 2,422 posts
- 7. Kenneth Walker 1,345 posts
- 8. #TNFonPrime 2,523 posts
- 9. Kennedy Center 97.2K posts
- 10. Jalen Johnson 2,079 posts
- 11. Hornets 5,792 posts
- 12. Jobe N/A
- 13. McVay 2,692 posts
- 14. Hunger Games 55.5K posts
- 15. New Hampshire 11.8K posts
- 16. Stafford 8,295 posts
- 17. Trae 15.3K posts
- 18. Colby Parkinson 1,757 posts
- 19. Terrance Ferguson N/A
- 20. #LARvsSEA N/A