b3191d9729
content: add new matrix question ( #227 )
...
This is an interesting question because it requires to break the matrix into a smaller matrix
2021-09-21 02:08:22 +08:00
0535dd0d7f
website: homepage improvements
2021-09-19 01:58:21 +08:00
1de5dd75ee
content: add new sliding window question ( #226 )
2021-09-17 00:22:00 +08:00
2ab149aa74
misc: update README
2021-09-14 13:58:54 +08:00
5ade227f71
contents: add Educative
2021-09-06 20:53:05 +08:00
c695750222
contents: proofread
2021-09-02 01:30:39 +08:00
11ad8c6f7c
contents: audit algorithms formatting
2021-05-29 17:37:38 +08:00
5d1265df24
algo: remove similar question ( #202 )
...
Removed
`- Sort a list where each element is no more than k positions away from its sorted position.`
as it is same as
`Sort a list of numbers in which each number is at a distance K from its actual position.`
2021-04-13 09:23:09 +08:00
11f9a22b86
content: check if a number is a power of 2 ( #196 )
...
* Check if a number is a power of 2
This representation may be easier to understand for some people.
If a number is power of two then `AND` operation between the number and its complement will result into the same number.
* Update binary.md
Co-authored-by: Yangshun Tay <tay.yang.shun@gmail.com>
2021-03-29 17:58:59 +08:00
ca24fc0f20
contents: update linked list insertion and deletion explanation ( #175 )
2020-09-25 16:54:54 +08:00
256c3847fe
contents: add tip on traversing arrays ( #171 )
2020-08-03 15:25:39 +08:00
c1386e812d
contents(oop): add new Elevator question ( #156 )
2020-03-15 13:24:48 +08:00
430b1ac501
contents: link to LeetCode's Longest Common Subsequence question ( #150 )
2019-12-31 19:42:56 +08:00
002c7f1215
chore: remove freeform questions
2019-09-25 19:05:35 -07:00
9631a1d8d9
misc: use Alice/Bob
2019-09-22 14:37:35 -07:00
c43337fdfb
Fix small issue with bfs algorithm ( #141 )
...
Algorithm performed a dfs rather than bfs because of the queue.pop() error on line 78. Updated to queue.popleft()
2019-09-20 20:10:12 -07:00
473dfb2d22
contents: add bfs algorithm ( #137 )
...
* Add new Graph traversal implementation
* Add seperate BFS implementation
* Cleanup code and comments
* Rename variable and remove another comment
* Switch to deque for DFS implementation
Signed-off-by: Aadit Kamat <aadit.k12@gmail.com>
* Switch back to recursive DFS and check for empty graph
Signed-off-by: Aadit Kamat <aadit.k12@gmail.com>
* Update graph.md
2019-09-13 11:46:55 -07:00
0da41f944f
algorithms: remove duplicate question from sorting-searching.md ( #134 )
2019-08-25 21:37:53 +08:00
e6193eca83
website: launch website
2019-07-15 02:25:49 -07:00
c19c9626d1
misc: restructure contents
2019-07-14 18:52:41 -07:00
