Skip to content

Commit ca4afe6

Browse files
more thoughts...
1 parent 175a210 commit ca4afe6

File tree

1 file changed

+4
-1
lines changed

1 file changed

+4
-1
lines changed

problems/1717/jeremymanning.md

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -36,7 +36,10 @@
3636
- bbba
3737
- bbbb
3838
- Aside: this is like counting in binary...maybe there's some shortcut we could take based on that?
39-
- I'm out of time for tonight...I'm going to have to come back to this tomorrow!
39+
- after taking a pause....
40+
- Ok, in re-thinking the "abab" example above, it's not correct as I described it. If we remove "ba" first, then we're still left with an instance of "ab" which we can use to get those points. So actually, prioritizing the higher-scoring substring *does* seem to make sense. The real issue is with efficiency. Ok...*now* I'm going to come back to this tomorrow 😄.
41+
- Quick idea to explore tomorrow: these substrings can be described using context-free grammars, which means we can solve this using a pushdown automata...which means implementing a stack might be useful.
42+
- 😴
4043

4144
## Refining the problem, round 2 thoughts
4245

0 commit comments

Comments
 (0)