Skip to content
This repository was archived by the owner on Mar 1, 2026. It is now read-only.

Commit 167f507

Browse files
committed
Added a readme into the first week so that I know what challenge is what number. Also for some reason, I added scheme
1 parent d56d21a commit 167f507

1 file changed

Lines changed: 78 additions & 0 deletions

File tree

w1/README.md

Lines changed: 78 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,78 @@
1+
# Week One Challenges
2+
3+
## 1. Plus Minus
4+
5+
Given an array of integers, calculate the ratios of positive, negative, and zero values. Output the results as decimal values with six digits of precision.
6+
7+
8+
| Python | Elixir | TypeScript | Go | Scheme |
9+
|--------|--------|------------|----|--------|
10+
||||||
11+
12+
13+
14+
15+
16+
## 2. Mini-Max Sum
17+
18+
Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers.
19+
20+
| Python | Elixir | TypeScript | Go | Scheme |
21+
|--------|--------|------------|----|--------|
22+
||||||
23+
24+
25+
26+
## 3. Time Conversion
27+
28+
Convert time from 12-hour AM/PM format to 24-hour military time.
29+
30+
| Python | Elixir | TypeScript | Go | Scheme |
31+
|--------|--------|------------|----|--------|
32+
|||| ✏️ ||
33+
34+
35+
36+
37+
## 4. Breaking the Records
38+
39+
Track how many times a player’s highest and lowest scores are broken during a season of games.
40+
41+
| Python | Elixir | TypeScript | Go | Scheme |
42+
|--------|--------|------------|----|--------|
43+
||||||
44+
45+
46+
47+
## 5. Camel Case
48+
49+
Typically involves parsing or transforming camelCase and PascalCase strings (e.g., splitting or merging words based on formatting conventions). Exact prompt may vary slightly by version.
50+
51+
| Python | Elixir | TypeScript | Go | Scheme |
52+
|--------|--------|------------|----|--------|
53+
||||||
54+
55+
56+
57+
58+
## 6. Divisible Sum Pairs
59+
60+
Count the number of (i, j) index pairs such that i < j and the sum of arr[i] + arr[j] is divisible by a given integer k.
61+
62+
63+
| Python | Elixir | TypeScript | Go | Scheme |
64+
|--------|--------|------------|----|--------|
65+
||||||
66+
67+
68+
69+
70+
## 7. Sparse Arrays
71+
72+
Given a list of input strings and a set of query strings, return the number of times each query string appears in the list.
73+
74+
75+
76+
| Python | Elixir | TypeScript | Go | Scheme |
77+
|--------|--------|------------|----|--------|
78+
||||||

0 commit comments

Comments
 (0)