anish000kumar

function Node(value, parent = null){
  this.value = value
  this.left = null
  this.right = null
  this.parent = parent
  
}

// create tree

anish000kumar

function Node(value, parent = null){
  this.value = value
  this.left = null
  this.right = null
  this.parent = parent
  
}

// create tree

anish000kumar

function Node(value, parent = null){
  this.value = value
  this.left = null
  this.right = null
  this.parent = parent
  
}

// create tree

anish000kumar

class FenwickTree{
  constructor(array){
    this.source = [...array]
    this.length = this.source.length;
    this.fenwick = new Array(array.length+1).fill(0)
    this.build();
  }
  
  build(){
    for(let i = 0; i < this.length; i++)

anish000kumar

function animate({ timing, duration, draw }){
  return new Promise((resolve, reject) => {
      const start = performance.now();
      
      function animation(time){
        const progress = Math.min((time-start)/duration, 1);
        const visualProgress = timing ? timing(progress): progress;
        draw(visualProgress);
          
        if(progress < 1) requestAnimationFrame(animation)

anish000kumar

class Calendar {
  constructor(selector){
    this.MONTHS= ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'July', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec']
    this.root = document.querySelector(selector);
    this.activeDateTime = new Date();
    this.render();
    this.attachEvents();
   
  }
  

anish000kumar

def compress(arr):
  arr.sort();
  compress_map = {}
  
  val = 1
  for el in arr: 
    if el not in compress_map: 
      compress_map[el] = val
      val += 1
   

anish000kumar

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    
    def findMiddle(self, head):
        slow, fast = head, head
        while fast and fast.next and fast.next.next:

anish000kumar

def minSwaps(arr, N):

    newArr = [ (arr[i], i) for i in range(len(arr)) ]
    newArr.sort()
    ans = 0
    
    for i in range(len(newArr)):
        j = newArr[i][1]
        
        while newArr[i][1] != newArr[j][1]:

anish000kumar

from collections import deque  


def maxSlidingWindow(nums, window_size):

    start, ans = 0, []
    q = deque();
    
    for end in range(len(nums)):
        while q and nums[end] > nums[q[-1]]: q.pop()