|
| 1 | +# Repository Road Map |
| 2 | +1. In many job interviews you will be asked to solve a series of problems related to coding. The [coding interview](/Famous-Coding-Interview-Problems) folder gives a list of some popular problems and solutions in C++. |
| 3 | + - The goal in [Jump Game 2](/Famous-Coding-Interview-Problems/JumpGame2.cpp) is to find a minimum steps along an array from one index to another. |
| 4 | + - Interviewers may also ask you to demonstrate many concepts of [Object Oriented Programing](https://en.wikipedia.org/wiki/Object-oriented_programming), we can do this in [one program](/Famous-Coding-Interview-Problems/OopsAllConcepts.cpp). |
| 5 | + - The [Coin Change Problem](/Famous-Coding-Interview-Problems/TheCoinChangeProblem.cpp) is often used to demonstrate the applicants understanding of [Dynamic Programming](https://en.wikipedia.org/wiki/Dynamic_programming). In this challenge you are given specified coin values and a final value, you must return the number of combinations you can use to get the final value. |
| 6 | + - In the [first Duplicate Xor Problem](/Famous-Coding-Interview-Problems/TheDuplicateXorArrayProblem-I.cpp) you are given an array of duplicates a and must remove the duplicate of a given value x. |
| 7 | + - In the [second Duplicate Xor Problem](/Famous-Coding-Interview-Problems/TheDuplicateXorArrayProblem-II.cpp) you are given an array of duplicates and must remove the duplicates of two values x and y. |
| 8 | + - The [Recursive Stack Problem](/Famous-Coding-Interview-Problems/TheRecursiveStackProblem.cpp) tests your knowledge of [recursion](https://www.geeksforgeeks.org/introduction-to-recursion-data-structure-and-algorithm-tutorials/). You are given a string of balanced parenthesis (meaning for every "(" there is a ")") and you are asked to find the final "score" where: "A = ()" => 1, "(A)" = 2\*A, and "AB" = A+B. |
| 9 | + - In the [Splitwise Problem](/Famous-Coding-Interview-Problems/TheSplitwiseProblem.cpp) you are given a group of people and each of these people make transactions, you need need to find the minimum number of transactions that will settle all of the debts. |
| 10 | +2.[Leet Code](https://leetcode.com/) is a popular web platform to practice coding and prepare for interviews, the [Leet Code folder](/LeetCode) provides solutions to many problems if you are struggling |
| 11 | + - It is recommended that you try these problems on your own before looking for solutions |
| 12 | +3. The [Library](Library) provides tutorials for various concepts in Data Structures |
| 13 | + - [DP](/DP) provides examples of dynamic programming |
| 14 | + - [DS](/DS) Provides examples of algorithms working on different types of data structures |
| 15 | + - [Graph](/Graph) provides examples of algorithms in [Graph Theory](https://en.wikipedia.org/wiki/Graph_theory) |
| 16 | + - [Math](/Math) provides examples of generic mathematical algorithms |
| 17 | + - [Miscellanious](/Miscellanious) provides useful generic algorithms |
| 18 | + - [Tree](/Tree) provides examples of algorithms that work with [tree data structures](https://en.wikipedia.org/wiki/Tree_(data_structure)) |
| 19 | + - [Galt](/Galt) contains algorithms for sparse tables |
| 20 | +4. [Tricks](/Tricks) contains quick solutions to problems that help you move a lot faster |
| 21 | + |
1 | 22 | # My YouTube Channel
|
2 | 23 | I make Video Lectures on YouTube for
|
3 | 24 | 1. Data Structures
|
4 |
| -2. Algorithms |
5 |
| -3. Interview Tips for Software Engineering Jobs |
6 |
| -4. Math Puzzles |
7 |
| -5. Brain Teasers |
8 |
| -6. Logical Reasoning |
9 |
| - |
10 |
| -Youtube Channel ► http://www.youtube.com/c/RachitJain |
11 |
| -Facebook Page ► http://fb.me/AlgorithmsWithRachitJain |
12 |
| -Blog ► http://rachitiitr.blogspot.com |
13 |
| - |
14 |
| -# My Profile Links |
15 |
| -CodeForces ► http://www.codeforces.com/profile/rachitjain |
16 |
| -CodeChef ► http://www.codechef.com/users/rachitiitr |
17 |
| - |
18 |
| -# About Me |
19 |
| -I am Rachit Jain, currently working as Software Engineer in Microsoft. |
20 |
| -I have graduated from IIT Roorkee in 2017. |
21 |
| -I have done my majors in Electrical Engineering, |
22 |
| -and minors in Computer Science Engineering. |
23 |
| -Competitive Programming is my hobby, as I like to keep my mind sharp. |
24 |
| -I love to explore and learn new algorithms and programming techniques. |
25 |
| -I like teaching, and hence launched my YouTube channel recently. |
26 |
| - |
27 |
| -# Achievements |
28 |
| -1. JEE Mains All India Rank: #69 among 1.4 million candidates |
29 |
| -2. IITian |
30 |
| -3. Despite majors in Electrical Engineering: |
31 |
| - a. Cracked job interviews for Microsoft, Directi. |
32 |
| - b. Google APAC Global Rank: #25 (Round D, 2017) |
33 |
| - c. Codeforces Rating: 2018 (DIV 1) |
34 |
| - d. Did internships in Flipkart(III Year) and Grofers(II Year). |
35 |
| - e. Launched YouTube Channel for DS, Algos for teaching. |
0 commit comments