Question

Write a program that takes these values to find all of the different patterns in "input" of length "patternLength"
and output all of the patterns that occur more than once and the number of times they occur.
For example, when searching the string "zf3kabxcde224lkzf3mabxc51+crsdtzf3nab=", with a specified pattern length of 3, the method should return the pattern "abx” with an occurrence value of two, and “zf3” with an occurrence value of three.
The answer should be written in C#,

Answer 1

SOURCE CODE:

*Please follow the comments to better understand the code.

**Please look at the Screenshot below and use this code to copy-paste.

***The code in the below screenshot is neatly indented for better understanding.

This is a very big question.
I have solved all of them.
Please give me an upvote dear, Much Appreciated.!!

using System;
using System.Collections.Generic;
using System.Linq;

// Create a namespace as needed
namespace DummyNameSpace
{
// Create a class
class TestProgram
{
// craete an innrer class DemoPattern
public class DemoPattern
{
// declare the variables
private string pattern;
private int count;

// Constructor here
public DemoPattern(string str, int count)
{
this.pattern = str;
this.count = count;
}

// Getters and Setters
public int Count { get => count;}
public string Pattern { get => pattern; }

// Methods
public void AddCount()
{
this.count = this.count + 1;
}

public override int GetHashCode()
{
return this.pattern.GetHashCode();
}

public override string ToString()
{
return string.Format("Pattern<{0} - {1}>", Pattern, Count);
}
}
// Find the pettens here
public static List<DemoPattern> Find(string data, int len)
{
var map = new Dictionary<string, DemoPattern>();
HashSet<DemoPattern> f = new HashSet<DemoPattern>();

if (data.Length < len)
{
// no patterns found if not long enough
return f.ToList();
}

if (data.Length == len) {
// if the string is exact same length, then no need to loop through
f.Add(new DemoPattern(data, 1));
return f.ToList();
}

/* O(n) to loop through all the characters */
for (int k = 0; k <= (data.Length - len); k++)
{
var substr = data.Substring(k, len);
/* o(1) to look up a pattern */
var mypattern = map.GetValueOrDefault(substr, null);
if (mypattern == null)
{
map.Add(substr, new DemoPattern(substr, 1));
}
else
{
mypattern.AddCount();
if (mypattern.Count > 1)
{
// this pattern has been found more than once, keep it
f.Add(mypattern);
}
}

}

/* Somewhere between O(n) and O(1) depending on how many patterns are found) */
List<DemoPattern> patterns = f.ToList();
/* Could the set, but the list makes it easier to test */
patterns.Sort(delegate (DemoPattern x, DemoPattern y)
{
return x.Count.CompareTo(y.Count);
});
return patterns;
}
  
// Driver method to test the methdo we created above
static void Main(string[] args)
{
// Take DemoPattern list of objects
List<DemoPattern> patterns;

Console.WriteLine("======================TEST 1==================");
// TEST 1
patterns = Find("zf3kabxcde224lkzf3mabxc51+crsdtzf3nab", 3);
Console.WriteLine(string.Join(", ", patterns));

Console.WriteLine("======================TEST 2==================");
// TEST 2
patterns = Find("aaaa", 3);
Console.WriteLine(string.Join(", ", patterns));

Console.WriteLine("======================TEST 3==================");
           // TEST 3
           patterns = Find("aaa", 1);
Console.WriteLine(string.Join(", ", patterns));

}
}
}

{ main.cs using System; 2 using System.Collections.Generic; 3 using System.Linq; 4 5 // Create a namespace as needed 6 namespace DummyNameSpace 7-{ 8 // Create a class 9 class TestProgram 10 { 11 // craete an innrer class DemoPattern 12 public class DemoPattern 13 { 14 // declare the variables 15 private string pattern; 16 private int count; 17 18 // Constructor here 19 public DemoPattern(string str, int count) 20 21 this.pattern str; 22 this.count = count; 23 24 25 // Getters and Setters 26 public int Count { get => count;} 27 public string Pattern { get => pattern; } 28 29 // Methods 30 public void AddCount() 31 32 this.count = this.count + 1; 33 34 35 public override int GetHashCode() 36 37 return this.pattern. GetHashcode(); 38 39 40 public override string ToString() 41 42 return string.Format("Pattern<{0} - {1}>", Pattern, Count); 43 44 لها { } نها ها نها } }

// Find the pettens here public static List<DemoPattern> Find(string data, int len) { var map = new Dictionary<string, DemoPattern>(); HashSet<DemoPattern> f = new HashSet<DemoPattern>(); if (data. Length < len) نها // no patterns found if not long enough return f.ToList(); بها if (data. Length == len) { // if the string is exact same length, then no need to loop through f.Add(new DemoPattern(data, 1)); return f.ToList(); بها /* O(n) to loop through all the characters */ for (int k = 0; k <= (data.Length - len); k++) { 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 var substr = data. Substring(k, len); /* o(1) to look up a pattern */ var mypattern = map.GetValueOr Default(substr, null); if (mypattern == null) { map.Add( substr, new DemoPattern(substr, 1)); } else نها mypattern. AddCount(); if (mypattern.Count > 1) // this pattern has been found more than once, keep it f.Add(mypattern); { نها } بها /* Somewhere between O(n) and 0(1) depending on how many patterns are found) */ List<DemoPattern> patterns f.ToList(); /* Could the set, but the list makes it easier to test */ patterns.Sort(delegate (DemoPattern x, DemoPattern y) نها return x.Count. CompareTo(y.Count); }); return patterns;

return patterns; } // Driver method to test the methdo we created above static void Main(string[] args) { // Take DemoPattern list of objects List<DemoPattern> patterns; '); Console.WriteLine( ====TEST 1=== // TEST 1 patterns Find("zf3kabxcde2241kzf3mabxc51+crsdtzf3nab", 3); Console.WriteLine(string.Join(", ", patterns)); 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 } 119 Console.WriteLine(" =====TEST 2=================="); // TEST 2 patterns = Find("aaaa", 3); Console.WriteLine(string.Join(", ", patterns)); "); Console.WriteLine("=== ======TEST 3============== // TEST 3 patterns = Find("aaa", 1); Console.WriteLine(string.Join(", ", patterns)); } } input ========= 2>, Patternszf3 - 3> ===TEST 1: Pattern abx 22, Patternsbạc ==TEST 2= Pattern aaa - 2> =====TEST Patternsa 3> ...Program finished with exit code o Press ENTER to exit console. I

If there are any doubts, comment down here. We are right here to help you. Happy Learning..!! PLEASE give an UPVOTE I Have Put a lot of EFFORT in solving Your Problem. It really Boosts us..!! PLEASE give an UPVOTE I Have Put a lot of EFFORT in solving Your Problem. , It really Boosts us..!!