Skip to content

Commit 0a9be2f

Browse files
Utkarsh MishraUtkarsh Mishra
Utkarsh Mishra
authored and
Utkarsh Mishra
committed
site updated
1 parent a78c7d8 commit 0a9be2f

30 files changed

+151
-24
lines changed

‎README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -84,7 +84,7 @@ Run the following command to install the required dependencies.
8484

8585
6. Stage your changes and commit
8686

87-
```css
87+
```yml
8888
git add -a
8989

9090
git commit -m "<your_commit_message>"

‎lessons/assignment.md

Lines changed: 12 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,19 @@
11
---
22
path: "/assignment"
33
title: "Assignments"
4-
order: "22A"
4+
order: "24A"
55
section: "Assignments & Practise Question"
66
description: "practise some standard question"
77
icon: "question"
88
---
9+
10+
This section will consist some leetcode questions and some practise questions.
11+
All the solutions will be in [LeetCode](https://github.com/utkarsh1504/leetcode-solutions) repository.
12+
13+
## Leetcode Question
14+
15+
The following is a list of leetcode questions.
16+
17+
### Arrays -
18+
19+
- [1. Two Sum](https://leetcode.com/problems/two-sum/)

‎lessons/backtrack-maze.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/backtrack-maze"
3+
title: "Maze Problems"
4+
order: "9E"
5+
section: "BackTracking In Java"
6+
description: "learn about backtracking algorithms"
7+
---

‎lessons/backtrack-nknight.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/backtrack-nknight"
3+
title: "N Knights"
4+
order: "9D"
5+
section: "BackTracking In Java"
6+
description: "learn about backtracking algorithms"
7+
---

‎lessons/backtrack-sudoku.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/backtrack-sudoku"
3+
title: "Sudoku Solver"
4+
order: "9B"
5+
section: "BackTracking In Java"
6+
description: "learn about backtracking algorithms"
7+
---

‎lessons/backtracking.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
---
22
path: "/backtracking"
3-
title: "Intro"
4-
order: "11A"
3+
title: "Introduction to Backtracking"
4+
order: "9A"
55
section: "BackTracking In Java"
66
description: "learn about backtracking algorithms"
77
icon: "sitemap"

‎lessons/bitwise-operator.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/bitwise-operator"
3+
title: "Complete Bitwise Operators"
4+
order: "10B"
5+
section: "Maths for DSA"
6+
description: "learn maths required in DSA"
7+
---

‎lessons/bracktrack-nqueen.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/backtrack-nqueen"
3+
title: "N Queens"
4+
order: "9C"
5+
section: "BackTracking In Java"
6+
description: "learn about backtracking algorithms"
7+
---

‎lessons/recursive-sorts.md renamed to ‎lessons/flow-of-recursion.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
---
2-
path: "/recursive-sorts"
3-
title: "Recursive Sorts"
2+
path: "/flow-of-recursion"
3+
title: "Flow of Recursion"
44
order: "8B"
55
section: "Recursion"
66
description: "learn Recursion from scratch"

‎lessons/greedy.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/greedy"
3+
title: "Introduction to Greedy Algorithms"
4+
order: "20A"
5+
section: "Greedy Algorithms"
6+
description: "complete greedy algorithm"
7+
---

‎lessons/intro-complexity.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
---
22
path: "/intro-complexity"
33
title: "Intro to Complexity Analysis"
4-
order: "9A"
4+
order: "7A"
55
section: "Space & Time Complexity"
66
description: "learn about time and space complexity for various algorithms"
77
icon: "flask"

‎lessons/intro-dp.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
---
22
path: "/intro-dp"
33
title: "Introduction to DP"
4-
order: "18A"
4+
order: "19A"
55
section: "Dynamic Programming"
66
description: "learn about Dynamic Programming"
77
icon: "sitemap"

‎lessons/intro-graph.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
---
22
path: "/intro-graphs"
33
title: "Introduction to Graphs"
4-
order: "20A"
4+
order: "22A"
55
section: "Graphs"
66
description: "learn about graph data-structure from scratch"
77
icon: "map-signs"

‎lessons/intro-hashmap.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
---
22
path: "/intro-hashmap"
33
title: "Introduction to Hashmap"
4-
order: "17A"
4+
order: "18A"
55
section: "Hashmap"
66
description: "learn about hashmap from scratch"
77
icon: "book"

‎lessons/intro-heap.md

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
---
2+
path: "/intro-heap"
3+
title: "Introduction to Heaps"
4+
order: "17A"
5+
section: "Heaps"
6+
description: "complete introduction to heaps"
7+
icon: "object-ungroup"
8+
---

‎lessons/intro-maths.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
---
22
path: "/intro-maths"
33
title: "Intro to Maths in DSA"
4-
order: "7A"
4+
order: "10A"
55
section: "Maths for DSA"
66
description: "learn maths required in DSA"
77
icon: "plus"

‎lessons/intro-oop.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
---
22
path: "/intro-oop"
3-
title: "Intro to OOP"
4-
order: "10A"
3+
title: "Introduction to OOP"
4+
order: "11A"
55
section: "Object Oriented Programming"
66
description: "complete introduction to object oriented programming"
77
icon: "object-ungroup"

‎lessons/intro-priorityqueues.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
---
22
path: "/intro-priorityqueues"
33
title: "Introduction to Priority Queues"
4-
order: "19A"
4+
order: "21A"
55
section: "Priority Queues"
66
description: "learn about Priority Queues from scratch"
77
icon: "braille"

‎lessons/intro-tries.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
---
22
path: "/intro-tries"
33
title: "Introduction to Tries"
4-
order: "21A"
4+
order: "23A"
55
section: "Tries"
66
description: "learn about tries from scratch"
77
icon: "share-alt"

‎lessons/introduction.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -42,7 +42,7 @@ This course requires some of the prerequisite knowledge of the following:
4242

4343
## Special Thanks
4444

45-
![kunalOP](/images/kunalOP.jpg)
45+
![kunalOP](./images/kunalOP.jpg)
4646

4747
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.
4848

‎lessons/mergesort.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/mergesort"
3+
title: "Merge Sort"
4+
order: "8E"
5+
section: "Recursion"
6+
description: "learn Recursion from scratch"
7+
---

‎lessons/num-one.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/num-one"
3+
title: "Number Theory Part-A"
4+
order: "10C"
5+
section: "Maths for DSA"
6+
description: "learn maths required in DSA"
7+
---

‎lessons/num-three.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/num-three"
3+
title: "Number Theory Part-C"
4+
order: "10E"
5+
section: "Maths for DSA"
6+
description: "learn maths required in DSA"
7+
---

‎lessons/num-two.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/num-two"
3+
title: "Number Theory Part-B"
4+
order: "10D"
5+
section: "Maths for DSA"
6+
description: "learn maths required in DSA"
7+
---

‎lessons/practise-question.md

Lines changed: 16 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,22 +1,28 @@
11
---
2-
path: "/practise-questions"
2+
path: "/practise-question"
33
title: "Practise Questions"
44
order: "5F"
55
section: "Searching & Sorting"
66
description: "learn Searching & sorting algorithms"
77
---
8+
89
**Q1) Move All Zeros to End of an Array**<br>
910
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.
11+
1012
```java
1113
Sample Input/Output
1214
​Input: arr[]={3,0,1,5,0,5}
1315
Output: arr[]={3,1,5,5,0,0}
1416
```
15-
## Approach
16-
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>
17+
18+
## Approach
19+
20+
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>
1721
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>
1822
Now, after traversing the whole array fill the remaining positions of the array with zeroes.
23+
1924
## Program
25+
2026
```java
2127
package main;
2228
import java.util.*;
@@ -43,11 +49,14 @@ public class Main {
4349
}}
4450
}
4551
```
52+
4653
```java
4754
Output
4855
3542200
4956
```
57+
5058
## Explanation
59+
5160
- Initialize a variable count with a value equal to zero.<br>
5261
- Make a function named pushZeroToEnd and input an array.<br>
5362
- Traverse through the array and check each element whether it is equal to zero or not.<br>
@@ -56,7 +65,8 @@ Output
5665
- At last, fill the remaining positions of the array with 0.<br>
5766

5867
## Time Complexity
59-
Since we will be traversing the whole array twice therefore the time complexity of algorithm would be:
60-
- **Time complexity of first loop O(N) + Time complexity of second loop O(N) = O(N)**,
61-
where n is number of elements in input array.
6268

69+
Since we will be traversing the whole array twice therefore the time complexity of algorithm would be:
70+
71+
- **Time complexity of first loop O(N) + Time complexity of second loop O(N) = O(N)**,
72+
where n is number of elements in input array.

‎lessons/question.md renamed to ‎lessons/print-patterns.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
---
2-
path: "/question"
3-
title: "Practise Question"
2+
path: "/print-patterns"
3+
title: "Printing Patterns"
44
order: "4C"
55
section: "Arrays"
66
description: "learn Arrays"

‎lessons/quicksort.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/quicksort"
3+
title: "Quick Sort"
4+
order: "8F"
5+
section: "Recursion"
6+
description: "learn Recursion from scratch"
7+
---

‎lessons/recursion-arrays.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/recursion-arrays"
3+
title: "Recursion & Array"
4+
order: "8C"
5+
section: "Recursion"
6+
description: "learn Recursion from scratch"
7+
---

‎lessons/recursion-practise.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/recursion-practise"
3+
title: "Standard Practise Questions"
4+
order: "8G"
5+
section: "Recursion"
6+
description: "learn Recursion from scratch"
7+
---

‎lessons/recursion-string.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
path: "/recursion-string"
3+
title: "Recursion & Strings"
4+
order: "8D"
5+
section: "Recursion"
6+
description: "learn Recursion from scratch"
7+
---

0 commit comments

Comments
 (0)