Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Updated README.md with a Table of Contents and Directory Elaboration #66

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
37 changes: 32 additions & 5 deletions README.md
Original file line number Diff line number Diff line change
@@ -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
Expand All @@ -7,13 +34,13 @@ I make Video Lectures on YouTube for
5. Brain Teasers
6. Logical Reasoning

Youtube Channelhttp://www.youtube.com/c/RachitJain
Facebook Pagehttp://fb.me/AlgorithmsWithRachitJain
Bloghttp://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
CodeForceshttp://www.codeforces.com/profile/rachitjain
CodeChefhttp://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.
Expand Down