Leetcode Weekly contest 325 - Hard - Number of Great Partitions

preview_player
Показать описание
In this video we discuss the fourth problem of Leetcode Weekly contest 325

  1. Prakhar Agrawal
  2. #coding
  3. #leetcode
  4. #dsa
  5. competitive programming
  6. #faang
Рекомендации по теме
Leetcode 2518 Number 0:19:03

Leetcode 2518 Number of Great Partitions | Leetcode Weekly contest 325

Only one clean 0:53:19

Only one clean problem! Leetcode Weekly Contest 325 (Argh) with commentary

Number of Great 0:11:43

Number of Great Partitions | 2518 LeetCode | Dynamic Programming | Leetcode Weekly Contest 325

Weekly Contest 325 0:20:54

Weekly Contest 325 | Number of Great Partitions

Leetcode Weekly contest 0:05:20

Leetcode Weekly contest 325 - Easy - Shortest Distance to Target String in a Circular Array

2518. Number of 0:14:14

2518. Number of Great Partitions | Dynamic Programming | Leetcode Weekly Contest 325| LeetCode

Weekly Contest 325 0:21:27

Weekly Contest 325 | Maximum Tastiness of Candy Basket

LeetCode Weekly Contest 0:13:16

LeetCode Weekly Contest 325

Leetcode Weekly contest 0:11:06

Leetcode Weekly contest 325 - Medium - Maximum Tastiness of Candy Basket

Leetcode Weekly contest 0:11:44

Leetcode Weekly contest 325 - Hard - Number of Great Partitions

Maximum Tastiness of 0:10:52

Maximum Tastiness of Candy Basket | 2517 LeetCode | Binary Search | Leetcode Weekly Contest 325

Leetcode | Weekly 0:17:55

Leetcode | Weekly Contest 325 | 2516 Take K of Each Character From Left and Right

Leetcode Weely Contest 0:20:16

Leetcode Weely Contest 325 | 2516 : Take K Of Each Character From Left And Right Solution

Number of Great 0:11:28

Number of Great Partitions (Leetcode Weekly 325)

Leetcode | Weekly 0:13:45

Leetcode | Weekly Contest 325 | 2517 Maximum Tastiness of Candy Basket

Maximum Tastiness of 0:08:22

Maximum Tastiness of Candy Basket(Leetcode Weekly 325)

Leetcode Weekly contest 0:09:17

Leetcode Weekly contest 325 - Medium - Take K of Each Character From Left and Right

LeetCode Weekly Contest 0:26:35

LeetCode Weekly Contest 325| problem B| 2516. Take K of Each Character From Left and Right| 24/12/22

Weekly Contest 325 0:21:38

Weekly Contest 325 | Take K of Each Character From Left and Right

Take K of 0:17:49

Take K of Each Character From Left and Right | 2516 LeetCode | Leetcode Weekly Contest 325

Leetcode 325 0:09:42

Leetcode 325

Leetcode 2517 Maximum 0:16:54

Leetcode 2517 Maximum Tastiness of Candy Basket problem from Leetcode Weekly contest 325.

Leetcode Weely Contest 0:24:44

Leetcode Weely Contest 325 | 2518 : Number Of Great Partitions Solution | Newton School

Leetcode Weekly Contest 0:15:27

Leetcode Weekly Contest 325| Short. Dis. to Target Str in a Cir Array| Max Tastiness of Candy Basket

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

Good solution. In today's contest, I got stuck with a test case for 4th problem. I forgot to add mod after taking the difference. Silly mistake.

cwmayank
Автор

If you don't mind, can you explain me the formula that you were subtracting 2 times of dp(n, k-1) from 2^n?

charanganesh