let nums = [1,2,3,1]

var containsDuplicate = function(nums) {
    let obj = {};
    for(let i =0; i< nums.length; i++){
        if(obj[nums[i]]){
            obj[nums[i]] += 1;
            return true;
        }else{
            obj[nums[i]] = 1;
        }
    }
    return false;
};

console.log(containsDuplicate(nums));

console.log("xa")

const reverse = str => str.split('').reverse().join('');
reverse('hello world');     
// Result: 'dlrow olleh'

import React, { useState, useEffect } from 'react';
import Link from 'next/link';

export default function CookieBanner() {
    // Initialize with a default value (false if not previously set in localStorage)
  const [cookieConsent, setCookieConsent] = useState(() =>
    localStorage.getItem('cookieConsent') === 'true' ? true : false
  );

  useEffect(() => {
    const newCookieConsent = cookieConsent ? 'granted' : 'denied';

    window.gtag('consent', 'update', {
      analytics_storage: newCookieConsent
    });

    localStorage.setItem('cookieConsent', String(cookieConsent));
  }, [cookieConsent]);

  return !cookieConsent && (
    <div>
    <div>
        <p>
        We use cookies to enhance the user experience.{' '}
        <Link href='/privacy/'>View privacy policy</Link>
        </p>
    </div>
    <div>
        <button type="button" onClick={() => setCookieConsent(false)}>Decline</button>
        <button type="button" onClick={() => setCookieConsent(true)}>Allow</button>
    </div>
    </div>
  )
}

//QM Helper by Leif Messinger
//Groups numbers by number of bits and shows their binary representations.
//To be used on x.com
const minterms = prompt("Enter your minterms separated by commas").split(",").map(x => parseInt(x.trim()));
const maxNumBits = minterms.reduce(function(a, b) {
	return Math.max(a, Math.log2(b));
});
const bitGroups = [];
for(let i = 0; i < maxNumBits; ++i){
	bitGroups.push([]);
}
for(const minterm of minterms){
	let outputString = (minterm+" ");
	//Count the bits
	let count = 0;
	for (var i = maxNumBits; i >= 0; --i) {
		if((minterm >> i) & 1){
			++count;
			outputString += "1";
		}else{
			outputString += "0";
		}
	}
	bitGroups[count].push(outputString);
}
document.body.textContent = "";
document.body.style.setProperty("white-space", "pre");
for(const group of bitGroups){
	for(const outputString of group){
		document.body.textContent += outputString + "\r\n";
	}
}

const toFixed = (n, fixed) => ~~(Math.pow(10, fixed) * n) / Math.pow(10, fixed);
// Examples
toFixed(25.198726354, 1);       // 25.1
toFixed(25.198726354, 2);       // 25.19
toFixed(25.198726354, 3);       // 25.198
toFixed(25.198726354, 4);       // 25.1987
toFixed(25.198726354, 5);       // 25.19872
toFixed(25.198726354, 6);       // 25.198726