carefree-ladka

//https://gist.github.com/carefree-ladka/f141d0efcefb0260f380daea7cdab425

class TreeNode {
  constructor(val) {
    this.val = val;
    this.left = null;
    this.right = null;
  }
}

carefree-ladka

import React, { useState, useEffect } from 'react';

const InfiniteScroll = () => {
  const [data, setData] = useState([]);
  const [page, setPage] = useState(1); // Track current page
  const [loading, setLoading] = useState(false); // Track loading state

  const fetchData = async () => {
    setLoading(true); // Set loading state
    try {

carefree-ladka

class FenwickTree {
  constructor(size) {
    this.size = size;
    this.tree = Array(size + 1).fill(0); // Fenwick Tree array with 1-based indexing
  }

  update(index, delta) {
    // Update the tree with the delta
    for (let i = index; i <= this.size; i += i & -i) {
      this.tree[i] += delta; // Add delta to the current value

carefree-ladka

class SegmentTree {
  constructor(arr) {
    this.arr = arr
    this.n = arr.length;
    this.tree = Array(4 * this.n).fill(0);
    this.#build(arr, 0, 0, this.n - 1);
  }

  #build = (arr, node, start, end) => {
    if (start === end) {

carefree-ladka

class TrieNode {
  constructor() {
    this.children = {};
    this.isEndOfWord = false;
    this.word = null; // Store the complete word ending at this node
  }
}

class Trie {
  constructor() {

carefree-ladka

class SegmentTree {
  constructor(arr) {
    this.n = arr.length;
    this.treeSum = Array(4 * this.n).fill(0);
    this.treeMin = Array(4 * this.n).fill(Infinity);
    this.treeMax = Array(4 * this.n).fill(-Infinity);
    this.build(arr, 0, 0, this.n - 1);
  }

  build(arr, node, start, end) {

carefree-ladka

class TreeNode {
  constructor(val = 0, left = null, right = null) {
    this.val = val;
    this.left = left;
    this.right = right;
  }
}

const buildTree = (arr) => {

carefree-ladka

function partition(arr, lo, hi, compare) {
    // Choose a random pivot and move it to the start
    const randomIndex = Math.floor(Math.random() * (hi - lo + 1)) + lo;
    swap(arr, lo, randomIndex);
    const pivot = arr[lo];

    let i = lo + 1; // Start just after the pivot
    let j = hi;

carefree-ladka

class MinMaxPriorityQueue {

  #heap = []
  #compare;

  constructor(compare = (a, b) => a - b) {
    this.#compare = compare; // Default to Min-Heap if no compare function is provided
  }

  // Add a new element to the priority queue

carefree-ladka

\documentclass[letterpaper,11pt]{article}

\usepackage{latexsym}
\usepackage[empty]{fullpage}
\usepackage{titlesec}
\usepackage{marvosym}
\usepackage[usenames,dvipsnames]{color}
\usepackage{enumitem}
\usepackage[hidelinks]{hyperref}
\usepackage{fancyhdr}