Problem Link: SEAKAM
Topic: Bitmask Dp
Explanation: GKCS
implementation:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
...
Showing posts with label DP. Show all posts
Showing posts with label DP. Show all posts
E. Tetrahedron
Explanation: tetrahedron, rachitJain
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode...
CodeMonk (Dynamic Programming Part- I )
CodeMonk (Dynamic Programming Part- I )
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional...
Find if a string is interleaved of two other strings
Find if a string is interleaved of two other strings
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about...
Cutting a Rod
Cutting a Rod
Tushar Roy Video
Medium blog post
Implementation 01:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode...
Edit Distance
Edit Distance
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
...
Word Wrap Problem (text justification)
Resources:
Tushar Roy Video
LeetCode Video
MIT Lecture
Github link
Code:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor...
Longest Increasing Subsequence (LIS)
Resource:
Longest Increasing Subsequence (GFG)
LIS and variation
ডাইনামিক প্রোগ্রামিং এ হাতেখড়ি-৪
Problem:
990 - Diving for Gold
1501. Sense of Beauty
1167. Bicolored Horses
231 - Testing the CATCHER
10926 - How Many Dependencies?
10000 - Longest Paths
XMEN SOLUTTION
10635...
Some Basic DP Problem Solution
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Show...
Program for Fibonacci numbers
Code:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
...
কয়েন চেঞ্জ + রক ক্লাইম্বিং
ডাইনামিক প্রোগ্রামিং এ হাতেখড়ি-৩ (কয়েন চেঞ্জ + রক ক্লাইম্বিং)
Problem:
1017. Staircases
11331 - The Joys of Farming
11137 - Ingenuous Cubrency
Others Problem Solution:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than...
C. Codejamon Cipher
C. Codejamon Cipher
Explanation: Google Dynamic Programming Problem (APAC 2017 Round D)
Code:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor...
0/1 KnapSack
Resources:
GeeksForGeeks
HackerEarth
Codeforces
CF blog
Code:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor...
Longest Common Subsequence ( LCS )
Resources:
ডাইনামিক প্রোগ্রামিং: লংগেস্ট কমন সাবসিকোয়েন্স
GeekGeeks
Practice Dynamic Programming! Educational DP Contest: F - LCS
Tushar Roy Video
DP: Find elements of LCS ( Hackerrank Problem )
Code:
This file contains bidirectional Unicode text...
Binomial Coefficient
Binomial Coefficient
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
...
216 - Getting in Line
216 - Getting in Line
Topic: Travelling Salesman Problem
Solution 01: Github gist
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
...
Travelling Salesman Problem
Travelling Salesman Problem
CODING BLOCKS
Geeks for Geeks
Using Branch and Bound
visualgo-tsp
Implementation 01:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include<bits/stdc++.h>
using namespace std;
int dp[1<<20][20];
int...
B - Frog 2
B - Frog 2
Complexity: O(n*k)
Topic: Basic DP
solution:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#include<bits/stdc++.h>
using namespace std;
#define INF 1<<30
#define MAX 100005
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef...
A - Frog 1
A - Frog 1
Solution 01: IH19980412
//copy
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include<bits/stdc++.h>
using namespace std;
#define INF 1<<28
#define MAX 100005
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long...
Construct the Array
Construct the Array
Topic: DP
Complexity: O(n)
Solution:
Code:
const long long mod = 1000000000+7;long countArray(int n, int k, int x) { // Return the number of ways to fill in the array. vector<long long> a(n),...