⭐ Request Type

Add in-depth documentation on the sorting algorithm Bubble Sort

• The markdown file is located here.

Lesson Content

The lesson must contain at least these are the topics:

1. Introduction to Sorting
2. Stable and Unstable sorting algorithms
3. Bubble Sort + Why Bubble sort?
4. Complexity Analysis of Bubble sort
   • Time complexity
   • Space complexity
5. Code for Bubble Sort + program explanation

💻 Location

This lesson is present under the
Section: 5
Lesson: C
Location Order: 5C
File-Name: bubblesort.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

• If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

• If your concepts are not that good follow this Bubble sort video of @kunal-kushwaha (https://www.youtube.com/watch?v=F5MZyqRp_IM)

⭐ Request Type

Add in-depth documentation for the lesson Recursion and Strings.
you can start your contribution from this file

Lesson Content

The lesson must contain at least these are the topics:

1. Introduction
2. approach for recursion and strings
3. program example(remove consecutive character duplicates) for strings
4. Tower of Hanoi

💻 Location

location of the file is at:
section: 8
lesson: D
order: 8D
filename: recursion-string.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

⭐ Request Type

Add in-depth documentation for the lesson Recursion and Arrays.
you can start your contribution from this file

Lesson Content

The lesson must contain at least these are the topics:

1. Introduction
2. Approach for Recursion and Arrays
3. Recursion and function helper
4. Recursive selection sort
5. recursive binary search

💻 Location

location of file is at:
section: 8
lesson: C
order: 8C
filename: recursion-arrays.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

⭐ Summary

Please improve the documentation for the lesson space complexity, try to make to better.

If anyone wants to do it, I'll assign him.

💻 Location

section: 7
lesson: C
order: 7C
filename: space-complexity.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

If your concepts are not that good follow this space and time complexity video of @kunal-kushwaha (https://www.youtube.com/watch?v=mV3wrLBbuuE)

⭐ Summary

1. table in the 'increment and decrement operator' topic needs improvement.
2. all the code examples should be converted into java from c++.

💻 Location

Section: 3
Lesson: B
Location Order: 3B
File Name: operator.md

❌ Additional Info

here you can start your contribution

⭐ Request Type

Add brief documentation on the StringBuilder Class in Java.
The markdown file is located here.

Lesson Content

1. Introduction
2. Code examples for StringBuilder
3. code explanation

💻 Location

This lesson is present under the
Section: 6
Lesson: B
Location Order: 6B
File-Name: string-builder.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

If your concepts are not that good follow this StringBuilder video of @kunal-kushwaha (https://www.youtube.com/watch?v=zL1DPZ0Ovlo)

⭐ Request Type

Add proper documentation for the lesson Introduction to Arrays in the file

💻 Location

This lesson is present under the
Section: 4
Lesson: A
File-Name: arrays.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory

Introduction to Arrays must consist of at least the following topic:

1. why arrays + what is an array?
2. syntax + indexing + internal working.
3. basic example for the array(program code).
4. memory allocation
5. input an array + output an array.

⭐ Request Type

Add in-depth documentation on the Strings in Java.
The markdown file is located here.

Lesson Content

The lesson must contain at least these are the topics:

1. Introduction
2. What is String?
3. String Creation: String Literal
4. String Creation: new Keyword
5. How Strings Stored In Memory
6. String Pooling
7. String Immutability In Java
8. String Comparison

💻 Location

This lesson is present under the
Section: 6
Lesson: A
Location Order: 6A
File-Name: intro-string.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

⭐ Request Type

Add some DSA problems in java.

This will help alot of beginners to contribute who study DSA in Java

💻 Location

❌ Additional Info

beginners to contribute who study DSA in Java

⭐ Request Type

Add details documentation/content for the lesson ArrayList In Java.
you can start your contribution from here

💻 Location

This lesson is present under the
Section: 4
Lesson: B
Location Order: 4B
File-Name: arraylist.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory

This lesson must consist of at least the following topic:

1. Introduction
2. Syntax+Internal Working
3. code examples based on arraylist

⭐ Request Type

Add in-depth documentation for binary-search-tree algorithm here.

💻 Location

This lesson is present under the
Section: 16
Lesson: A
Location Order: 16A
File-Name: intro-bst.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory

This lesson must consist of at least the following topic:

introduction to the binary search tree algorithm
code for binary search Tree
examples based on binary search Tree
complexity analysis(in brief)

⭐ Request Type

Add in-depth documentation for binary-search algorithm here

💻 Location

This lesson is present under the
Section: 5
Lesson: B
Location Order: 5B
File-Name: binarysearch.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory

This lesson must consist of at least the following topic:

1. introduction to the binary search algorithm
2. code for binary search
3. examples based on binary search
4. complexity analysis(in brief)

⭐ Summary

Please improve this lesson and give the following explanation:

• Memory in Computer Science
• What is Complexity Analysis
• why complexity analysis
• Complexity analysis of an algorithm
• types of complexities
• example

💻 Location

Location is at

section: 7
lesson: A
order: 7A
filename: intro-complexity.md

❌ Additional Info

You can take the help of other markdown files in the [/lesson] directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

If your concepts are not that good follow this Time Complexity video of @kunal-kushwaha (https://www.youtube.com/watch?v=mV3wrLBbuuE)

⭐ Request Type

Add in-depth documentation on the sorting algorithm Selection Sort.
The markdown file is located here.

Lesson Content

1. Introduction to Selection Sort
2. Complete explanation on Selection sort
3. Complexity of Selection Sort
4. Worst-Case + Best Case + Stability
5. Code for Selection Sort
6. Explanation of Code Example

💻 Location

This lesson is present under the
Section: 5
Lesson: D
Location Order: 5D
File-Name: selectionsort.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

If your concepts are not that good follow this Selection sort video of @kunal-kushwaha (https://www.youtube.com/watch?v=Nd4SCCIHFWk)

⭐ Summary

can I add solutions to leetcode questions in java?

💻 Location

we can add new leetcode folder

❌ Additional Info

No response

⭐ Request Type

Add in-depth documentation for the lesson Radix Sort.
you can start your contribution from this file

Lesson Content

The lesson must contain at least these are the topics:

1. Introduction
2. illustration & implementation of radix sort
3. code for radix sort
4. complexity analysis
5. applications

💻 Location

location of file is at:
section: 5
lesson: G
order: 5G
filename: radixsort.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

⭐ Request Type

Intro To Linked Lists

💻 Location

12 A

❌ Additional Info

No response

⭐ Request Type

Add in-depth documentation on the sorting algorithm Cycle Sort.
you need to create a markdown file for this.

Lesson Content

The lesson must contain at least these are the topics:

1. Introduction to Cycle Sort
2. Complete explanation on Cycle Sort
3. Complexity Analysis of Cycle Sort
4. Worst-Case + Best Case
5. Code for Cycle Sort
6. Explanation of Code Example

💻 Location

This lesson should be present under the
Section: 5
Lesson: F
Location Order: 5E
File-Name: cyclesort.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

If your concepts are not that good follow this Cycle sort video of @kunal-kushwaha (https://www.youtube.com/watch?v=JfinxytTYFQ)

⭐ Request Type

Adding in-depth documentation on the Count Sort Algorithm .

Lesson Content :

1. Introduction to Count Sort
2. Complete explanation on Count sort
3. Complexity of Count Sort
4. Worst-Case + Best Case
5. Code for Count Sort
6. Link for Problems related to it

You can start your contribution from the file: https://github.com/Utkarsh1504/DSA-Java/blob/main/lessons/countsort.md

💻 Location

This lesson should be at:
Section: 5
Lesson: F
Order: 5F
File-name: countsort.md

❌ Additional Info

No response

⭐ Request Type

Add in-depth documentation for the lesson Flow of Recursion.
you can start your contribution from this file

Lesson Content

The lesson must contain at least these are the topics:

1. Visualising Recursion (Recursion Tree)
2. example Fibonacci recursive tree
3. Problem solving using recursion
4. Recursion vs PMI(principle of mathematical induction)
5. Key areas to be focused on Recursion

💻 Location

location of file is at:
section: 8
lesson: B
order: 8B
filename: flow-of-recursion.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

If your concepts are not that good follow this Recursion video of @kunal-kushwaha (https://www.youtube.com/watch?v=M2uO2nMT0Bk)

⭐ Summary

1.More Explanation for Java Setup .
2.Reorganize the md file

💻 Location

Section: Basics
Lesson: 3
Order: 2B
File name: java-setup.md

⭐ Request Type

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.

💻 Location

This lesson is present under the
Section: 5
Lesson: E
Location Order: 5E
File-Name: Move.md

❌ Additional Info

This lesson must consist of at least the following topic:
Approach
Program
Time Complexity

⭐ Request Type

Add in-depth documentation on the sorting algorithm Insertion Sort.
The markdown file is located here.

Lesson Content

The lesson must contain at least these are the topics:

1. Introduction to Insertion Sort
2. Complete explanation on Insertion sort
3. Complexity Analysis of Insertion Sort
4. Worst-Case + Best Case
5. Code for Insertion Sort
6. Explanation of Code Example

💻 Location

This lesson is present under the
Section: 5
Lesson: E
Location Order: 5E
File-Name: insertion.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

If your concepts are not that good follow this Insertion sort video of @kunal-kushwaha (https://www.youtube.com/watch?v=By_5-RRqVeE)

⭐ Summary

Descriptions of &&(AND) and || (OR) might be misleading and less accurate:

- `&&`: AND used to perform logical AND operation. It gives true if both the operands have true value.
- `||`: OR used to perform logical OR operation. It gives true if either of the operands have true value.

For instance, || gives true if the 1st operand has a true value, and it will not try to evaluate the 2nd operand.
It might be helpful to mention & and | first, and then present a comparison between & and &&, as well as | and ||.

💻 Location

See following markdown files:

https://github.com/Utkarsh1504/DSA-Java/blob/main/lessons/operators.md?plain=1#L73

https://github.com/Utkarsh1504/DSA-Java/blob/main/lessons/operators.md?plain=1#L74

❌ Additional Info

No response

⭐ Request Type

Add in-depth documentation for the lesson Quick Sort.
you can start your contribution from this file

Lesson Content

The lesson must contain at least these are the topics:

1. Introduction
2. Understanding the quick sort
3. implementation + illustration
4. code for Quick Sort
5. complexity analysis+stability
6. applications
7. Partition algorithm
8. implementation of partition algorithms
9. 3-way quicksort
10. Quick sort vs Merge Sort

💻 Location

location of file is at:
section: 8
lesson: F
order: 8F
filename: quicksort.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

⭐ Summary

I want to add more practice questions for searching and sorting.

💻 Location

This lesson is present under the
Section: 5
Lesson: E
Location Order: 5E
File-Name: practise-question.md

❌ Additional Info

This lesson must consist of at least the following topic:
Approach
Program
program explanation
Time Complexity

⭐ Summary

The instructions require the local repository to set upstream as well for updated changes, which is currently missing the docs

💻 Location

readme.md

❌ Additional Info

No response

⭐ Request Type

Add in-depth documentation on the Strings in Java.
The markdown file is located here.

Lesson Content

This is the part-2 the issue #25
The lesson further contains at least these are the topics:

9. PrintStream Class
10. Important Strings Methods
11. String Operations
12. Format Specifier
13. String VS String Buffer
14. Some code examples
15. Conclusion

💻 Location

This lesson is present under the
Section: 6
Lesson: A
Location Order: 6A
File-Name: intro-string.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

If your concepts are not that good follow this String and StringBuilder In Java video of @kunal-kushwaha (https://www.youtube.com/watch?v=zL1DPZ0Ovlo)

Other

This will help alot of beginners to contribute who study DSA in cpp

Additional information

No response

⭐ Request Type

Add in-depth documentation for the lesson Introduction to Maths in DSA.
you can start your contribution from this file

Lesson Content

The lesson must contain at least these are the topics:

1. Intro
2. Maths for DSA
3. types of maths used for DSA
   • Discrete mathematics - brief intro
   • Recurrence relations - brief
   • Number theory - brief
   • probability and pnc

💻 Location

location of file is at:
section: 10
lesson: A
order: 10A
filename: intro-maths.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

⭐ Request Type

Add in-depth documentation on the time complexity in Computer science.

Lesson Content

The lesson must contain at least these are the topics:

1. what is time complexity
2. Introduction to Asymptotic Notation(AN) + why AN
3. Type of AN
   • Big Oh Notation
   • Big Omega(Ω) Notation
   • Big Theta(Θ) Notation
   • Little-Oh Notation
   • Little-Omega Notation
4. guidelines for Asymptotic notation
5. properties of asymptotic notation

💻 Location

Location is at

section: 7
lesson: B
order: 7B
filename: time-complexity.md

❌ Additional Info

You can take the help of other markdown files in the [/lesson] directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

If your concepts are not that good follow this Time Complexity video of @kunal-kushwaha (https://www.youtube.com/watch?v=mV3wrLBbuuE)

⭐ Request Type

I want to add another lesson to the following section.

Section: Space and Time Complexity
Name of the new lesson: Time and Space Complexity Tradeoff

💻 Location

section: 7
lesson: E
order: 7E
filename: space-time-tradeoff.md

❌ Additional Info

No response

⭐ Request Type

Add remaining documentation for the lesson Jumps Statements in the file

💻 Location

This lesson is present under the
Section: 3
Lesson: E
Location Order: 3E
File-Name: jumps.md

❌ Additional Info

here you can take the help of other markdown files to have an idea in which format you should write.
This lesson must consist of at least the following topic:

1. break + code examples + explanation
2. continue + code examples + explanation
3. break vs continue
4. break vs continue vs return

⭐ Request Type

Add in-depth documentation on the lesson Recurrence Relation.

Lesson Content

The lesson must contain at least these are the topics:

1. Introduction to Recurrence Relation
2. Type of it.
3. Divide-and-Conquer Recurrence Relation
4. Akra-Bazzi Theorem + used case + examples
5. Linear Recurrence Relation
6. Solving Homogenous Linear Recurrence Relation
7. Question 👍🏻
   • Find nth Fibonacci Number using Golden ratio
   • Solve Recurrence Relation with Repeated Roots
8. Non-Homogeneous Linear Recurrence Relation
9. Solving Non-Homogenous Linear Recurrence Relation
10. How to guess a Particular Solution? + techniques + examples
11. NP-Complete Problems
12. Conclusion

💻 Location

location of file is at:
section: 7
lesson: D
order: 7D
filename: recurrence.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

If your concepts are not that good follow this Space and time complexity video of @kunal-kushwaha (https://www.youtube.com/watch?v=mV3wrLBbuuE)

⭐ Request Type

Add details documentation/content for the lesson Functions/Methods & Scope .
you can start your contribution from here

💻 Location

This lesson is present under the
Section: 3
Lesson: F
Location Order: 3F
File-Name: function.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory

This lesson must consist of at least the following topic:

1. Introduction to Methods/Functions + syntax + program examples
2. function returns + function parameters + program examples
3. how function execution works + pass by value
4. scope + shadowing + overloading
5. conclusion
6. some program examples.

⭐ Request Type

Add the documentation for the lesson Boyer-Moore Majority Voting Algorithm.
Start your contribution from this file
I would like to make a document on the following algorithm.

1. Boyer-Moore Majority Voting Algorithm

💻 Location

This lesson should be at:
Section: 4
Lesson: D
Order: 4D
File-name: bmmv-algorithm

❌ Additional Info

This lesson must consist of at least of the following things:

1. Introduction
2. Working
3. Implementation
4. Code example + explanation
5. Complexity analysis

⭐ Request Type

I want to add information in space-complexity.md
Structure:

• Concept
• Need & Application
• Calculation of space complexity
• Explanation about calculation using examples
• Space complexities of common algorithms

💻 Location

Location is at

section: 7
lesson: C
order: 7C
filename: space-complexity.md

❌ Additional Info

No response

⭐ Summary

1. switch statement needs program explanation

💻 Location

Section: 3
Lesson: C
Location Order: 3C
File Name: io-conditionals.md

❌ Additional Info

here you can start your contribution

⭐ Request Type

This lesson is not yet completed a lot of things are still to be added, please add in-depth documentation for this lesson.
This markdown is located here

💻 Location

This lesson is present under the
Section: 3
Lesson: A
Location Order: 3A
File-Name: dataTypes.md

❌ Additional Info

No response

⭐ Request Type

Add in-depth documentation for the lesson Number theory part-A .
you can start your contribution from this file

Lesson Content

The lesson must contain at least these are the topics:

1. Introduction
2. range of numbers
3. Prime Numbers
4. sieve of Eratosthenes + complexity analysis
5. Square root
6. Newton Raphson method+ complexity analysis
7. Factors + optimized code

💻 Location

location of file is at:
section: 10
lesson: C
order: 10C
filename: num-one.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

Other

The image just above the buttons is broken

Additional information

It would be great if you could please assign this issue to me under hacktoberfest if find relevant

⭐ Request Type

Add in-depth documentation for the lesson Merge Sort.
you can start your contribution from this file

Lesson Content

The lesson must contain at least these are the topics:

1. Introduction
2. Understanding the merge sort
3. implementation + illustration
4. code for merge sort
5. complexity analysis+stability
6. applications

💻 Location

location of the file is at:
section: 8
lesson: E
order: 8E
filename: mergesort.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

⭐ Request Type

Add in-depth documentation for linear search algorithm here

💻 Location

This lesson is present under the
Section: 5
Lesson: A
Location Order: 5A
File-Name: linearsearch.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory

This lesson must consist of at least the following topic:

1. introduction to searching algorithm + linear search
2. code for linear search
3. examples based on linear search
4. complexity analysis(in brief)

Welcome to Hacktoberfest 2023 Discussions! #27

Additional Information

Welcome to Hacktoberfest 2023!

Hacktoberfest is an annual event celebrating open-source contributions. During this event, you have the opportunity to contribute to open-source projects and earn rewards.

• Event Dates: October 1 to October 30, 2023

How to Participate

Participating in Hacktoberfest 2023 is easy:

1. Find Projects: You can search for the Hacktoberfest tag in the GitHub Explore section to discover beginner-friendly open-source projects to contribute to.

2. Contribute: Make contributions to these projects by fixing bugs, adding new features, or improving documentation. Be sure to follow the project's contribution guidelines.

3. Pull Requests: Create pull requests for your contributions and get them reviewed and merged by project maintainers.

4. Track Progress: Track your progress on the Hacktoberfest website. You'll need to make at least four valid pull requests to qualify for Hacktoberfest swag.

Have Questions?

If you have any doubts or questions about Hacktoberfest 2023, don't worry! Feel free to ask your questions in this discussion. Our community members are here to help you throughout the event.

Resources

Here are some helpful resources to get you started:

• Hacktoberfest Website: Official website with event details and registration.
• GitHub Explore: Find open source projects to contribute to.
• GitHub Docs: Learn how to work with Git and GitHub if you're new to version control.

Rules and Guidelines

Please be mindful of the following rules and guidelines for Hacktoberfest 2023:

• Only valid pull requests will count towards your Hacktoberfest participation.
• Spammy or low-quality contributions will not be accepted.
• Be respectful and follow the code of conduct of the projects you contribute to.

Happy hacking and enjoy Hacktoberfest 2023!

⭐ Summary

The Explanatory code is in C++ in operators in java lesson, it should be rectified to a java example.

💻 Location

operators.md

❌ Additional Info

No response

⭐ Request Type

Add notes for the lesson Subarrays.
you can start your contribution from this file

Topic:

1. Introduction
2. some problems on subarrays
3. Two Pointers Algorithm
4. Sliding Window

💻 Location

This file is at:
section: 4
lesson: E
order: 4E
file-name: subarrays.md

❌ Additional Info

No response

⭐ Request Type

Add in-depth documentation for the lesson Bitwise Operator.
you can start your contribution from this file

Lesson Content

The lesson must contain at least these are the topics:

1. Introduction
2. Bit Manipulation
3. some program examples and explanation

💻 Location

location of file is at:
section: 10
lesson: B
order: 10B
filename: bitwise-operator.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

Other

Line No. 88 of README.md
Request to change "git add -a" -> "git add ."

⭐ Request Type

complete the content for the lesson Recursion, explain in best possible ways

Lesson Content

The lesson must contain at least these are the topics:

1. dry run program for recursion
2. Fibonacci number + complete explanation including dry run + visualization

💻 Location

location of file is at:
section: 8
lesson: A
order: 8A
filename: intro-recursion.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/

If your concepts are not that good follow this Recursion video of @kunal-kushwaha (https://www.youtube.com/watch?v=M2uO2nMT0Bk)

⭐ Request Type

Add in-depth documentation for the lesson Number Theory Part-B.
you can start your contribution from this file

Lesson Content

The lesson must contain at least these are the topics:

1. Modulo Properties
2. Die-Hard examples
3. HCF/GCD
4. Euclidean algorithms
5. Euler's totient
6. LCM
7. segmented sieve

💻 Location

location of the file is at:
section: 10
lesson: D
order: 10D
filename: num-two.md

❌ Additional Info

You can take the help of other markdown files in the /lesson directory so that you get the idea of in which fashion you should write.

If you don't know how to do markdown, don't worry it is quite easy, just follow this docs-https://guides.github.com/features/mastering-markdown/