algorithm-competitions
Here are 137 public repositories matching this topic...
-
Updated
Oct 2, 2020 - Java
wave sort
-
Updated
Oct 6, 2020 - Go
-
Updated
Oct 16, 2020 - C++
-
Updated
Oct 14, 2020 - C++
-
Updated
Oct 23, 2019 - Python
-
Updated
Oct 11, 2020 - C++
-
Updated
Sep 8, 2020
There are two sets of refactoring that can be performed on our codebase to make them more efficient and utilize the full potential offered by Qt Framework. See below:
- There is no need to explicitly call
deleteon widgets that are allocated on Heap as long as in their constructor we have specified the parent widget for it. Consider this example below:
class Widget: public QObject-
Updated
May 5, 2019 - JavaScript
-
Updated
Oct 16, 2020 - C++
-
Updated
Jun 7, 2019
-
Updated
Dec 5, 2017 - Java
-
Updated
Sep 17, 2017 - C++
-
Updated
Oct 16, 2020 - C++
-
Updated
Mar 3, 2019 - C++
-
Updated
Apr 11, 2020 - C++
-
Updated
Jul 8, 2017 - Java
-
Updated
Sep 27, 2020 - C++
-
Updated
Oct 13, 2019 - C++
-
Updated
Jul 29, 2020 - C++
-
Updated
Jan 23, 2020 - Python
-
Updated
Jan 11, 2018 - C++
-
Updated
Oct 25, 2019 - Haskell
-
Updated
Mar 29, 2019 - C#
-
Updated
Dec 9, 2019 - PHP
-
Updated
Aug 3, 2020 - TypeScript
Currently, the design decisions and code descriptions are maintained in a file development_notes.txt. Move it to the repository wiki.
Improve this page
Add a description, image, and links to the algorithm-competitions topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the algorithm-competitions topic, visit your repo's landing page and select "manage topics."
Project Euler has about 700 problems, but the current repository hosts solutions for only about 60-70 problems.
I'm willing to work on the issue and also if someone wants to help they can join in.
We can create guidelines on how many minimum solutions a PR should have to prevent spammy PRs with just one or two easy solutions. (open to discussion)