public/subjects/arrange_it/README.md

arrange_it

Instructions

Create a function called arrange_phrase that takes a string literal as a phrase and returns it organized Each word will have a number that indicates the position of that word.

This exercise will test how many times the heap is going to be allocated!
So try your best to allocate the minimum data on the heap!

Expected Function

pub fn arrange_phrase(phrase: &str) -> String {
}

Notions

• stack and heap
• str

Usage

Here is a program to test your function

use arrange_it::*;

fn main() {
    println!("{:?}", arrange_phrase("is2 Thi1s T4est 3a"));
}

And its output

student@ubuntu:~/[[ROOT]]/test$ cargo run
"This is a Test"
student@ubuntu:~/[[ROOT]]/test$