I have to do the following and can't figure out how to do it all correctly: I have a table test Test1 Test2 ...
I have to do the following and can't figure out how to do it all correctly: I have a table test Test1 Test2 ...
I'm trying to figure out how to compute the shortest sequence containing a given set of subsequences. For example, given: abcd bcdgh cdef The answer s ...
I have a time series with gaps (NaN) and I want to find the start and stop index of the longest consecutive sequence where no Nan occurs. I have no cl ...
input has list of nos output has all the possible pattern occurring and the position where the pattern break [1,2,3] and [4,5,6] all possible patte ...
I tried to write a function to print out the subsequences of a string (input) using recursion and got this error for output[0] + input[0]: "no suita ...
I want to return an array in the given format to print all the sub-sequences of an array. format: The code I write : its output Thanks for y ...
I need to extract a substring from a string; the substring is enclosed by ":" and ";". E.g. :substring; But with Lisp (SBCL), I'm having trouble ext ...
as the question suggests we need to find OR of all the subsequence of given array how do you solve this with an optimized approach, not exponential ...
I am trying to find consecutive numbers from an array of numbers. This is my code: let array = [4,3,5,4,3]; let new_arr = []; for (let i=0; i ...
I am wondering if there is a fast Python way to check if a subsequence exists in a string, while allowing for 1-3 mismatches. For example the string: ...
Problem Statement: Given an array arr of n integers, count the number of non-empty subsequences of the given array such that their product of maximum ...
Given an array of string words, please design a string subsequence matcher. Implement the SubsequenceMatcher class: SubsequenceMatcher(string wor ...
The weight of a sequence a0, a1, …, an-1 of real numbers is defined as a0+a1/2+…+ aa-1/2n-1. A subsequence of a sequence is obtained by deleting so ...
The following code for above requirement. However I am not getting proper output. There is problem with input list that I am passing in recursion ...
I have tried a approach of print all the subsequences of a stirng using recursion but not able to implement this how can i print all the subsequences ...
I am a beginner, trying to learn recursion and solve some problems (trying the subsequences problem). But before I could even attempt to get the recur ...
Getting Runtime error for this code :- But why it is showing run Time error for this ? ...
I'm wondering how to change the class I have so that it can produce the longest contiguous common subsequence between two strings. This code right now ...
Suppose this is my .txt file ABCDBCD and I want to use .substring to get this: ABC BCD CDB DBC BCD How can I achieve this? I also need to stop the pr ...
Given this arrays I want to check if "sequence" is a subsequence of "array", meaning all the numbers exist in the original array and in the same order ...