hackbulgaria / haskell-1 Goto Github PK

A question regarding the tasks description:

Is the part "^n" always constant - the characters always repeat one and the same number of times?

Is the language "a^nb^Mc^n" valid and with meaning "one character repeated X times, a different character repeated Y times and a third character (not equal to either of the first two) repeated X time again" where X and Y are arbitary but different natural numbers (without the 0)?

@leohaskell week1/tasks -> week1/1-Beginner-Problems

Pattern-а дето ползваме е:

{Поредна-цифра-почваща от-1}-{Името-на-задачата}

🍻

One question regarding something that I didn't understand clearly from the tasks description:

Are the trains supposed to depart exactly when Hass arrives at the station (enters the train) i.e. they have no shedule like:

If there are trains A -> B, B -> C, C -> D, we assume that A -> D always takes 15 minutes (5 minutes each ride) so there isn't any transfer time/waiting on the stations?