Skip to content
This repository was archived by the owner on Aug 14, 2023. It is now read-only.

Commit 5c2793c

Browse files
Typos and markdown formatting
1 parent 3855871 commit 5c2793c

File tree

1 file changed

+11
-11
lines changed

1 file changed

+11
-11
lines changed

README.md

Lines changed: 11 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -72,16 +72,16 @@ documentation.
7272
- Efficiency
7373
- Style
7474
- Documentation
75-
- Please comment on the postive aspects and improvements that are necessary while being encouraging.
75+
- Please comment on the positive aspects and improvements that are necessary while being encouraging.
7676

7777
### Option 1: Python Task
7878

7979
Compulsory Task 1
8080
Follow these steps:
8181

82-
- In a file called anagram.py, create:
82+
- In a file called `anagram.py`, create:
8383

84-
- Given an array of strings strs, group the anagrams together.
84+
- Given an array of strings `strs`, group the anagrams together.
8585
- An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
8686
- You can return the answer in any order.
8787
- Strings consists of lowercase English letters.
@@ -111,9 +111,9 @@ print(ob1.groupAnagrams(["eat", "tea", "tan", "ate", "nat", "bat"]))
111111
Compulsory Task 1
112112
Follow these steps:
113113

114-
- In a file called recursion.java, create:
114+
- In a file called `recursion.java`, create:
115115
- recursive function that reverses a string
116-
- a recursive function that, given a number n, prints out the first n Fibonacci numbers (Fibonacci numbers are a sequence where each number is the sum of the previous two - 0 1 1 2 3 5 8...)
116+
- a recursive function that, given a number `n`, prints out the first `n` Fibonacci numbers (Fibonacci numbers are a sequence where each number is the sum of the previous two - `0 1 1 2 3 5 8...`)
117117

118118

119119
``` java
@@ -214,11 +214,11 @@ def is_palindrome(x)
214214
Compulsory Task 2
215215
Follow these steps:
216216

217-
- In a file named caesar.ts, please create a function that implements the Caesar Cypher by taking 2 arguments, the string that is to be encoded and the shift value used for the encryption.
218-
- For more information on what a Cypher Cipher is, please look at the following [resource](https://en.wikipedia.org/wiki/Caesar_cipher)
219-
- The function should return "THE QUICK BROWN DOG JUMPED OVER THE LAZY FOX." When the following are passed as arguments:
220-
- The string to be encoded: "GUR DHVPX OEBJA QBT WHZCRQ BIRE GUR YNML SBK."
221-
- The shift value: 39
217+
- In a file named `caesar.ts`, please create a function that implements the Caesar Cypher by taking 2 arguments: the string that is to be encoded and the shift value used for the encryption.
218+
- For more information on what a Caesar Cipher is, please look at the following [resource](https://en.wikipedia.org/wiki/Caesar_cipher)
219+
- The function should return `"THE QUICK BROWN DOG JUMPED OVER THE LAZY FOX."` when the following are passed as arguments:
220+
- The string to be encoded: `"GUR DHVPX OEBJA QBT WHZCRQ BIRE GUR YNML SBK."`
221+
- The shift value: `39`
222222

223223

224224
``` typescript
@@ -288,7 +288,7 @@ print(caesar_cipher('GUR DHVPX OEBJA QBT WHZCRQ BIRE GUR YNML SBK.', 39));
288288
## Section C: Code Challenge
289289

290290
- We suggest that you implement your solution in either Python, Java, Ruby or TypeScript.
291-
- You're more than welcome to use any programming language and paradigm that you fancy as long as your solution is idiomatic.
291+
- You're more than welcome to use any programming language and paradigm that you fancy, as long as your solution is idiomatic.
292292
- You are required to include a comprehensive test suite for your solution. Be sure to include edge cases.
293293
- Please include all instructions and scripts necessary to build, test and run your solution on Linux, macOS and Windows operating systems.
294294
- Please include a Markdown report that specifies and justifies the _worst-case **space** complexity_ of your solution.

0 commit comments

Comments
 (0)