algorithms-implemented
Here are 392 public repositories matching this topic...
-
Updated
Oct 29, 2020 - Java
Create N-bonacci.cpp
This Pull Request is for HacktoberFest 2020
Description of Change
Checklist
- Added description
-
Updated
Oct 28, 2020 - Go
-
Updated
Oct 17, 2020
-
Updated
Oct 29, 2020 - C++
-
Updated
Oct 16, 2020 - C++
-
Updated
Sep 30, 2020 - C++
-
Updated
Oct 28, 2020 - Mathematica
-
Updated
Mar 30, 2019 - Go
-
Updated
Oct 20, 2020 - C++
Description of the Problem
Find a Peak Element
A peak element is an element that is greater than its neighbors.
Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and return its index.
The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.
You may imagine that nums[-1] = nums[n] = -∞.
Example 1:
Input: nums =
-
Updated
Dec 5, 2017 - Java
-
Updated
Aug 19, 2020 - TypeScript
-
Updated
Oct 8, 2020 - C
-
Updated
Oct 26, 2020 - JavaScript
-
Updated
Nov 17, 2017 - Python
-
Updated
Oct 20, 2019 - C++
-
Updated
May 31, 2020 - Java
-
Updated
Oct 24, 2020 - C++
-
Updated
Oct 14, 2020 - Java
-
Updated
Dec 29, 2019 - Python
-
Updated
Mar 8, 2018 - Swift
-
Updated
Sep 2, 2020 - Pascal
-
Updated
Jul 19, 2020 - JavaScript
-
Updated
Oct 28, 2020 - C++
-
Updated
Dec 5, 2019 - Python
-
Updated
Oct 1, 2017 - Python
Improve this page
Add a description, image, and links to the algorithms-implemented topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the algorithms-implemented topic, visit your repo's landing page and select "manage topics."
Describe your change:
Added a solution to Project Euler Problem 203 "Squarefree Binomial Coefficients" Link.
The solution is based on three main pilars.
d
.2
and the maximum coefficientCmax
using a variant of the Sieve of Eratos