visheshrwl / dsa-notes Goto Github PK

Welcome to your one-stop-shop for Data Structures and Algorithms (DSA) practice. It's all about honing your skills and having a blast while doing it!

C++ 28.11% C 11.53% Python 17.89% CSS 8.06% HTML 17.45% JavaScript 3.20% EJS 13.76%

algorithms algorithms-and-data-structures data-structures hacktoberfest hacktoberfest2023 linked-list

dsa-notes's Introduction

Hi👋,I'm Vishesh Rawal

A Coder And A Web developer🤖

💫 About Me:

🔭 I'm currently working on DSA.
👯 I'm looking to collaborate on Backend Development.
🤝 I'm looking for help with Cloud.
🌱 I'm currently learning GO.
💬 Ask me about Web-Dev.
⚡Fun fact "The first computer bug was an actual bug."

🌐 Socials:

💻 Tech Stack:

WhoAmI

class WhoAmI:
	user = 'Vishesh Rawal'
   	current_work = 'Writing code'
   	hobbies = [
   			'Coding',
   			'Watching Sci-Fi Movies and Series',
   			'Reading Novels'
   			'Being up all Night chasing that ONE BUG...'
   		]
   
   def getCity():
   	return Udaipur_India()
   
   def Ambitions():
   	LearnFrench()
   	CreateOS()
   	Finish()
   	# Assume 1000 more awesome ambitions here  ;)

📊 GitHub Analytics

✍️ Random Dev Quote

dsa-notes's People

Contributors

Stargazers

Watchers

dsa-notes's Issues

[Feature] Add Notes on Binary Search Trees

** Hacktoberfest Label: Yes**

Description:
BSTs are fundamental data structures in computer science and are widely used. High-quality notes on this topic will greatly benefit the community.

Scope: This feature request involves adding detailed notes about Binary Search Trees.

Suggested Implementation:

Create a new directory named "Binary Search Trees."
Inside the directory, add well-structured notes in Markdown format.
Include explanations, visual representations, and code examples.
Ensure clarity and simplicity in explanations.
Create a README.md in the directory that provides an overview and links to individual notes.

Contribution Guidelines:

Please follow the repository's contribution guidelines, including coding style, licensing, and formatting instructions.
Ensure that your contributions are your original work or properly attributed to their sources.

Expected Outcome:

The repository should contain high-quality notes on Binary Search Trees by the end of Hacktoberfest, making it an excellent resource for learners and developers.

Additional Information:
Please reach out if you have any questions or need guidance while contributing to this issue.

Hacktoberfest: This issue is tagged for Hacktoberfest.

[Feature] Add Notes on Depth-First Search (DFS)

Hacktoberfest Label: Yes

Description

DFS is a crucial graph traversal algorithm, and high-quality notes would benefit both beginners and experienced programmers.

Scope:

This feature request involves adding comprehensive notes about Depth-First Search (DFS).

Suggested Implementation:

Create a new directory named "Depth-First Search (DFS)."
Inside the directory, add detailed notes in Markdown format.
Include explanations, examples, and pseudocode.
Ensure clarity and thorough coverage of DFS.

Contribution Guidelines:

Please adhere to the repository's contribution guidelines, including coding style, licensing, and formatting instructions.
Ensure your contributions are original or properly attributed to sources.

Expected Outcome:

By the end of Hacktoberfest, the repository should have valuable notes on Depth-First Search (DFS).

Additional Information:

Feel free to contact us if you have questions or need assistance while contributing.

Hacktoberfest: This issue is tagged for Hacktoberfest.