Wildcard Pattern Matching
The program must accept a text and a wildcard pattern as the input. The program must print “Matching” if…
Largest Square Sub Matrix with 1s
ExampleInput/Output 1:Input:7 51 1 1 0 11 1 0 1 00 1 1 1 11 1 1 1 11 1 1 1 11 1 1 1 10 0 0 0 0 Output:4
Minimum Edit Distance Two Strings
The program must accept two string values S1 and S2 as the input.The program must print the minimum cost required to convert the string S1 to…
Intelligent Chef
There are N persons in a hotel. Each person has their own preferences for food.The hotel chef wants to prepare the food items as minimum as…
Vendor Maximum Profit
A vendor has a shop and he wants to purchase some items for a maximum of N rupees.There are K items in a wholesale store that the vendor is…
Single Source Shortest Path
There are N cities in a country which are numbered from 1 to N.The N cities are connected by L links. Each link contains the source city,the…
Toll Gate Collection
ExampleInput/Output 1:Input:200 <- total distance 50 <- distance b/w tolls5 <- number of tolls60 70 120 130 140 <- distance50 70…
Social Media Leader
There are N people in a Facebook group.The group follows the following three rules. 1) The group leader does not follow anyone.2) Everyone in…