1. Toy Problem
Longest Run
Write a function that, given a string, finds the longest run of identical characters and returns an array containing the start and end indices of that run.
If there are two runs of equal length, return the first one. Return [0,0] for no runs.
If there are two runs of equal length, return the first one. Return [0,0] for no runs.
Examples
| Input | Output |
|---|---|
| string: "abbbcc" | [ 1, 3 ] |
2. Lecture: Intro. to Deployment
Deployment = My app running on a remote computer. Essentially, letting our app be available for others to use on their browser.
3. Pair Programming on Deployment
No comments:
Post a Comment