LeetCode #91: Decode Ways | Facebook Coding Interview

preview_player
Показать описание

Facebook Coding interview question - Decode Ways (Leetcode)
**** Best Books For Data Structures & Algorithms for Interviews:

#Facebook #CodingInterview #LeetCode #DecodeWays #Google
  1. Knowledge Center
  2. leetcode
  3. decode ways
  4. facebook
  5. facebook coding interview
  6. coding interview
Рекомендации по теме
Decode Ways - 0:15:25

Decode Ways - Dynamic Programming - Leetcode 91 - Python

91. Decode Ways 0:09:40

91. Decode Ways - LeetCode Python Solution

91. Decode Ways 0:27:30

91. Decode Ways | 3 Ways

91. Decode Ways 0:09:52

91. Decode Ways | LEETCODE MEDIUM | DYNAMIC PROGRAMMING | CODE EXPLAINER

Decode Ways - 0:12:12

Decode Ways - LeetCode 91 - Python

Decode Ways | 0:40:04

Decode Ways | Recursion | Memo | Bottom Up | Leetcode 91

Decode Ways | 0:22:22

Decode Ways | LeetCode 91 | C++, Java, Python

Total Ways To 0:11:58

Total Ways To Decode A String - Recursive Dynamic Programming Approach ('Decode Ways' on L...

Decode Ways (LeetCode 0:23:11

Decode Ways (LeetCode 91) | Full Solution with visuals | Recursion to Dynamic Programming

LeetCode 91. Decode 0:12:25

LeetCode 91. Decode Ways

Decode Ways - 0:08:45

Decode Ways - Leetcode 91 - Python

Decode Ways 0:07:31

Decode Ways

91. Decode Ways 0:08:25

91. Decode Ways - Day 1/31 Leetcode October Challenge

Decode Ways | 0:11:57

Decode Ways | Live Coding with Explanation | Leetcode #91

Leetcode 91 - 0:08:43

Leetcode 91 - Decode Ways (JAVA Solution Explained!)

Leetcode 91. Decode 0:18:46

Leetcode 91. Decode Ways

Meta Interview Question 0:05:26

Meta Interview Question - Decode Ways - LeetCode 91

Leetcode - Decode 0:09:30

Leetcode - Decode Ways (Python)

[Java] Leetcode 91. 0:28:28

[Java] Leetcode 91. Decode Ways [DP Distinct Ways #6]

Decode Ways | 0:13:06

Decode Ways | Leetcode 91 | Live coding session | LC December 24

91. Decode Ways 0:09:01

91. Decode Ways

LeetCode #91: Decode 0:13:16

LeetCode #91: Decode Ways | Facebook Coding Interview

LeetCode #91 - 0:17:27

LeetCode #91 - Decode Ways: Dynamic Programming

Leetcode Decode Ways 0:31:49

Leetcode Decode Ways || Intuition + Code + Explanation

Комментарии
Автор

This question was also asked to me in my Amazon interview recently for the role of SDE

poojaagarwal
Автор

Watched both versions, counterintuitive use of vals/counts.

annawilson
Автор

just amazing... one of the best explanation :)

PradeepKumar-sowq
Автор

class Solution {
public:
int numDecodings(string s) {
int n = s.size();
if (n == 0 || s[0] == '0') return 0; // If the string is empty or starts with '0', it can't be decoded

vector<int> dp(n + 1, 0); // dp[i] represents the number of ways to decode s[0:i]
dp[0] = 1; // Base case: one way to decode an empty string
dp[1] = 1; // One way to decode the string if the first character is valid (non-zero)

for (int i = 2; i <= n; i++) {
// Check single-digit decode possibility
if (s[i - 1] != '0') {
dp[i] += dp[i - 1];
}
// Check two-digit decode possibility
int twoDigit = stoi(s.substr(i - 2, 2));
if (twoDigit >= 10 && twoDigit <= 26) {
dp[i] += dp[i - 2];
}
}

return dp[n]; // Number of ways to decode the full string
}
};

abhisheksrivastava
Автор

I haven't Get How Val1 Val2 is working here..You explains Nice Sir...but this the single time i get confused

uavishal
Автор

This approach is so good bro, but a test case like "100" might not get a right answer, I guess. Just pointing out for greater good. Thanks again for your efforts to help people. Appreciate it.

balajik
Автор

0 understanding from this video time wasted

ravifoodvlogs