- [File:TeamTimeCar.com-BTTF DeLorean Time Machine-OtoGodfrey.com-JMortonPhoto.com-07.jpg - Wikimedia Commons](https://commons.wikimedia.org/wiki/File:TeamTimeCar.com-BTTF_DeLorean_Time_Machine-OtoGodfrey.com-JMortonPhoto.com-07.jpg)
- [File:Let Sleeping Dogs Lie.jpg - Wikimedia Commons](https://commons.wikimedia.org/wiki/File:Let_Sleeping_Dogs_Lie.jpg)
I'll use x = "processing"
as an example. Throughout the example *
represents the null character, which sorts before any other character (i.e. * < a < b < c < ...
).
We start by creating three groups of suffixes - S0
, S1
and S2
- so that each suffix in the group Sk
starts at the index 3q + k
for some value of q
. In plain English:
S0
suffixes start at positions 0, 3, 6, etc.S1
suffixes start at positions 1, 4, 7, etc.S2
suffixes start at positions 2, 5, 8, etc.
By: @BTroncone
Also check out my lesson @ngrx/store in 10 minutes on egghead.io!
Update: Non-middleware examples have been updated to ngrx/store v2. More coming soon!
Table of Contents
Picking the right architecture = Picking the right battles + Managing trade-offs
- Clarify and agree on the scope of the system
- User cases (description of sequences of events that, taken together, lead to a system doing something useful)
- Who is going to use it?
- How are they going to use it?
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
I have moved this over to the Tech Interview Cheat Sheet Repo and has been expanded and even has code challenges you can run and practice against!
\