Skip to content

takeUforward

~ Strive for Excellence

  • Striver’s SDE Sheet
  • SDE Core Sheet
  • Interview Experience
  • Data Structure
  • Advertise with us
  • Join takeUforward

Category: dynamic programming

April 20, 2022 Arrays / Data Structure / dynamic programming / String

Wildcard Matching | (DP-34)

Problem Statement: Wildcard Matching We are given two strings ‘S1’ and ‘S2’. String S1 can have the following two special characters:

Continue reading
April 10, 2022 Arrays / Data Structure / dynamic programming / String

Edit Distance | (DP-33)

Problem Statement: Edit Distance We are given two strings ‘S1’ and ‘S2’. We need to convert S1 to S2. The following

Continue reading
March 31, 2022 Arrays / Data Structure / dynamic programming

Distinct Subsequences| (DP-32)

Problem Statement: Distinct Subsequences Problem Link: Subsequence Counting We are given two strings S1 and S2, we want to know how

Continue reading
March 31, 2022 Arrays / Data Structure / dynamic programming

Shortest Common Supersequence | (DP – 31)

Problem Statement: Shortest Common Supersequence We are given two strings ‘S1’ and ‘S2’. We need to return their shortest common supersequence.

Continue reading
March 27, 2022 Arrays / Binary Search Tree / Data Structure / dynamic programming

Minimum insertions to make string palindrome | DP-29

Problem Statement: Minimum insertions required to make a string palindrome A palindromic string is a string that is the same

Continue reading
March 27, 2022 Arrays / Data Structure / dynamic programming

Minimum Insertions/Deletions to Convert String | (DP- 30)

Problem Statement: Minimum Insertions/Deletions to Convert String A to String B We are given two strings, str1 and str2. We

Continue reading
March 23, 2022 Arrays / Data Structure / dynamic programming

Longest Palindromic Subsequence | (DP-28)

Problem Statement: Longest Palindromic Subsequence A palindromic string is a string that is equal to its reverse. For example: “nitin” is

Continue reading
March 23, 2022 Arrays / Data Structure / dynamic programming

Longest Common Substring | (DP – 27)

Problem Statement: Longest Common Substring A substring of a string is a subsequence in which all the characters are consecutive. Given

Continue reading
March 20, 2022 Arrays / Data Structure / dynamic programming

Print Longest Common Subsequence | (DP – 26)

Problem Statement:  Print Longest Common Subsequence In the previous article Longest Common Subsequence, we learned to print the length of

Continue reading
March 12, 2022 Arrays / Data Structure / dynamic programming / Recursion

Longest Common Subsequence | (DP – 25)

Problem Statement: Introduction to DP on Strings – Longest Common Subsequence In the coming articles, we will discuss problems related to

Continue reading

Posts navigation

1 2 3 4 Next Posts»

Subscribe

I want to receive latest posts and interview tips
Loading

Recent Posts

  • Input, Output, and Import in Python
  • Python Operators
  • Python Data Types
  • Type Conversion in Python
  • BuildHeap(), DecreaseKey(), and Delete() in Binary Heap

Accolite Digital Amazon Arcesium Bank of America Barclays BFS Binary Search Binary Search Tree Commvault CPP DE Shaw DFS DSA Self Paced google HackerEarth infosys inorder Java Juspay Kreeti Technologies Morgan Stanley Newfold Digital Oracle post order pre-order queue recursion Samsung SDE Core Sheet SDE Sheet Searching set-bits sorting sub-array subarray Swiggy takeuforward TCQ NINJA TCS TCS CODEVITA TCS DIGITA; TCS Ninja TCS NQT VMware XOR

Copyright © 2022 takeuforward | All rights reserved