Skip to content

Commit 1262f36

Browse files
authored
Update README.md
1 parent 5227887 commit 1262f36

File tree

1 file changed

+2
-4
lines changed

1 file changed

+2
-4
lines changed

README.md

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ Commit your code regularly and meaningfully. This helps both you (in case you ev
2020

2121
This Sprint Challenge is split into three parts:
2222

23-
1. Implement a data structure called a ring buffer (description in the README in the `ring_buffer` directory
23+
1. Implement a data structure called a ring buffer (more details below)
2424
2. Optimizing some inefficient code
2525
3. Analyzing time and space complexities from parts 1 and 2
2626

@@ -66,9 +66,7 @@ Six seconds is an eternity so you've been tasked with speeding up the code. Can
6666

6767
#### Task 3. Analyze Some Runtimes
6868

69-
Open up the `Data_Structures_Answers.md` file. This is where you'll jot down your answers for the runtimes of the functions you just implemented. If you implemented depth-first traversal, just answer the questions pertaining to the depth-first traversal algorithm. If you implemented breadth-first traversal, just answer the questions pertaining to breadth-first traversal.
70-
71-
Also, include the runtime and space complexities of the original code and your optimized solution from `names.py`.
69+
Open up the `Data_Structures_Answers.md` file. This is where you'll jot down your answers for the runtimes of the functions/data structures you just implemented. Also include the runtime and space complexities of the original code and your optimized solution from `names.py`.
7270

7371
### Stretch Problems
7472

0 commit comments

Comments
 (0)