Application Link - https://www.amazon.jobs/en/jobs/1391296/software-development-engineer
Amazon SDE Test Series- https://practice.geeksforgeeks.org/courses/Amazon-Test-Series
USE CODE - SKSAMAGFG for 10% off
Amazon SDE Test Series- https://practice.geeksforgeeks.org/courses/Amazon-Test-Series
USE CODE - SKSAMAGFG for 10% off
DP: Coin Change | Babbar Bhaiya के 450 Sawal
https://youtu.be/1SDVEVtKVpE
https://youtu.be/1SDVEVtKVpE
YouTube
DP: Coin Change | Babbar Bhaiya के 450 Sawal
Telegram- https://bit.ly/30jGLHZ
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/
Instagram- https://www.instagram.com/sksamayt/
Question…
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/
Instagram- https://www.instagram.com/sksamayt/
Question…
A + B : Replacing Elements + String LCM || Educational Codeforces Round 102 (Rated for Div. 2)
https://youtu.be/nGcwmWFUcNY
https://youtu.be/nGcwmWFUcNY
YouTube
A + B : Replacing Elements + String LCM || Educational Codeforces Round 102 (Rated for Div. 2)
#sksama #codeforces #codechef #div2 #solution #explanation #tuf #gfg
Telegram- https://bit.ly/30jGLHZ
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/…
Telegram- https://bit.ly/30jGLHZ
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/…
C. No More Inversions | Educational Codeforces Round 102 (Rated for Div. 2) | Hindi Video Editorial
https://youtu.be/wTDtWd3IXmE
https://youtu.be/wTDtWd3IXmE
YouTube
C. No More Inversions | Educational Codeforces Round 102 (Rated for Div. 2) | Hindi Video Editorial
#sksama #codeforces #codechef #div2 #solution #explanation #tuf #gfg
Telegram- https://bit.ly/30jGLHZ
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/…
Telegram- https://bit.ly/30jGLHZ
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/…
DP : Longest Common Subsequence : Babbar Bhaiya के 450 Sawal | FAANG Question
https://youtu.be/tAywcz33UiY
https://youtu.be/tAywcz33UiY
YouTube
DP : Longest Common Subsequence : Babbar Bhaiya के 450 Sawal | FAANG Question
Telegram- https://bit.ly/30jGLHZ
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/
Instagram- https://www.instagram.com/sksamayt/
Soluchan…
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/
Instagram- https://www.instagram.com/sksamayt/
Soluchan…
A + B : Puzzle From the Future + Different Divisors | Codeforces Round #696 (Div. 2) | sKSama
https://youtu.be/zudzkwn-JLY
https://youtu.be/zudzkwn-JLY
YouTube
A + B : Puzzle From the Future + Different Divisors | Codeforces Round #696 (Div. 2) | sKSama
#sksama #codeforces #codechef #div2 #solution #explanation #tuf #gfg
Telegram- https://bit.ly/30jGLHZ
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/…
Telegram- https://bit.ly/30jGLHZ
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/…
C. Array Destruction | Codeforces Round #696 (Div. 2) | Hindi Video Editorial | sKSama
https://youtu.be/9mzDatOpFXE
https://youtu.be/9mzDatOpFXE
YouTube
C. Array Destruction | Codeforces Round #696 (Div. 2) | Hindi Video Editorial | sKSama
#sksama #codeforces #codechef #div2 #solution #explanation #tuf #gfg
Telegram- https://bit.ly/30jGLHZ
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/…
Telegram- https://bit.ly/30jGLHZ
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/…
DP : LeetCode 198. House Robber | Easy 0-1 Knapsack Question Variation | sKSama | Hindi
https://youtu.be/cMrhmFxvL2w
https://youtu.be/cMrhmFxvL2w
YouTube
DP : LeetCode 198. House Robber | Easy 0-1 Knapsack Question Variation | sKSama | Hindi
#sksama #codeforces #codechef #div2 #solution #explanation #tuf #gfg
Telegram- https://bit.ly/30jGLHZ
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/…
Telegram- https://bit.ly/30jGLHZ
USE CODE - SKSAMAGFG for FLAT 10% off on all Geeks For Geeks Courses
https://practice.geeksforgeeks.org/courses/
Linkedin- https://www.linkedin.com/in/sksamayt/…
Those who are following the dp series try to solve this question
https://leetcode.com/problems/unique-paths-ii/
It really easy, just trying breaking the question in smaller one, i will be posting the solution tomorrow
https://leetcode.com/problems/unique-paths-ii/
It really easy, just trying breaking the question in smaller one, i will be posting the solution tomorrow
LeetCode
Unique Paths II - LeetCode
Can you solve this real interview question? Unique Paths II - You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n…
DP : LeetCode 63. Unique Paths I Dynamic Programming | sKSama | Hindi
https://youtu.be/b1iuGHXH1P0
https://youtu.be/b1iuGHXH1P0
YouTube
- YouTube
https://leetcode.com/problems/minimum-path-sum/
Very similar question, must try its easy, i will make the next video on this
Very similar question, must try its easy, i will make the next video on this
LeetCode
Minimum Path Sum - LeetCode
Can you solve this real interview question? Minimum Path Sum - Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path.
Note: You can only move either down or right…
Note: You can only move either down or right…
DP : LeetCode 64. Minimum Path Sum I Dynamic Programming | sKSama | Hindi
https://youtu.be/jFCx9ki-c7E
https://youtu.be/jFCx9ki-c7E
YouTube
- YouTube
Next DP question - This question was asked in Google Interview
And a Common Interview Question
https://leetcode.com/problems/maximal-square/
And a Common Interview Question
https://leetcode.com/problems/maximal-square/
LeetCode
Maximal Square - LeetCode
Can you solve this real interview question? Maximal Square - Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.
Example 1:
[https://assets.leetcode.com/uploads/2020/11/26/max1grid.jpg]…
Example 1:
[https://assets.leetcode.com/uploads/2020/11/26/max1grid.jpg]…