Search:

Here is another implementation if you are interested, which still have the same problem


from math import ceil

def LIS():
#longest_sequence_indices = [None] * (N+1)
tailTable = [0] *...

Test cases that I've tried which worked

Test Case 1: 0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15
Ans : 6

Test Case 2: 1, 12, 7, 0, 23, 11, 52, 31, 61, 69, 70, 2
Ans : 7

Test Case...

Longest Increasing Subsequence


I'm trying to implement a program for Longest Increasing Subsequence, It's giving correct output for some input patterns, But for some it's giving incorrect...

I tried putting


check = list(check)

at start of the function, But still didn't worked. Here is the expected Output.


>> [[2, 0, 0, 1], [0, 0, 2, 0], [1, 1, 1, 0], [2, 2, 0, 0], [4, 0, 0,...

I made the following changes as you said but still I'm not getting expected result.


# N
N = 10

# Set of Changes
s = [2, 3, 5, 6]

lst = []

I'm trying to implement Coin Changing Problem which states that




In my below python implementation I'm using a list name check. Problem is that the program is using same check list throughout...