site updated

Utkarsh Mishra · Utkarsh Mishra · commit 0a9be2ffe26a · 2021-10-01T15:05:04.000+05:30
diff --git a/README.md b/README.md
@@ -84,7 +84,7 @@ Run the following command to install the required dependencies.
 
 6. Stage your changes and commit
 
-```css
+```yml
 git add -a
 
 git commit -m "<your_commit_message>"
diff --git a/lessons/assignment.md b/lessons/assignment.md
@@ -1,8 +1,19 @@
 ---
 path: "/assignment"
 title: "Assignments"
-order: "22A"
+order: "24A"
 section: "Assignments & Practise Question"
 description: "practise some standard question"
 icon: "question"
 ---
+
+This section will consist some leetcode questions and some practise questions.
+All the solutions will be in [LeetCode](https://github.com/utkarsh1504/leetcode-solutions) repository.
+
+## Leetcode Question
+
+The following is a list of leetcode questions.
+
+### Arrays -
+
+- [1. Two Sum](https://leetcode.com/problems/two-sum/)
diff --git a/lessons/backtrack-maze.md b/lessons/backtrack-maze.md
@@ -0,0 +1,7 @@
+---
+path: "/backtrack-maze"
+title: "Maze Problems"
+order: "9E"
+section: "BackTracking In Java"
+description: "learn about backtracking algorithms"
+---
diff --git a/lessons/backtrack-nknight.md b/lessons/backtrack-nknight.md
@@ -0,0 +1,7 @@
+---
+path: "/backtrack-nknight"
+title: "N Knights"
+order: "9D"
+section: "BackTracking In Java"
+description: "learn about backtracking algorithms"
+---
diff --git a/lessons/backtrack-sudoku.md b/lessons/backtrack-sudoku.md
@@ -0,0 +1,7 @@
+---
+path: "/backtrack-sudoku"
+title: "Sudoku Solver"
+order: "9B"
+section: "BackTracking In Java"
+description: "learn about backtracking algorithms"
+---
diff --git a/lessons/backtracking.md b/lessons/backtracking.md
@@ -1,7 +1,7 @@
 ---
 path: "/backtracking"
-title: "Intro"
-order: "11A"
+title: "Introduction to Backtracking"
+order: "9A"
 section: "BackTracking In Java"
 description: "learn about backtracking algorithms"
 icon: "sitemap"
diff --git a/lessons/bitwise-operator.md b/lessons/bitwise-operator.md
@@ -0,0 +1,7 @@
+---
+path: "/bitwise-operator"
+title: "Complete Bitwise Operators"
+order: "10B"
+section: "Maths for DSA"
+description: "learn maths required in DSA"
+---
diff --git a/lessons/bracktrack-nqueen.md b/lessons/bracktrack-nqueen.md
@@ -0,0 +1,7 @@
+---
+path: "/backtrack-nqueen"
+title: "N Queens"
+order: "9C"
+section: "BackTracking In Java"
+description: "learn about backtracking algorithms"
+---
diff --git a/lessons/flow-of-recursion.md b/lessons/flow-of-recursion.md
@@ -1,6 +1,6 @@
 ---
-path: "/recursive-sorts"
-title: "Recursive Sorts"
+path: "/flow-of-recursion"
+title: "Flow of Recursion"
 order: "8B"
 section: "Recursion"
 description: "learn Recursion from scratch"
diff --git a/lessons/greedy.md b/lessons/greedy.md
@@ -0,0 +1,7 @@
+---
+path: "/greedy"
+title: "Introduction to Greedy Algorithms"
+order: "20A"
+section: "Greedy Algorithms"
+description: "complete greedy algorithm"
+---
diff --git a/lessons/intro-complexity.md b/lessons/intro-complexity.md
@@ -1,7 +1,7 @@
 ---
 path: "/intro-complexity"
 title: "Intro to Complexity Analysis"
-order: "9A"
+order: "7A"
 section: "Space & Time Complexity"
 description: "learn about time and space complexity for various algorithms"
 icon: "flask"
diff --git a/lessons/intro-dp.md b/lessons/intro-dp.md
@@ -1,7 +1,7 @@
 ---
 path: "/intro-dp"
 title: "Introduction to DP"
-order: "18A"
+order: "19A"
 section: "Dynamic Programming"
 description: "learn about Dynamic Programming"
 icon: "sitemap"
diff --git a/lessons/intro-graph.md b/lessons/intro-graph.md
@@ -1,7 +1,7 @@
 ---
 path: "/intro-graphs"
 title: "Introduction to Graphs"
-order: "20A"
+order: "22A"
 section: "Graphs"
 description: "learn about graph data-structure from scratch"
 icon: "map-signs"
diff --git a/lessons/intro-hashmap.md b/lessons/intro-hashmap.md
@@ -1,7 +1,7 @@
 ---
 path: "/intro-hashmap"
 title: "Introduction to Hashmap"
-order: "17A"
+order: "18A"
 section: "Hashmap"
 description: "learn about hashmap from scratch"
 icon: "book"
diff --git a/lessons/intro-heap.md b/lessons/intro-heap.md
@@ -0,0 +1,8 @@
+---
+path: "/intro-heap"
+title: "Introduction to Heaps"
+order: "17A"
+section: "Heaps"
+description: "complete introduction to heaps"
+icon: "object-ungroup"
+---
diff --git a/lessons/intro-maths.md b/lessons/intro-maths.md
@@ -1,7 +1,7 @@
 ---
 path: "/intro-maths"
 title: "Intro to Maths in DSA"
-order: "7A"
+order: "10A"
 section: "Maths for DSA"
 description: "learn maths required in DSA"
 icon: "plus"
diff --git a/lessons/intro-oop.md b/lessons/intro-oop.md
@@ -1,7 +1,7 @@
 ---
 path: "/intro-oop"
-title: "Intro to OOP"
-order: "10A"
+title: "Introduction to OOP"
+order: "11A"
 section: "Object Oriented Programming"
 description: "complete introduction to object oriented programming"
 icon: "object-ungroup"
diff --git a/lessons/intro-priorityqueues.md b/lessons/intro-priorityqueues.md
@@ -1,7 +1,7 @@
 ---
 path: "/intro-priorityqueues"
 title: "Introduction to Priority Queues"
-order: "19A"
+order: "21A"
 section: "Priority Queues"
 description: "learn about Priority Queues from scratch"
 icon: "braille"
diff --git a/lessons/intro-tries.md b/lessons/intro-tries.md
@@ -1,7 +1,7 @@
 ---
 path: "/intro-tries"
 title: "Introduction to Tries"
-order: "21A"
+order: "23A"
 section: "Tries"
 description: "learn about tries from scratch"
 icon: "share-alt"
diff --git a/lessons/introduction.md b/lessons/introduction.md
@@ -42,7 +42,7 @@ This course requires some of the prerequisite knowledge of the following:
 
 ## Special Thanks
 
-![kunalOP](/images/kunalOP.jpg)
+![kunalOP](./images/kunalOP.jpg)
 
 A big shout out to [Kunal](https://twitter.com/kunalstwt) for his [DSA-Bootcamp-Java](https://www.youtube.com/playlist?list=PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ) course. On his Youtube channel, he is teaching this quality-loaded course completely for free. He is currently a developer advocate at [Civo](http://civo.com/), a program manager at DoK Community, an MLH Coach and he is doing a lot, literally a lot of things for the community. I would like to thank him for his hard work and dedication. I personally follow his DSA-Bootcamp-Java course and I am really happy with his teaching style.
 
diff --git a/lessons/mergesort.md b/lessons/mergesort.md
@@ -0,0 +1,7 @@
+---
+path: "/mergesort"
+title: "Merge Sort"
+order: "8E"
+section: "Recursion"
+description: "learn Recursion from scratch"
+---
diff --git a/lessons/num-one.md b/lessons/num-one.md
@@ -0,0 +1,7 @@
+---
+path: "/num-one"
+title: "Number Theory Part-A"
+order: "10C"
+section: "Maths for DSA"
+description: "learn maths required in DSA"
+---
diff --git a/lessons/num-three.md b/lessons/num-three.md
@@ -0,0 +1,7 @@
+---
+path: "/num-three"
+title: "Number Theory Part-C"
+order: "10E"
+section: "Maths for DSA"
+description: "learn maths required in DSA"
+---
diff --git a/lessons/num-two.md b/lessons/num-two.md
@@ -0,0 +1,7 @@
+---
+path: "/num-two"
+title: "Number Theory Part-B"
+order: "10D"
+section: "Maths for DSA"
+description: "learn maths required in DSA"
+---
diff --git a/lessons/practise-question.md b/lessons/practise-question.md
@@ -1,22 +1,28 @@
 ---
-path: "/practise-questions"
+path: "/practise-question"
 title: "Practise Questions"
 order: "5F"
 section: "Searching & Sorting"
 description: "learn Searching & sorting algorithms"
 ---
+
 **Q1) Move All Zeros to End of an Array**<br>
 You have been given a random integer array of size N. You have been required to push all the zeros that are present in the array to the end of it such that the relative order of the non-zero elements should be maintained.
+
 ```java
 Sample Input/Output
 ​Input:  arr[]={3,0,1,5,0,5}
 Output: arr[]={3,1,5,5,0,0}
 ```
- ## Approach
- Before we discuss the approach for this question let’s see what exactly the question requires us to do. It seems that we have to push all the 0s in the array towards the end of the array. It can also be looked at as pushing all the non-zero elements in the array towards the beginning of the array.<br>
+
+## Approach
+
+Before we discuss the approach for this question let’s see what exactly the question requires us to do. It seems that we have to push all the 0s in the array towards the end of the array. It can also be looked at as pushing all the non-zero elements in the array towards the beginning of the array.<br>
 First, traverse the whole array and initialize a variable count whose value should be equal to zero. Now, check each element of the array whether it is equal to zero or not. If the element is not equal to zero,put that element at the count position of the array(arr[count]) and increment the value of count by one.<br>
 Now, after traversing the whole array fill the remaining positions of the array with zeroes.
+
 ## Program
+
 ```java
 package main;
 import java.util.*;
@@ -43,11 +49,14 @@ public class Main {
 		}}
 }
 ```
+
 ```java
 Output
 3542200
 ```
+
 ## Explanation
+
 - Initialize a variable count with a value equal to zero.<br>
 - Make a function named pushZeroToEnd and input an array.<br>
 - Traverse through the array and check each element whether it is equal to zero or not.<br>
@@ -56,7 +65,8 @@ Output
 - At last, fill the remaining positions of the array with 0.<br>
 
 ## Time Complexity
-Since we will be traversing the whole array twice therefore the time complexity of algorithm would be: 
-- **Time complexity of first loop O(N) + Time complexity of second loop O(N) = O(N)**,
-where n is number of elements in input array.
 
+Since we will be traversing the whole array twice therefore the time complexity of algorithm would be:
+
+- **Time complexity of first loop O(N) + Time complexity of second loop O(N) = O(N)**,
+  where n is number of elements in input array.
diff --git a/lessons/print-patterns.md b/lessons/print-patterns.md
@@ -1,6 +1,6 @@
 ---
-path: "/question"
-title: "Practise Question"
+path: "/print-patterns"
+title: "Printing Patterns"
 order: "4C"
 section: "Arrays"
 description: "learn Arrays"
diff --git a/lessons/quicksort.md b/lessons/quicksort.md
@@ -0,0 +1,7 @@
+---
+path: "/quicksort"
+title: "Quick Sort"
+order: "8F"
+section: "Recursion"
+description: "learn Recursion from scratch"
+---
diff --git a/lessons/recursion-arrays.md b/lessons/recursion-arrays.md
@@ -0,0 +1,7 @@
+---
+path: "/recursion-arrays"
+title: "Recursion & Array"
+order: "8C"
+section: "Recursion"
+description: "learn Recursion from scratch"
+---
diff --git a/lessons/recursion-practise.md b/lessons/recursion-practise.md
@@ -0,0 +1,7 @@
+---
+path: "/recursion-practise"
+title: "Standard Practise Questions"
+order: "8G"
+section: "Recursion"
+description: "learn Recursion from scratch"
+---
diff --git a/lessons/recursion-string.md b/lessons/recursion-string.md
@@ -0,0 +1,7 @@
+---
+path: "/recursion-string"
+title: "Recursion & Strings"
+order: "8D"
+section: "Recursion"
+description: "learn Recursion from scratch"
+---
