Skip to content
#

algorithms-implemented

Here are 392 public repositories matching this topic...

fernandobperezm
fernandobperezm commented Oct 18, 2020

Describe your change:

Added a solution to Project Euler Problem 203 "Squarefree Binomial Coefficients" Link.

The solution is based on three main pilars.

  1. Calculate the unique coefficients of a Pascal's Triangle of depth d .
  2. Calculate the prime numbers between 2 and the maximum coefficient Cmax using a variant of the Sieve of Eratos
adityaarakeri
adityaarakeri commented Oct 7, 2020

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 = 

Improve this page

Add a description, image, and links to the algorithms-implemented topic page so that developers can more easily learn about it.

Curate this topic

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."

Learn more

You can’t perform that action at this time.