src/secretwriting/MonoalphabeticCipher.java
private void solveFrequencyTypes(String[] c, String s) {
		if (s.isBlank() || EnglishDeterminer.isInteger(s)) {
			return;
		}
		for (String nLetterWord : c) { // Loop through the constant array
			for (char v : nLetterWord.toCharArray()) {
				if (solvedLetters.contains(v)) {
					break;
				}
			}
			if (!s.equals(s.toUpperCase())) {
				List<Integer> n = AlphabeticalStatistics.getLowers(s);
				if(n.stream().anyMatch(g -> s.charAt(g) != nLetterWord.charAt(g))) {
					continue;
				}
			}
			boolean b = false;
			int i = 0;
			do {
				char solvedLetter = nLetterWord.charAt(i);
				char replacedLetter = s.charAt(i);
				if (replaceLetters(replacedLetter, solvedLetter))
					b = true;
				i++;
			} while (b && i < s.length());
			if (b) {
				System.out.println(s + " was replaced with " + nLetterWord);
				return;
			}
		}		
	}
/**
	 * 
	 * @param c the array of the most frequent n-letter words or n-graphs from AlphabeticalStatistics
	 * @param s The String of the most common n-letter word or n-graph in the text; being replaced
	 */
@param c the array of the most frequent n-letter words or n-graphs from AlphabeticalStatistics
@param s The String of the most common n-letter word or n-graph in the text; being replaced
@param c the array of the most frequent n - letter words or n - graphs from AlphabeticalStatistics @param s The String of the most common n - letter word or n - graph in the text ; being replaced
private void solveFrequencyTypes(String[] c, String s) {
		if (s.isBlank() || EnglishDeterminer.isInteger(s)) {
			return;
		}
		for (String nLetterWord : c) { 
			for (char v : nLetterWord.toCharArray()) {
				if (solvedLetters.contains(v)) {
					break;
				}
			}
			if (!s.equals(s.toUpperCase())) {
				List<Integer> n = AlphabeticalStatistics.getLowers(s);
				if(n.stream().anyMatch(g -> s.charAt(g) != nLetterWord.charAt(g))) {
					continue;
				}
			}
			boolean b = false;
			int i = 0;
			do {
				char solvedLetter = nLetterWord.charAt(i);
				char replacedLetter = s.charAt(i);
				if (replaceLetters(replacedLetter, solvedLetter))
					b = true;
				i++;
			} while (b && i < s.length());
			if (b) {
				System.out.println(s + " was replaced with " + nLetterWord);
				return;
			}
		}		
	}
private void solveFrequencyTypes ( String [ ] c , String s ) { if ( s . isBlank ( ) || EnglishDeterminer . isInteger ( s ) ) { return ; } for ( String nLetterWord : c ) { for ( char v : nLetterWord . toCharArray ( ) ) { if ( solvedLetters . contains ( v ) ) { break ; } } if ( ! s . equals ( s . toUpperCase ( ) ) ) { List < Integer > n = AlphabeticalStatistics . getLowers ( s ) ; if ( n . stream ( ) . anyMatch ( g -> s . charAt ( g ) != nLetterWord . charAt ( g ) ) ) { continue ; } } boolean b = false ; int i = 0 ; do { char solvedLetter = nLetterWord . charAt ( i ) ; char replacedLetter = s . charAt ( i ) ; if ( replaceLetters ( replacedLetter , solvedLetter ) ) b = true ; i ++ ; } while ( b && i < s . length ( ) ) ; if ( b ) { System . out . println ( s + " was replaced with " + nLetterWord ) ; return ; } } }
@param c the array of the most frequent n-letter words or n-graphs from AlphabeticalStatistics
 @param s The String of the most common n-letter word or n-graph in the text; being replaced
@param c the array of the most frequent n - letter words or n - graphs from AlphabeticalStatistics @param s The String of the most common n - letter word or n - graph in the text ; being replaced
// Loop through the constant array