id/email | |

password | |

forgot password | create account | |

Or use |

about | help | code help+videos | done | prefs |

Warmup-2 > front_times

prev | next | chance

Forget It! -- delete my code for this problem### Python Help

prev | next | chance

Given a string and a non-negative int n, we'll say that the front of the string is the first 3 chars, or whatever is there if the string is less than length 3. Return n copies of the front; front_times('Chocolate', 2) → 'ChoCho' front_times('Chocolate', 3) → 'ChoChoCho' front_times('Abc', 3) → 'AbcAbcAbc' ...Save, Compile, Run |

Forget It! -- delete my code for this problem

Progress graphs:

Your progress graph for this problem

Random user progress graph for this problem

Random Epic Progress Graph

Difficulty: 206.0

Copyright Nick Parlante 2016 - privacy