20. Set and Map

• 20. Set Map Intro

Introduction to set and map.

• 20. Frequency Analysis

Find the most frequent words in a text document.

• 20. Substitution Cipher

How to break a substitution cipher.

• 20. Linked Lists

LinkedList is a List that has the ability to add items quickly on the front or back.

• 20. Cookie Monster

This is Exercise 12 from Java Methods Chapter 20. Start at the upper left (0,0) of a grid of numbers. Find a path to the lower right corner (cols-1,rows-1) that has the greatest sum. You can only go right and down. Your path is not allowed to contain a square with the number -1. Data: Read a file describing a 2D array. The first line of the file contains two integers rows and cols.