pranil-2k23

Longest Increasing Subsequence(DP)

2

Link of the question https://www.geeksforgeeks.org/longest-increasing-subsequence-dp-3/ Coding platform [ ] Hackerrank [ ] HackerEarth [ ] Codechef [ ] Codeforces [ ] Leetcode [ ] InterviewBit [ ] AtCoder [*] 450...

Longest Common Substring(DP)

2

Link of the question https://www.geeksforgeeks.org/longest-common-substring-dp-29/ Coding platform [ ] Hackerrank [ ] HackerEarth [ ] Codechef [ ] Codeforces [ ] Leetcode [ ] InterviewBit [ ] AtCoder [*] 450...

Shortest Common Supersequence(DP)

3

Link of the question https://www.geeksforgeeks.org/shortest-common-supersequence/ Coding platform [ ] Hackerrank [ ] HackerEarth [ ] Codechef [ ] Codeforces [ ] Leetcode [ ] InterviewBit [ ] AtCoder [*] 450...

Longest Repeating Subsequence(DP)

1

Link of the question https://www.geeksforgeeks.org/longest-repeating-subsequence/ Coding platform [ ] Hackerrank [ ] HackerEarth [ ] Codechef [ ] Codeforces [ ] Leetcode [ ] InterviewBit [ ] AtCoder [*] 450...

Longest Palindromic Subsequence(DP)

1

Link of the question https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/ Coding platform [ ] Hackerrank [ ] HackerEarth [ ] Codechef [ ] Codeforces [ ] Leetcode [ ] InterviewBit [ ] AtCoder [*] 450...

Coin Change(DP)

2

Link of the question https://www.geeksforgeeks.org/coin-change-dp-7/ Coding platform [ ] Hackerrank [ ] HackerEarth [ ] Codechef [ ] Codeforces [ ] Leetcode [ ] InterviewBit [ ] AtCoder [x] 450...

Print Shortest Common Supersequence (CPP)

2

(DP Problem Using C++) Given two strings X and Y of lengths m and n respectively, PRINT smallest string which has both, X and Y as its sub-sequences. Example 1...

Palindrome Partitioning (CPP)

2

Given a string s, a partitioning of the string is a palindrome partitioning if every sub-string of the partition is a palindrome. Determine the fewest cuts needed for palindrome partitioning...

Partition Problem (CPP)

3

Partition problem is to determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is the same. EXAMPLE: A[ ]=...

Print Longest Common Subsequence (CPP)

2

(DP Problem Using C++) Given two strings X and Y of lengths m and n respectively, PRINT LCS of strings X and Y Example 1 Input: X = aggtab, Y...