Skip to content
#

algorithms-implemented

Here are 394 public repositories matching this topic...

aceking007
aceking007 commented Oct 3, 2020

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)

vJechsmayr
vJechsmayr commented Oct 2, 2020

Description of the Problem

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

  • Integers in each row are sorted from left to right.
  • The first integer of each row is greater than the last integer of the previous row.

Example 1:

Input:
matrix = [
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]

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.