lee101

<svg viewBox="0 0 100 150" xmlns="http://www.w3.org/2000/svg" width="512" height="512">
  <defs>
    <!-- Brand Gradient -->
    <linearGradient id="brand-gradient" x1="0%" y1="100%" x2="0%" y2="0%">
      <stop offset="0%" stop-color="#d79f2a"/>
      <stop offset="100%" stop-color="#d34675"/>
    </linearGradient>
  </defs>

  <style>

lee101

<link rel="import" href="../code-mirror/code-mirror.html">
<link rel="import" href="../core-drawer-panel/core-drawer-panel.html">
<link rel="import" href="../core-scaffold/core-scaffold.html">
<link rel="import" href="../core-header-panel/core-header-panel.html">
<link rel="import" href="../core-menu/core-menu.html">
<link rel="import" href="../core-item/core-item.html">
<link rel="import" href="../core-icon-button/core-icon-button.html">
<link rel="import" href="../core-toolbar/core-toolbar.html">
<link rel="import" href="../core-menu/core-submenu.html">

lee101

# a contiguous sub-sequence is a sequence taken by starting at a start point and taking everything until an end point.
# e.g the sequence [1, 2, 3] has sub sequences [], [1], [2], [3], [1, 2], [2, 3] and [1, 2, 3]
# Given a list of numbers, return the contiguous sub-sequence which has the largest sum (add up all of the numbers)

# eg [1, 2, 3] -> [1, 2, 3]
# [1, -2, 3] -> [3]
# [2, -1, 3] -> [2, -1, 3]
# [-1, 1, 1, 2, -1, 2, -5] -> [1, 1, 2, -1, 2]

# Gotchas:

lee101

# We have some rocks represented as numbers (weights of the rocks)

# We want to know if its possible to balance scales using all of our rocks.

# Given a list of numbers,
# return if it is possible to partition the numbers into two sets with equal sums,
# where a number has to be in either one or the other set.

# eg
# [10, 10] -> True

lee101

Low Contrast Diagonal Stripes Background

This is the background pattern I'm using in my personal website.

Forked from fsa's Pen Low Contrast Diagonal Stripes Background.

Forked from Georgi Paskov's Pen Low Contrast Diagonal Stripes Background.

A Pen by Sean McConnell on CodePen.

License.