From bab6964f25d400639b130923249df1b6a84ec1c4 Mon Sep 17 00:00:00 2001
From: Drybones2048 <93012498+Drybones2048@users.noreply.github.com>
Date: Wed, 25 Sep 2024 14:33:08 -0400
Subject: [PATCH] Update README.md

Updated the README with a Table of Contents and added more information are what algorithms are covered where in the repository and with what time complexity.
---
 README.md | 37 ++++++++++++++++++++++++++++++++-----
 1 file changed, 32 insertions(+), 5 deletions(-)

diff --git a/README.md b/README.md
index a29e4fc..3bb38e1 100644
--- a/README.md
+++ b/README.md
@@ -1,3 +1,30 @@
+# Table of Contents
+1. [Coding Interview Problems](https://github.com/rachitiitr/DataStructures-Algorithms/tree/master/Famous-Coding-Interview-Problems)
+2. [Leetcode Solutions](https://github.com/rachitiitr/DataStructures-Algorithms/tree/master/LeetCode)
+3. [Library](https://github.com/rachitiitr/DataStructures-Algorithms/tree/master/Library)
+4. [My Online Submissions](https://github.com/rachitiitr/DataStructures-Algorithms/tree/master/MyOnlineSubmissions)
+5. [Tricks](https://github.com/rachitiitr/DataStructures-Algorithms/tree/master/Tricks)
+
+## Coding Interview Problems Overview
+One of the most intimidating parts of getting a software enginnering job in industry is the technical interview. Luckily, I have programmed solutions to some of the most common coding interview questions. These solutions include:
+* [Jump Game II](https://leetcode.com/problems/jump-game-ii/description/), which runs in O(n) time. 
+* [The Coin Change Problem](https://leetcode.com/problems/coin-change/description/), which runs in O(n * S) time.
+* The Duplicate XOR Problem I, which runs in O(n) time.
+* The Duplicate XOR Problem II, which runs in O(n) time.
+* The Splitwise Problem, which runs in O(M + N log N) time.
+
+## Leetcode Solutions Overview
+The largest part of this repository are the LeetCode solutions that I have solved and provided the solutions for here. There are 30+ LeetCode solutions in this repository, some of these include:
+* [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/description/), which runs in O(n) time.
+* [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/description/), which runs in O(n) time.
+* [Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/description/), which runs in O(n) time).
+
+## Library Overview
+In this repository I also have a library I created for a vairety of Data Structures' solutions. There are multiple libraries for whatever suits your needs. These library solutions include:
+* [Graph Algorithms](https://github.com/rachitiitr/DataStructures-Algorithms/tree/master/Library/Graph)
+* [Tree Algorithms](https://github.com/rachitiitr/DataStructures-Algorithms/tree/master/Library/Tree)
+* [Math Library](https://github.com/rachitiitr/DataStructures-Algorithms/tree/master/Library/Math)
+
 # My YouTube Channel
 I make Video Lectures on YouTube for 
 1. Data Structures
@@ -7,13 +34,13 @@ I make Video Lectures on YouTube for
 5. Brain Teasers
 6. Logical Reasoning
 
-Youtube Channel ► http://www.youtube.com/c/RachitJain        
-Facebook Page ► http://fb.me/AlgorithmsWithRachitJain      
-Blog ► http://rachitiitr.blogspot.com      
+[Youtube Channel](http://www.youtube.com/c/RachitJain)        
+[Facebook Page](http://fb.me/AlgorithmsWithRachitJain)
+[Blog](http://rachitiitr.blogspot.com)
 
 # My Profile Links      
-CodeForces ► http://www.codeforces.com/profile/rachitjain      
-CodeChef ► http://www.codechef.com/users/rachitiitr         
+[CodeForces](http://www.codeforces.com/profile/rachitjain)      
+[CodeChef](http://www.codechef.com/users/rachitiitr)
 
 # About Me
 I am Rachit Jain, currently working as Software Engineer in Microsoft.