algorithms-implemented
Here are 405 public repositories matching this topic...
-
Updated
Jan 31, 2021 - Java
Create N-bonacci.cpp
This Pull Request is for HacktoberFest 2020
Description of Change
Checklist
- Added description
-
Updated
Jan 19, 2021 - Go
-
Updated
Nov 12, 2020
-
Updated
Jan 28, 2021 - Ruby
-
Updated
Jan 21, 2021 - C++
-
Updated
Dec 13, 2020 - C++
-
Updated
Sep 30, 2020 - C++
-
Updated
Jan 13, 2021 - Mathematica
-
Updated
Mar 30, 2019 - Go
-
Updated
Oct 31, 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 11, 2020 - Java
-
Updated
Aug 19, 2020 - TypeScript
-
Updated
Jan 30, 2021 - JavaScript
-
Updated
Oct 8, 2020 - C
-
Updated
Nov 17, 2017 - Python
-
Updated
May 31, 2020 - Java
-
Updated
Oct 24, 2020 - C++
Adding several other relevant functionalities to the code .
-
Updated
Feb 1, 2021 - Java
-
Updated
Oct 20, 2019 - C++
-
Updated
Dec 25, 2020 - Python
-
Updated
Dec 29, 2019 - Python
-
Updated
Mar 8, 2018 - Swift
-
Updated
Sep 2, 2020 - Pascal
-
Updated
Jul 19, 2020 - JavaScript
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."
As discussed in #3926, the following files do not have
.pyextensions because TensorFlow does not yet support the current Python.TODO: Restore the
.pyfile extensions