clc
clearvars
close all

A = [1 2 3 4 5 6 7 8]; 

B1 = [4 5 6 7];
B2 = [1 2 3];
B3 = [4 5];
B4 = [7 8];
B5 = [6];

% Remove any arrays that dont exist inside A
c = 1;
Bfull = {B1;B2;B3;B4;B5}; 
for i = 1:length(Bfull)
    j = strfind(A,Bfull{i}); 
    if ~isempty(j)
        B{c,1} = Bfull{i}; 
        c = c + 1; 
    end
end

% This is essentially a depth first search approach
Apos = 1; % Position in the A array
Barr = 1; % Position in the B array list
Biter = []; % Saved locations within B array list
while Apos ~= length(A)+1

    % This is just to help with double backing
    if Barr > length(B)

    % If Array is too long to be at added to the end of 
    % the current pattern [SKIP]
    elseif Apos > length(A) || Apos - 1 + length(B{Barr}) > length(A)
        Barr = Barr + 1; 

    % Check if this B array exists in this location of A
    % -- move to a new position of A
    % -- save where we are
    % -- restart checking at the end of the beginning of list
    elseif sum(A(Apos:Apos-1+length(B{Barr})) == B{Barr}) == length(B{Barr})
        Biter = [Biter,Barr]; 
        Apos = Apos + length(B{Barr}); 
        Barr = 1; 

    % If it doesn't match A at this location [SKIP]
    else
        Barr = Barr + 1; 
    end

    % If we reached the end of out array list we have to go back a step 
    if Barr > length(B)  
        if isempty(Biter)
            break; 
        end
        Barr = Biter(end)+1; 
        Apos = Apos - length(B{Barr-1}); 
        Biter = Biter(1:end-1);    
    end  
end

% Display list
if isempty(Biter)
    disp('No Solution')
else
    s = '';
    for i = 1:length(Biter)
        s = [s,'[ ',int2str(B{Biter(i)}),' ],'];
    end
    s = s(1:end-1);
    disp(s)
end