You are the interviewee during a job interview. the interviewer says, "i’ve a dynamic programming algorithm for the subset-sum problem and its complexity is a polynomial of n and k", where n = |s| for an instance (s, k) of the subsetsum problem. if you believe he found a polynomial time solution for a np-complete problem, you should congratulate him for his success. if you don’t believe such an algorithm can exist, point this out politely. if you think you can also create such an algorithm, say so to the interviewer and do so here with the detailed time complexity analysis. what would be your response (you have to choose one of the three above with rationality)?

There is no known polynomial time solution for this problem. But we can solve the problem in Pseudo-polynomial time using Dynamic programming.

Step-by-step explanation:

Look at the images to see the explanation.

you can also visit this web page https://www.geeksforgeeks.org/subset-sum-problem-dp-25/

this is a very good question

step-by-step explanation:

i got a hair cut today from my mom not to flex just to flex kim jon un is one rad fellow i'd say you'd need to take the hairline in kinda like a box shape like someone rammed a lego brick into your head. from there you really need to take the top up keeping with that boxy aesthetic, finally coat the whole thing with gel if your country economics are failing or whatever you can just coat it with the starving children's food rations. about 5 orphans per strand is a good ratio. good luck with the fresh cut my dude