/**
 * @param {number[]} nums
 * @return {number[]}
 */
var productExceptSelf = function(nums) {
    var output = [];
    var leftMult = 1;
    var rightMult = 1;
    for (var i=nums.length - 1; i >= 0; i--) {
        output[i] = rightMult;
        rightMult *= nums[i];
        console.log({output: JSON.stringify(output), i})
    }
    for (var j=0; j < nums.length; j++) {
        output[j] *= leftMult;
        leftMult *= nums[j];
        console.log({output: JSON.stringify(output), j})
    }
    return output;
};

console.log(productExceptSelf([1, 2, 3, 4]))

//Upvotes comments according to a regex pattern. I tried it out on https://www.reddit.com/r/VALORANT/comments/ne74n4/please_admire_this_clip_precise_gunplay_btw/
//Known bugs:
	//If a comment was already upvoted, it gets downvoted
	//For some reason, it has around a 50-70% success rate. The case insensitive bit works, but I think some of the query selector stuff gets changed. Still, 50% is good

let comments = document.getElementsByClassName("_3tw__eCCe7j-epNCKGXUKk"); //Comment class
let commentsToUpvote = [];
const regexToMatch = /wtf/gi;
for(let comment of comments){
	let text = comment.querySelector("._1qeIAgB0cPwnLhDF9XSiJM"); //Comment content class
	if(text == undefined){
	continue;
	}
	text = text.textContent;
	if(regexToMatch.test(text)){
	console.log(text);
	commentsToUpvote.push(comment);
	}
}
function upvote(comment){
	console.log(comment.querySelector(".icon-upvote")); //Just showing you what it's doing
	comment.querySelector(".icon-upvote").click();
}
function slowRecurse(){
	let comment = commentsToUpvote.pop(); //It's gonna go bottom to top but whatever
	if(comment != undefined){
	upvote(comment);
	setTimeout(slowRecurse,500);
	}
}
slowRecurse();

// Time Complexity : O(N)
// Space Complexity : O(1)
 
var isMonotonic = function(nums) {
    let isMono = null;
    for(let i = 1; i < nums.length; i++) {
        if(isMono === null) {
            if(nums[i - 1] < nums[i]) isMono = 0;
            else if(nums[i - 1] > nums[i]) isMono = 1;
            continue;
        }
        if(nums[i - 1] < nums[i] && isMono !== 0) {
            return false;
        }
        else if(nums[i - 1] > nums[i] && isMono !== 1) {
            return false;
        }
    }
    
    return true;
    
};

let nums1 = [1,2,2,3]
let nums2 = [6,5,4,4]
let nums3 = [1,3,2]

console.log(isMonotonic(nums1));
console.log(isMonotonic(nums2));
console.log(isMonotonic(nums3));

// Get the text that the user has selected
const getSelectedText = () => window.getSelection().toString();
getSelectedText();

const geometricProgression = (end, start = 1, step = 2) =>
  Array.from({
    length: Math.floor(Math.log(end / start) / Math.log(step)) + 1,
  }).map((_, i) => start * step ** i);
  
geometricProgression(256); // [1, 2, 4, 8, 16, 32, 64, 128, 256]
geometricProgression(256, 3); // [3, 6, 12, 24, 48, 96, 192]
geometricProgression(256, 1, 4); // [1, 4, 16, 64, 256]

const linearSearch = (arr, item) => {
  for (const i in arr) {
    if (arr[i] === item) return +i;
  }
  return -1;
};

linearSearch([2, 9, 9], 9); // 1
linearSearch([2, 9, 9], 7); // -1