This module provides the best approach to learn Rust, starting from the basics to advance topics. It is an introduction to Rust, specifically for beginners aspiring to become skilled Rust developers.

Become a Rust Web Developer

The word is out: developers love Rust. It's rapidly becoming a top choice for systems and embedded programmers, and the demand for Rust developers is rising. Known for its performance, reliability, and productivity—especially compared to C++—Rust is a powerful language to master. If you're a systems developer, it's a fantastic next step.
In this module, you'll learn Rust by actively engaging in coding. It starts with a simple "Hello world" program and covers essential concepts like arrays, strings, vectors, enums, structures, traits, generics, functions, and logic. You'll also dive into advanced topics such as lifetime and memory management.

Learn Rust

## Problem Statement
In this exercise, you have to write a recursive function `fibonacci` that takes a positive integer number `n` as a parameter and returns the **nth Fibonacci term** in that range.

>The **Fibonacci Sequence** is the series of numbers in which the next term is found by adding the two previous terms:
>```
> 1, 1, 2, 3, 5, 8, 13, 21, 34, ...
>```
> Here ,
> the number 1 is the first term, 1 is the second term, 2 is the third term and so on...



### Input
```
  an integer n
```
### Output
```
  nth fibonacci term
```
### Sample Input
```
  7
```
### Sample Output
```
  13
```
## Coding Exercise

Write your code in the code widget below. If you don’t get it right, don’t fret; the solution is also given.

> **Note:** There is a `fibonacci` function given in the code for testing purposes. Do not modify it.


Good luck! 🤞


# Problem Statement
In this exercise, you have to write a recursive function `fibonacci` that takes a positive integer number `n` as a parameter and returns the **nth Fibonacci term** in that range.

>The **Fibonacci Sequence** is the series of numbers in which the next term is found by adding the two previous terms:
>```
> 1, 1, 2, 3, 5, 8, 13, 21, 34, ...
>```
> Here ,
> the number 1 is the first term, 1 is the second term, 2 is the third term and so on...



## Input
```
  an integer n
```
## Output
```
  nth fibonacci term
```
## Sample Input
```
  7
```
## Sample Output
```
  13
```
# Coding Exercise

Write your code in the code widget below. If you don’t get it right, don’t fret; the solution is also given.

> **Note:** There is a `fibonacci` function given in the code for testing purposes. Do not modify it.


Good luck! 🤞


This challenge will test your knowledge of recursion.

Rust Programs

Rust Variables

Rust Data Types

Rust Operators

Rust if and if let Expressions

Rust Loops

Rust Functions

Rust Strings

Rust Vectors

Rust Structs

Conclusion

Problem Statement #