\documentclass[10pt,a4paper]{article}

% Packages
\usepackage{fancyhdr}           % For header and footer
\usepackage{multicol}           % Allows multicols in tables
\usepackage{tabularx}           % Intelligent column widths
\usepackage{tabulary}           % Used in header and footer
\usepackage{hhline}             % Border under tables
\usepackage{graphicx}           % For images
\usepackage{xcolor}             % For hex colours
%\usepackage[utf8x]{inputenc}    % For unicode character support
\usepackage[T1]{fontenc}        % Without this we get weird character replacements
\usepackage{colortbl}           % For coloured tables
\usepackage{setspace}           % For line height
\usepackage{lastpage}           % Needed for total page number
\usepackage{seqsplit}           % Splits long words.
%\usepackage{opensans}          % Can't make this work so far. Shame. Would be lovely.
\usepackage[normalem]{ulem}     % For underlining links
% Most of the following are not required for the majority
% of cheat sheets but are needed for some symbol support.
\usepackage{amsmath}            % Symbols
\usepackage{MnSymbol}           % Symbols
\usepackage{wasysym}            % Symbols
%\usepackage[english,german,french,spanish,italian]{babel}              % Languages

% Document Info
\author{menos}
\pdfinfo{
  /Title (js-algorithms.pdf)
  /Creator (Cheatography)
  /Author (menos)
  /Subject (JS Algorithms Cheat Sheet)
}

% Lengths and widths
\addtolength{\textwidth}{6cm}
\addtolength{\textheight}{-1cm}
\addtolength{\hoffset}{-3cm}
\addtolength{\voffset}{-2cm}
\setlength{\tabcolsep}{0.2cm} % Space between columns
\setlength{\headsep}{-12pt} % Reduce space between header and content
\setlength{\headheight}{85pt} % If less, LaTeX automatically increases it
\renewcommand{\footrulewidth}{0pt} % Remove footer line
\renewcommand{\headrulewidth}{0pt} % Remove header line
\renewcommand{\seqinsert}{\ifmmode\allowbreak\else\-\fi} % Hyphens in seqsplit
% This two commands together give roughly
% the right line height in the tables
\renewcommand{\arraystretch}{1.3}
\onehalfspacing

% Commands
\newcommand{\SetRowColor}[1]{\noalign{\gdef\RowColorName{#1}}\rowcolor{\RowColorName}} % Shortcut for row colour
\newcommand{\mymulticolumn}[3]{\multicolumn{#1}{>{\columncolor{\RowColorName}}#2}{#3}} % For coloured multi-cols
\newcolumntype{x}[1]{>{\raggedright}p{#1}} % New column types for ragged-right paragraph columns
\newcommand{\tn}{\tabularnewline} % Required as custom column type in use

% Font and Colours
\definecolor{HeadBackground}{HTML}{333333}
\definecolor{FootBackground}{HTML}{666666}
\definecolor{TextColor}{HTML}{333333}
\definecolor{DarkBackground}{HTML}{A3A3A3}
\definecolor{LightBackground}{HTML}{F3F3F3}
\renewcommand{\familydefault}{\sfdefault}
\color{TextColor}

% Header and Footer
\pagestyle{fancy}
\fancyhead{} % Set header to blank
\fancyfoot{} % Set footer to blank
\fancyhead[L]{
\noindent
\begin{multicols}{3}
\begin{tabulary}{5.8cm}{C}
    \SetRowColor{DarkBackground}
    \vspace{-7pt}
    {\parbox{\dimexpr\textwidth-2\fboxsep\relax}{\noindent
        \hspace*{-6pt}\includegraphics[width=5.8cm]{/web/www.cheatography.com/public/images/cheatography_logo.pdf}}
    }
\end{tabulary}
\columnbreak
\begin{tabulary}{11cm}{L}
    \vspace{-2pt}\large{\bf{\textcolor{DarkBackground}{\textrm{JS Algorithms Cheat Sheet}}}} \\
    \normalsize{by \textcolor{DarkBackground}{menos} via \textcolor{DarkBackground}{\uline{cheatography.com/153057/cs/32946/}}}
\end{tabulary}
\end{multicols}}

\fancyfoot[L]{ \footnotesize
\noindent
\begin{multicols}{3}
\begin{tabulary}{5.8cm}{LL}
  \SetRowColor{FootBackground}
  \mymulticolumn{2}{p{5.377cm}}{\bf\textcolor{white}{Cheatographer}}  \\
  \vspace{-2pt}menos \\
  \uline{cheatography.com/menos} \\
  \end{tabulary}
\vfill
\columnbreak
\begin{tabulary}{5.8cm}{L}
  \SetRowColor{FootBackground}
  \mymulticolumn{1}{p{5.377cm}}{\bf\textcolor{white}{Cheat Sheet}}  \\
   \vspace{-2pt}Not Yet Published.\\
   Updated 30th June, 2022.\\
   Page {\thepage} of \pageref{LastPage}.
\end{tabulary}
\vfill
\columnbreak
\begin{tabulary}{5.8cm}{L}
  \SetRowColor{FootBackground}
  \mymulticolumn{1}{p{5.377cm}}{\bf\textcolor{white}{Sponsor}}  \\
  \SetRowColor{white}
  \vspace{-5pt}
  %\includegraphics[width=48px,height=48px]{dave.jpeg}
  Measure your website readability!\\
  www.readability-score.com
\end{tabulary}
\end{multicols}}




\begin{document}
\raggedright
\raggedcolumns

% Set font size to small. Switch to any value
% from this page to resize cheat sheet text:
% www.emerson.emory.edu/services/latex/latex_169.html
\footnotesize % Small font.

\begin{multicols*}{2}

\begin{tabularx}{8.4cm}{X}
\SetRowColor{DarkBackground}
\mymulticolumn{1}{x{8.4cm}}{\bf\textcolor{white}{Sorting - Time Complexities}}  \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{1}{x{8.4cm}}{} \tn 
% Row Count 0 (+ 0)
% Row 1
\SetRowColor{white}
\mymulticolumn{1}{x{8.4cm}}{{\bf{Merge Sort}}} \tn 
% Row Count 1 (+ 1)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{1}{x{8.4cm}}{{\bf{Quick Sort}}} \tn 
% Row Count 2 (+ 1)
% Row 3
\SetRowColor{white}
\mymulticolumn{1}{x{8.4cm}}{{\bf{Bubble Sort}}} \tn 
% Row Count 3 (+ 1)
% Row 4
\SetRowColor{LightBackground}
\mymulticolumn{1}{x{8.4cm}}{{\bf{Insertion Sort}}} \tn 
% Row Count 4 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}-}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{8.4cm}{X}
\SetRowColor{DarkBackground}
\mymulticolumn{1}{x{8.4cm}}{\bf\textcolor{white}{Insertion Sort}}  \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{1}{x{8.4cm}}{Split the collection into an ordered \& unordered part.} \tn 
% Row Count 2 (+ 2)
% Row 1
\SetRowColor{white}
\mymulticolumn{1}{x{8.4cm}}{At firs the ordered part is just the first element.} \tn 
% Row Count 4 (+ 2)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{1}{x{8.4cm}}{Start from the first unordered index and move the item left until you find its place.} \tn 
% Row Count 6 (+ 2)
\hhline{>{\arrayrulecolor{DarkBackground}}-}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{8.4cm}{X}
\SetRowColor{DarkBackground}
\mymulticolumn{1}{x{8.4cm}}{\bf\textcolor{white}{Insertion Sort}}  \tn
\SetRowColor{LightBackground}
\mymulticolumn{1}{x{8.4cm}}{function insertionSort(arr) \{ \newline   let currentVal  \newline   for (let i = 1; i \textless{} arr.length; i++) \{ \newline     currentVal = arr{[}i{]} \newline     for (let j = i - 1; j \textgreater{}= 0 \&\& arr{[}j{]} \textgreater{} currentVal; j-{}-) \{ \newline       arr{[}j+1{]} = arr{[}j{]} \newline     \} \newline     arr{[}j+1{]} = currentVal \newline   \} \newline   return arr \newline \}} \tn 
\hhline{>{\arrayrulecolor{DarkBackground}}-}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{8.4cm}{X}
\SetRowColor{DarkBackground}
\mymulticolumn{1}{x{8.4cm}}{\bf\textcolor{white}{Quick Sort}}  \tn
\SetRowColor{LightBackground}
\mymulticolumn{1}{x{8.4cm}}{// place pivot in the right index and return pivot index \newline function pivot(arr: number{[}{]}, start = 0, end = arr.length - 1) \{ \newline   const pivot = arr{[}start{]}; \newline   let pivotIndex = start; \newline    \newline   for (let i = start + 1; i \textless{} end; i++) \{ \newline     if (arr{[}i{]} \textless{} pivot) \{ \newline       pivotIndex++; \newline       {[}arr{[}pivotIndex{]}, arr{[}i{]}{]} = {[}arr{[}i{]}, arr{[}pivotIndex{]}{]}; \newline     \} \newline   \} \newline   {[}arr{[}start{]}, arr{[}pivotIndex{]}{]} = {[}arr{[}pivotIndex{]}, arr{[}start{]}{]}; \newline \} \newline  \newline function quickSort(arr: number{[}{]}, start = 0, end = arr.length - 1) \{ \newline   if (left \textless{} right) \{ \newline     const pivot = pivot(arr, start, end); \newline      \newline     // left \newline     quickSort(arr, start, pivotIndex - 1); \newline     // right \newline     quickSort(arr, pivotIndex + 1, end); \newline   \} \newline    \newline   return arr; \newline \}} \tn 
\hhline{>{\arrayrulecolor{DarkBackground}}-}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{8.4cm}{X}
\SetRowColor{DarkBackground}
\mymulticolumn{1}{x{8.4cm}}{\bf\textcolor{white}{Merge Sort}}  \tn
\SetRowColor{LightBackground}
\mymulticolumn{1}{x{8.4cm}}{function merge(arr1: number{[}{]}, arr2: number{[}{]}): number{[}{]} \{ \newline   let result = {[}{]} \newline   let i = 0 \newline   let j = 0 \newline    \newline   while (i \textless{} arr1.length \&\& j \textless{} arr2.length) \{ \newline     if (arr1{[}i{]} \textless{} arr2{[}j{]}) \{ \newline       result.push(arr1{[}i{]}) \newline       i++ \newline     \} else \{ \newline       result.push(arr2{[}j{]}) \newline       j++ \newline     \} \newline   \} \newline    \newline   while (i \textless{} arr1.length) \{ \newline     result.push(arr1{[}i{]}) \newline     i++ \newline   \} \newline   while (j \textless{} arr2.length) \{ \newline     result.push(arr2{[}j{]}) \newline     j++ \newline   \} \newline    \newline   return result \newline \} \newline  \newline function mergeSort(arr: number{[}{]}): number{[}{]} \{ \newline   if (arr.length \textless{}= 1) return arr \newline    \newline   const middle = Math.floor(arr.length / 2) \newline    \newline   const left = mergeSort(arr.slice(0, middle)) \newline   const right = \seqsplit{mergeSort(arr.slice(middle))} \newline    \newline   return merge(left, right) \newline \}} \tn 
\hhline{>{\arrayrulecolor{DarkBackground}}-}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{8.4cm}{x{4 cm} x{4 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{BFS vs DFS}}  \tn
% Row 0
\SetRowColor{LightBackground}
{\bf{Breadth-first}} & {\bf{Depth-first}} \tn 
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
Use for finding the shortest path between 2 nodes & Getting all the way to the end of a tree \tn 
% Row Count 4 (+ 3)
% Row 2
\SetRowColor{LightBackground}
Level-order & Recursive \tn 
% Row Count 5 (+ 1)
% Row 3
\SetRowColor{white}
Better when target is far from the source & Better when target is closer \tn 
% Row Count 8 (+ 3)
% Row 4
\SetRowColor{LightBackground}
Generally slower & Generally faster \tn 
% Row Count 9 (+ 1)
% Row 5
\SetRowColor{white}
Queue (FIFO) & Stack (LIFO) \tn 
% Row Count 10 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{8.4cm}{X}
\SetRowColor{DarkBackground}
\mymulticolumn{1}{x{8.4cm}}{\bf\textcolor{white}{BFS: Max Depth of Binary Tree}}  \tn
\SetRowColor{LightBackground}
\mymulticolumn{1}{x{8.4cm}}{var maxDepth = function(root) \{ \newline      \newline   if (!root) return 0 \newline    \newline   let queue = {[}root{]} \newline   let max = 0 \newline    \newline   while (queue.length \textgreater{} 0) \{ \newline        \newline       max++ \newline       let len = queue.length  \newline        \newline       for (let i = 0; i \textless{} len; i++) \{ \newline           let node = queue.shift() \newline           if (node.left) queue.push(node.left) \newline           if (node.right) queue.push(node.right)             \newline       \} \newline        \newline   \} \newline    \newline   return max \newline  \newline \};} \tn 
\hhline{>{\arrayrulecolor{DarkBackground}}-}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{8.4cm}{X}
\SetRowColor{DarkBackground}
\mymulticolumn{1}{x{8.4cm}}{\bf\textcolor{white}{Binary Search}}  \tn
\SetRowColor{LightBackground}
\mymulticolumn{1}{x{8.4cm}}{function binarySearch(sortedArr: number{[}{]}, value: number): number \{ \newline   let left = 0; \newline   let right = sortedArr.length - 1; \newline    \newline   while (left \textless{}= right) \{ \newline     const middle = Math.round((right + left) / 2); \newline      \newline     if (sortedArr{[}middle{]} \textgreater{} value) \{ \newline       right = middle - 1; \newline     \} else if (sortedArr{[}middle{]} \textless{} value) \{ \newline       left = middle + 1; \newline     \} else \{ \newline       return middle; \newline     \} \newline   \} \newline   return -1; \newline \}} \tn 
\hhline{>{\arrayrulecolor{DarkBackground}}-}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{8.4cm}{X}
\SetRowColor{DarkBackground}
\mymulticolumn{1}{x{8.4cm}}{\bf\textcolor{white}{Min Window Substring (Sliding window)}}  \tn
\SetRowColor{LightBackground}
\mymulticolumn{1}{x{8.4cm}}{/{\emph{* \newline Given two strings s and t of lengths m and n respectively,  \newline return the minimum window substring of s such that  \newline every character in t (including duplicates)  \newline is included in the window. \newline If there is no such substring, return the empty string "". \newline }}/ \newline var minWindow = function(s, t) \{ \newline    \newline   let map = new Map() \newline    \newline   for (let c of t) \{ \newline     map.set(c,  map.has(c) ? map.get(c) + 1 : 1) \newline   \} \newline    \newline   let start = 0  \newline   let end = 0  \newline   let charsNeeded = t.length \newline   let minSubstring = s + ' ' \newline    \newline   while (end \textless{} s.length) \{ \newline      \newline     if (map.has(s{[}end{]})) \{ \newline       map.set(s{[}end{]}, map.get(s{[}end{]}) - 1) \newline       if (map.get(s{[}end{]}) \textgreater{}= 0) \{ \newline         charsNeeded-{}-    \newline       \} \newline     \} \newline      \newline     while(charsNeeded === 0 \&\& start \textless{}= end) \{ \newline       let currentString = s.slice(start, end+1)  \newline       if (currentString.length \textless{}= minSubstring.length) \{ \newline         minSubstring = currentString \newline       \} \newline        \newline       if (map.has(s{[}start{]})) \{ \newline         map.set( s{[}start{]}, map.get(s{[}start{]}) + 1 ) \newline         if (map.get(s{[}start{]}) \textgreater{} 0) \{ \newline           charsNeeded++ \newline         \} \newline       \} \newline       start++ \newline     \} \newline      \newline     end++ \newline   \} \newline    \newline   return minSubstring.length \textgreater{} s.length ? '' : minSubstring \newline \};} \tn 
\hhline{>{\arrayrulecolor{DarkBackground}}-}
\end{tabularx}
\par\addvspace{1.3em}


% That's all folks
\end{multicols*}

\end{document}