codediodeio

// Given a string, find the length of the longest substring without repeating characters.

// Examples:

// Given "abcabcbb", the answer is "abc", which the length is 3.

// Given "bbbbb", the answer is "b", with the length of 1.

// Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring.

P1xt

<section class="leader-table">
  <h2>All Time Leaderboard</h2>
  <table class="table-hover table-striped">
    <thead>
      <tr>
        <th colspan="2">Camper</th>
        <th>Points in past 30 days</th>
        <th>All time Points</th>
      </tr>
    </thead>

kavitshah8

function createAndInitialize2DArray(size) {
  // catch a bug & fix me!
  var defaultValue = 0;
  var twoDimensionalArray = [];

  function initOneDArray() {
    var row = [];
    for (var i = 0; i < size; i++) {
      row.push(defaultValue);
    }