revanth0212

function findLengthOfLongestSubString(str) {
    var start = end = lengthOfLongestSubString = 0
    var hashMap = {}
    while(end < str.length) {
        if (str[end] in hashMap) {
            start = hashMap[str[end]] + 1
        } else {
            lengthOfLongestSubString = Math.max(lengthOfLongestSubString, (end-start+1))
        }
        hashMap[str[end]] = end

revanth0212

function initializeMap(i, j) {
    var result = new Array(i)
    for (var x = 0; x < i; x++) {
         var arr = new Array(j)
         arr.fill(null)
         result[x] = arr
    }
    return result
}

revanth0212

var leftArray = rightArray = prod = []

var leftHashMap = rightHashMap = {}

function constructLeftArrayElement (arr, i) {
    if (i <= 0) {
        leftHashMap[i] = 1
        return 1
    } else {
        if (leftHashMap.hasOwnProperty(i-1)) {

revanth0212

function swap(arr, i, j) {
    var temp = arr[i]
    arr[i] = arr[j]
    arr[j] = temp
    return arr
}

function partition(arr, start, end) {
    var pivot = end
    while(start <= end) {

revanth0212

function swap(arr, i, j) {
    var temp = arr[i]
    arr[i] = arr[j]
    arr[j] = temp
    return arr
}

function partition(arr, start, end) {
    var pivot = end
    while(start <= end) {

revanth0212

function swap(arr, i, j) {
    var temp = arr[i]
    arr[i] = arr[j]
    arr[j] = temp
    return arr
}

function partition(arr, start, end) {
    var pivot = end
    while(start <= end) {