-
Notifications
You must be signed in to change notification settings - Fork 35
/
topics.yaml
444 lines (419 loc) · 13.5 KB
/
topics.yaml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
---
# See the contributing guidelines for details on the formatting here.
"25":
title: "Binary Tree Zigzag Level Order Traversal"
difficulty: "Medium"
source: "Leetcode"
body: |
<strong>
Binary Tree Traversal
</strong>
<br>
Given the `root` of a binary tree, return the zigzag level
order traversal of its nodes' values (i.e. from left to right,
then right to left for the next level and alternate between).
</br>
<a
href="https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/"
target="_blank">
🔗 Leetcode Link!</a>
author_name: "Mario Carbonell"
"24":
title: "How to Remove Array Duplicates in ES6"
difficulty: "Beginner"
source: "Medium - Daily JS"
body: |
<strong>
3 easy ways to remove duplicates in arrays
</strong>
<br>
Quick and easy!
</br>
<a href="https://bit.ly/3FtTPxb" target="_blank">
🔗 Blog post Link!</a>
author_name: "Samantha Ming"
"23":
title: "How to Break Into the Tech Industry"
difficulty: "Beginner"
source: "haseebq.com"
body: |
<strong>
This is a fantastic blog post by Haseeb Qureshi
</strong>
<br>
How to break into tech job hunting and interviews
</br>
<a href="https://bit.ly/3tYwIFF" target="_blank">
🔗 Blog post Link!</a>
author_name: "Jesus Quezada"
"22":
title: "Roman to integer"
difficulty: "Beginner"
source: "Leetcode"
body: |
<strong>Algorithm focused on string manipulation!</strong><br>
Find the integer value of a given roman string. <br>
Roman numerals are represented by symbols I, V, X, L, C, D and M.<br>
Roman numerals are written largest to smallest from left to right.<br>
However, 4 is not IIII. Instead, the number four is written as IV.<br>
Same principle applies to the number 9, which is written as IX. <br>
There are six instances where subtraction is used:<br>
I can be placed before V (5) and X (10) to make 4 and 9. <br>
X can be placed before L (50) and C (100) to make 40 and 90. <br>
C can be placed before D (500) and M (1000) to make 400 and 900. <br>
<br>
<a href="https://leetcode.com/problems/roman-to-integer/"
target="_blank">Leetcode challenge Link!</a>
author_name: "Pedro Ramirez"
"21":
title: "Even Fibonacci Numbers"
difficulty: "Beginner"
source: "ProjectEuler.net"
body: |
<strong>
Problem 2 of Project Euler
</strong>
<br>
Each new term in the Fibonacci sequence is generated
by adding the previous two terms. By starting with 1
and 2, the first 10 terms will be:
</br>
<br>
1, 2, 3, 4, 8, 13, 21, 34, 55, 89, ...
</br>
<br>
By considering the terms in the Fibonacci sequence
whose values do not exceed four million (4000000),
find the sum of the even-valued terms.
</br>
<a href="https://projecteuler.net/problem=2"
target="_blank">🔗 Code Challenge Link!</a>
author_name: "Mario Carbonell"
"20":
title: "Sorting an array using insertion sort"
difficulty: "Beginner"
source: "pepcoding.com"
body: |
<strong>
Problem that highlights the insertion sort algorithm.
</strong>
<br>
Given an array of integers, sort it in an ascending order
using insertion sort.
</br>
<a href="https://bit.ly/pepcoding-insertion-sort"
target="_blank">🔗 Code Challenge Link!</a>
author_name: "Davis Omokaro"
"19":
title: "Valid Anagram"
difficulty: "Beginner"
source: "LeetCode"
body: |
<strong>
This is a beginner problem involving strings,
comparisons and hash tables.
</strong>
<br>
Given two strings s and t, return true if
t is an anagram of s, and false otherwise.
</br>
<a href="https://leetcode.com/problems/valid-anagram/"
target="_blank"> 🔗 LeetCode - Valid Anagram</a>
author_name: "Maeling Murphy"
"18":
title: "Maximum Subarray"
difficulty: "Beginner"
source: "LeetCode"
body: |
<strong>
This is an easy level problem that can be used
to solve a lot of algorithms.
It uses a pattern known as the 'Sliding Window' technique.
Many algorithms in which you would implement a sliding window,
uses words like 'sum','continous' or 'contigous'.
</strong>
<br>
Given an integer array called nums, find the contiguous
subarray (containing at least one number) which has the largest
sum and return its sum.
</br>
<a href="https://leetcode.com/problems/maximum-subarray/"
target="_blank"> 🔗 Leetcode - Max Subarray</a>
author_name: "Dolly Desir"
"17":
title: "JavaScript 3 FizzBuzz Solutions, Including the Shortest"
difficulty: "Beginner"
source: "Dev Genius"
body: |
<strong>
Three ways to answer FizzBuzz using Javascript.
</strong>
<br>
FizzBuzz is quite the popular coding question.
</br>
<br>
If you haven't tried to tackle the problem then give this article a read!
</br>
<a href="https://tinyurl.com/hd3smmuk"
target="_blank">🔗 FizzBuzz Solutions Link!</a>
author_name: "Jadiva Montealegre"
"16":
title: "Bubble Sort"
difficulty: "Beginner"
source: "Algorithms: Explained and Animated"
body: |
<strong>
Video animations to illustrate how data moves during bubble sort.
</strong>
<br>
Visualize bubble sort & other algorithms with free Android/iPhone apps.
</br>
<a href="https://www.youtube.com/watch?v=54fOXwu_5Es"
target="_blank">🔗 Bubble Sort Visualization Link!</a>
author_name: "Tiffany"
"15":
title: "Multiples of 3 and 5"
difficulty: "Beginner"
source: "ProjectEuler.net"
body: |
<strong>
This also is a beginner problem. It will allow you to think
through the steps of a straightforward mathematical problem,
and solve it in it's component steps.
</strong>
<br>
Sum all the multiples of 3 or 5 below 1000.
</br>
<a href="https://projecteuler.net/problem=1"
target="_blank">🔗 Code Challenge Link!</a>
author_name: "Eamonn Cottrell"
"14":
title: "Convert Age to Days"
difficulty: "Beginner"
source: "Edabit.com"
body: |
<strong>
This is a beginner problem that works with conversion of different
time measurements. This site is great for having very
basic to more advanced problems of every topic.
</strong>
<br>
Create a function that takes the age in years and returns the age in days.
</br>
<a href="https://edabit.com/challenge/bL7hSc6Zh4zZJzGmw"
target="_blank">🔗 Code Challenge Link!</a>
author_name: "Manon Sainton"
"13":
title: "Sort Array By Parity"
difficulty: "Beginner"
source: "LeetCode"
body: |
<strong>
Practice array manipulation with
different problem solving approaches.
</strong>
<br>
Given an integer array, move all the even integers
at the beginning of the array followed by
all the odd integers.
<br>
<a href="https://leetcode.com/problems/sort-array-by-parity/"
target="_blank">🔗 Code Challenge Link!</a>
author_name: "Kevin Minutti"
"12":
title: "Binary Search"
difficulty: "Beginner"
source: "Binary Search"
body: |
<strong>
Learn Algorithms Together
</strong>
<br>
Join or create a room, invite your friends, and get ready to
solve problems together.
You'll all get the same coding question to solve.
Only you can see your editor.
Chat and solve questions together. Once you're done, you can
browse other people's solutions.
</br>
<a href="https://binarysearch.com/"
target="_blank">🔗 Binary Search Website!</a>
author_name: "Hulya Karakaya"
"11":
title: "How to Prepare for Technical Interviews"
difficulty: "Beginner"
source: "YouTube"
body: |
<strong>
A very meaningful and pragmatic way of approaching leetcode problems
</strong>
<br>
Follow this strategy to effectively prepare for your technical
interviews!
</br>
<a href="https://www.youtube.com/watch?v=7UlslIXHNsw"
target="_blank">🔗 How to Prepare for Technical Interviews Link!</a>
author_name: "Amy Cai"
"10":
title: "Sales by Match"
difficulty: "Beginner"
source: "Hacker Rank"
body: |
<strong>
A fun and easy frequency counter problem
</strong>
<br>
There is a large pile of socks that must be paired
by color. Given an array of integers representing
the color of each sock, determine how many pairs of
socks with matching colors there are.
</br>
<a href="https://www.hackerrank.com/challenges/sock-merchant/problem"
target="_blank">🔗 Code Challenge Link!</a>
author_name: "Mario Carbonell"
"9":
title: "Flexbox Learning Tool"
difficulty: "Beginner"
source: "Flexbox Defense"
body: |
<strong>
This is a nice interactive game for
learning how to use Flexbox in CSS.
</strong>
<br>
Use Flexbox properties to move towers into the
right defensive positions.
This game can help one better understand how
to effectively use and optimize
CSS Flexbox styling.
<br>
<a href="https://http://www.flexboxdefense.com/"
target="_blank">🔗 CSS Flexbox Tower Defense Game!</a>
author_name: "Johnathan Raiss"
"8":
title: "Single Number"
difficulty: "Beginner"
source: "Leetcode"
body: |
<strong>
A great easy problem to practice sorting!
</strong>
<br>
Given a non-empty array of integers nums,
every element appears twice except for one.
Find that single one.<br>
<br>
<a href="https://leetcode.com/problems/single-number/"
target="_blank">🔗 Code Challenge Link!</a>
author_name: "Kirill Grinash"
"7":
title: "1000-digit Fibonacci Number"
difficulty: "Beginner"
source: "ProjectEuler"
body: |
<strong>
This is a great problem for developing mathematical understanding while
solving a programming question.
</strong>
<br>
Find the index of first 1000 digit fibonacci number.
<br>
<a href="https://projecteuler.net/problem=25"
target="_blank">🔗 Code Challenge Link!</a>
author_name: "Sourav Singh Rawat"
"6":
title: "Palindrome Linked List"
difficulty: "Beginner"
source: "LeetCode"
body: |
<strong>
This is an excellent introduction to linked lists!
</strong>
<br>
Given the head of a singly linked list, return true if it is a palindrome.
<br>
<a href="https://leetcode.com/problems/palindrome-linked-list/"
target="_blank">🔗 Code Challenge Link!</a>
author_name: "Jesse Smith"
"5":
title: "Tutorial for Interview Prep"
difficulty: "Beginner"
source: "PassMyInterview"
body: |
<strong>
This is a brilliant training tutorial to pass any job
interview in one attempt!
</strong>
<br>
If you have any any job interview coming up, make sure
you study this brilliant
training tutorial from start to finish!
It is guaranteed to help you PASS your interview!
This resource has helped countless number of persons from all
fields ace their interview.<br>
<br>
<a href="https://passmyinterview.com/top-30-interview-questions-answers/"
target="_blank">🔗 TOP 30 INTERVIEW QUESTIONS and Answers</a>
author_name: "Anita Ihuman"
"4":
title: "Valid Parentheses"
difficulty: "Beginner"
source: "LeetCode"
body: |
<strong>
This is a great introduction to the Stack data structure!
</strong>
<br>
Given a string s containing just the characters '(', ')', ' {', '}',
'[' and ']', determine if the input string is valid.
<br>
An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order. <br>
<br>
<a href="https://leetcode.com/problems/valid-parentheses/"
target="_blank">🔗 Code Challenge Link!</a>
author_name: "Jesus Quezada"
"3":
title: "Number of Islands"
difficulty: "Medium"
source: "LeetCode"
body: |
<strong>This is a good problem for learning graph traversal!</strong><br>
Given an m x n 2D binary grid grid which represents a map of '1's (land)
and '0's (water), return the number of islands. <br>
An island is surrounded by water and is formed by connecting adjacent
lands horizontally or vertically. You may assume all four edges of
the grid are all surrounded by water. <br>
<br>
<a href="https://leetcode.com/problems/number-of-islands/"
target="_blank">🔗 Code Challenge Link!</a>
author_name: "Trevor"
"2":
title: "Common Prefix Problem"
difficulty: "Beginner"
source: "Leetcode"
body: |
<strong>This link is a great beginner-level algorithm focused
on strings!</strong><br>
Write a function to find the longest common prefix string amongst
an array of strings. <br>
If there is no common prefix, return an empty string "".<br>
<br>
<a href="https://leetcode.com/problems/longest-common-prefix/"
target="_blank">🔗 Code Challenge Link!</a>
author_name: "Kristal"
"1":
title: "Quarter of the Year"
difficulty: "Beginner"
source: "Codewars"
body: |
Given a month as an integer from 1 to 12, return to which quarter
of the year it belongs as an integer number. <br>
For example: month 2 (February), is part of the first quarter; month
6 (June), is part of the second quarter; and month 11 (November),
is part of the fourth quarter.<br>
<br>
<a
href="https://www.codewars.com/kata/5ce9c1000bab0b001134f5af/train/python"
target="_blank">🔗 Code Challenge Link!</a>