\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{nirintsoa}
\pdfinfo{
  /Title (programming-interview-live-coding.pdf)
  /Creator (Cheatography)
  /Author (nirintsoa)
  /Subject (Programming Interview Live Coding 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}{2596BE}
\definecolor{LightBackground}{HTML}{F1F8FA}
\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{Programming Interview Live Coding Cheat Sheet}}}} \\
    \normalsize{by \textcolor{DarkBackground}{nirintsoa} via \textcolor{DarkBackground}{\uline{cheatography.com/194635/cs/40859/}}}
\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}nirintsoa \\
  \uline{cheatography.com/nirintsoa} \\
  \end{tabulary}
\vfill
\columnbreak
\begin{tabulary}{5.8cm}{L}
  \SetRowColor{FootBackground}
  \mymulticolumn{1}{p{5.377cm}}{\bf\textcolor{white}{Cheat Sheet}}  \\
   \vspace{-2pt}Published 16th October, 2023.\\
   Updated 16th October, 2023.\\
   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*}{3}

\begin{tabularx}{5.377cm}{x{1.09494 cm} x{3.88206 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{5.377cm}}{\bf\textcolor{white}{Data Structures}}  \tn
% Row 0
\SetRowColor{LightBackground}
Array & An array is a data structure that collects elements of the same data type and stores them in contiguous memory locations. \tn 
% Row Count 4 (+ 4)
% Row 1
\SetRowColor{white}
String & A string (or string literal) is an array of characters (i.e. any combination of numbers, letters, symbols). \tn 
% Row Count 8 (+ 4)
% Row 2
\SetRowColor{LightBackground}
Linked List & A Linked List is a user-defined data structure that consists of nodes that point to either in one direction (singly Linked List) or both directions (doubly Linked List). \tn 
% Row Count 14 (+ 6)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{5.377cm}{x{1.09494 cm} x{3.88206 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{5.377cm}}{\bf\textcolor{white}{Linear Data Structures}}  \tn
% Row 0
\SetRowColor{LightBackground}
Stack & The linear data structure stores the data elements in the LIFO or the 'last-in/ first out' order. \tn 
% Row Count 4 (+ 4)
% Row 1
\SetRowColor{white}
Queue & The queue is a linear data structure that follows the FIFO order. FIFO stands for First In and First Out. \tn 
% Row Count 8 (+ 4)
% Row 2
\SetRowColor{LightBackground}
Linked List & The last node of a data structure will be linked to the first node of the next data structure. \tn 
% Row Count 12 (+ 4)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{5.377cm}{p{0.54747 cm} x{4.42953 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{5.377cm}}{\bf\textcolor{white}{Non-Linear Data Structures}}  \tn
% Row 0
\SetRowColor{LightBackground}
Tree & Tree data structures are hierarchic. The tree data structure collects the nodes together to depict and stimulate the sequence. Tree data structure does not store the data sequentially. It stores the data on multiple levels. \tn 
% Row Count 7 (+ 7)
% Row 1
\SetRowColor{white}
Graph & In Graph Data Structure, one node is simply connected to the other node through the edge of the graph. The Graph Data Structure obviously uses Non-linear data structures which are not sequentially arranged. \tn 
% Row Count 13 (+ 6)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{5.377cm}{x{1.69218 cm} x{3.28482 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{5.377cm}}{\bf\textcolor{white}{Algorithm}}  \tn
% Row 0
\SetRowColor{LightBackground}
Recursion & While technically not an algorithm, recursion is an algorithm technique used to help break down an algorithm into a base case and recursive cases. While these algorithms can also be implemented using loops, they tend to be more readable. \tn 
% Row Count 10 (+ 10)
% Row 1
\SetRowColor{white}
Sorting and searching & Sorting and searching are two fundamental operations that are performed on most data structures. Sorting serves to order elements in a particular way, while searching deals with finding the desired element in a particular data structure. \tn 
% Row Count 20 (+ 10)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{5.377cm}{x{1.19002 cm} x{1.64772 cm} x{1.73926 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{3}{x{5.377cm}}{\bf\textcolor{white}{Sorting Algorithms}}  \tn
% Row 0
\SetRowColor{LightBackground}
{\bf{Algorithm}} & {\bf{Time complexity}} & {\bf{Space complexity}} \tn 
% Row Count 2 (+ 2)
% Row 1
\SetRowColor{white}
Selection sort & O(n$^{\textrm{2}}$) & O(1) \tn 
% Row Count 4 (+ 2)
% Row 2
\SetRowColor{LightBackground}
Insertion sort & O(n$^{\textrm{2}}$) & O(1) \tn 
% Row Count 6 (+ 2)
% Row 3
\SetRowColor{white}
Counting sort & O(n + k) & O(k) \tn 
% Row Count 8 (+ 2)
% Row 4
\SetRowColor{LightBackground}
Quicksort & O(nlogn) & O(logn) \tn 
% Row Count 9 (+ 1)
% Row 5
\SetRowColor{white}
Mergesort & O(nlogn) & O(n) \tn 
% Row Count 10 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}---}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{5.377cm}{x{1.05271 cm} x{1.92234 cm} x{1.60195 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{3}{x{5.377cm}}{\bf\textcolor{white}{Searching Algorithms}}  \tn
% Row 0
\SetRowColor{LightBackground}
{\bf{Algorithm}} & {\bf{Time complexity}} & {\bf{Space complexity}} \tn 
% Row Count 2 (+ 2)
% Row 1
\SetRowColor{white}
Linear Search & O(n) & O(1) \tn 
% Row Count 4 (+ 2)
% Row 2
\SetRowColor{LightBackground}
Binary Search & O(logn) & O(1) iterative- O(logn) recursive \tn 
% Row Count 7 (+ 3)
% Row 3
\SetRowColor{white}
AVL Binary Search Tree & O(logn) & O(n) \tn 
% Row Count 10 (+ 3)
% Row 4
\SetRowColor{LightBackground}
BFS and DFS & O(V + E), where V is the number of vertices and E is the number of edges & O(V) \tn 
% Row Count 15 (+ 5)
\hhline{>{\arrayrulecolor{DarkBackground}}---}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{5.377cm}{p{0.4977 cm} x{4.4793 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{5.377cm}}{\bf\textcolor{white}{Stack Methods}}  \tn
% Row 0
\SetRowColor{LightBackground}
push & Adds a new element at the top of the stack \tn 
% Row Count 2 (+ 2)
% Row 1
\SetRowColor{white}
pop & Removes an element at the top of the stack \tn 
% Row Count 4 (+ 2)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{5.377cm}{p{0.64701 cm} x{4.32999 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{5.377cm}}{\bf\textcolor{white}{Queue Methods}}  \tn
% Row 0
\SetRowColor{LightBackground}
\seqsplit{insert} & Inserts an element at the end of the queue \tn 
% Row Count 2 (+ 2)
% Row 1
\SetRowColor{white}
\seqsplit{delete} & Removes an element at the top of the queue \tn 
% Row Count 4 (+ 2)
% Row 2
\SetRowColor{LightBackground}
toa & Gets the time required to retrieve an element in the queue \tn 
% Row Count 6 (+ 2)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{5.377cm}{x{2.73735 cm} x{2.23965 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{5.377cm}}{\bf\textcolor{white}{Binary Tree in Array (1-based)}}  \tn
% Row 0
\SetRowColor{LightBackground}
{\bf{Item}} & {\bf{Index}} \tn 
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
root & 1 \tn 
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
left child & 2n \tn 
% Row Count 3 (+ 1)
% Row 3
\SetRowColor{white}
right child & 2n+1 \tn 
% Row Count 4 (+ 1)
% Row 4
\SetRowColor{LightBackground}
parent & n/2 \tn 
% Row Count 5 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}

\begin{tabularx}{5.377cm}{x{2.73735 cm} x{2.23965 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{5.377cm}}{\bf\textcolor{white}{Binary Tree in Array (0-based)}}  \tn
% Row 0
\SetRowColor{LightBackground}
{\bf{Item}} & {\bf{Index}} \tn 
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
root & 0 \tn 
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
left child & 2r+1 \tn 
% Row Count 3 (+ 1)
% Row 3
\SetRowColor{white}
right child & 2r+2 \tn 
% Row Count 4 (+ 1)
% Row 4
\SetRowColor{LightBackground}
parent & (r-1)/2 \tn 
% Row Count 5 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}


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

\end{document}