jmichelin

Prompt

Given an array a that contains only numbers in the range from 1 to a.length, find the first duplicate number. (See examples below to see what we mean here by the "first" duplicate).

If there are no such elements, return -1.

Note: Your solution should be O(n) runtime and O(1) space.

Examples

jmichelin

const hasPathSum = function(node, targetSum) {
  if (!node) return targetSum === 0;
  targetSum -= node.val;
  return hasPathSum(node.left, targetSum) || hasPathSum(node.right, targetSum);
};


/*

const root = {

jmichelin

// .babelrc
{
  "presets": ["es2015", "react"]
}

jmichelin

package org.sdo.alg.other

/**
  * Created by dsemenov
  * Date: 1/7/16.
  */
trait WaterCollect {
  def collectWater(towers: List[Int]): Int = {
    def walkMax(towers: List[Int]): List[Int] = {
      var tempMax = 0

jmichelin

#  ---------------------------------------------------------------------------
#
#  Description:  This file holds all my BASH configurations and aliases
#
#  Sections:
#  1.   Environment Configuration
#  2.   Make Terminal Better (remapping defaults and adding functionality)
#  3.   File and Folder Management
#  4.   Searching
#  5.   Process Management

jmichelin

#  ht: http://natelandau.com/my-mac-osx-bash_profile/
#  ---------------------------------------------------------------------------
#
#  Description:  This file holds all my BASH configurations and aliases
#
#  Sections:
#  1.   Environment Configuration
#  2.   Make Terminal Better (remapping defaults and adding functionality)
#  3.   File and Folder Management
#  4.   Searching

jmichelin

Becky

No Lions were harmed during this photo

---

Becky was born and raised in the streets of LA. She went to college in da east side and enjoyed it. Coding for her private prototype like a ninja.

Her favorite websites

• Top favorite site
• i love this place!
• Get that that money with that prototype y'all