#leetcodemedium search results
Stop using arrays to solve linked list leetcode problems. Leetcode 92 - Reverse Linked List 2 - C++ #LeetcodeMedium #LinkedList
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
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
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
🔢 #81 Search in Rotated Sorted Array Find a target in a sorted array rotated at a pivot. 🎯 Use modified binary search: check which half is sorted, then narrow search. Input: [4,5,6,7,0,1,2], target=0 → Output: 4 ✅ O(log n) time, O(1) space. #BinarySearch #LeetCodeMedium
![eninjain's tweet image. 🔢 #81 Search in Rotated Sorted Array
Find a target in a sorted array rotated at a pivot. 🎯 Use modified binary search: check which half is sorted, then narrow search.
Input: [4,5,6,7,0,1,2], target=0 → Output: 4 ✅
O(log n) time, O(1) space.
#BinarySearch #LeetCodeMedium](https://pbs.twimg.com/media/G2BxmoZW0AA8SKf.jpg)
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
“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
🚧 #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
![eninjain's tweet image. 🚧 #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](https://pbs.twimg.com/media/GzqTbGwb0AALHe5.jpg)
🛣️ #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
🛤️ #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
![eninjain's tweet image. 🛤️ #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](https://pbs.twimg.com/media/GzqZ-KdaAAA3-Qt.jpg)
🔢 #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
#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
🔢 #77 Combinations Given n & k, return all k-number combinations from 1..n. ⚡ Use backtracking: build recursively, track current combo, add when size=k. 📦 Example: n=4, k=2 → [ [1,2],[1,3],[1,4],[2,3],[2,4],[3,4] ] #Combinations #Backtracking #LeetCodeMedium
![eninjain's tweet image. 🔢 #77 Combinations
Given n &amp; k, return all k-number combinations from 1..n.
⚡ Use backtracking: build recursively, track current combo, add when size=k.
📦 Example: n=4, k=2 → [ [1,2],[1,3],[1,4],[2,3],[2,4],[3,4] ]
#Combinations #Backtracking #LeetCodeMedium](https://pbs.twimg.com/media/G1XArn1WkAEQ980.jpg)
Something went wrong.
Something went wrong.
United States Trends
- 1. TravisScott 6,178 posts
- 2. #FanCashDropPromotion 1,410 posts
- 3. Merry Christmas 152K posts
- 4. Good Friday 53.5K posts
- 5. Tucker 125K posts
- 6. Isiah 1,930 posts
- 7. Strahm 1,302 posts
- 8. #FridayVibes 3,596 posts
- 9. Ben Shapiro 68.4K posts
- 10. Lifesaving 4,727 posts
- 11. #FridayMotivation 2,895 posts
- 12. Jonathan Bowlan N/A
- 13. #FridayFeeling 2,438 posts
- 14. #FursuitFriday 11.8K posts
- 15. RED Friday 2,688 posts
- 16. Algorhythm Holdings N/A
- 17. Myrtle Beach Bowl N/A
- 18. Happy Friyay 1,118 posts
- 19. Pine Green N/A
- 20. Kennesaw State N/A