DSA 1.2.3.1 Algorithms : Space Complexity #2233

[lvi131]

---

Description 📜

Added information about space complexity of algorithms and some examples with explanation.
Fixes #2233

---

Type of change 📝

• Documentation (Content Creation in the form of codes or tutorials)

---

Domain of Contribution 📊

• DSA

---

Checklist ✅

• I follow Contributing Guidelines & Code of conduct of this project.
• I have performed a self-review of my own code or work.
• I have commented my code, particularly in hard-to-understand areas.
• My changes generates no new warnings.
• I'm GWOC'21 contributor

---

Screenshots / Gif (Optional) 📸

---

[lvi131]

@goelesha
Please review my PR.

[jaigora24]

/assign

[github-actions]

This issue has been assigned to @jaigora24!
It will become unassigned if it isn't closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.

[goelesha]

Rename the name of the file to that mentioned in the issue.
Also, add the links from where you have taken references for writing this content.

[goelesha]

/assign

@jaigora24 Kindly share what kind of contribution will you be making?

[lvi131]

Rename the name of the file to that mentioned in the issue.
Also, add the links from where you have taken references for writing this content.

Currently the naming is DSA/1.2 Analysis of Algorithms/3. Space_Complexity/1.2.3.1_Space_Complexity.md
What should i rename it to ?

I have used notes and stuff, haven't used any direct references.

[jaigora24]

@goelesha I have already created a PR for review

#2742

[goelesha]

Rename the name of the file to that mentioned in the issue.
Also, add the links from where you have taken references for writing this content.

Currently the naming is DSA/1.2 Analysis of Algorithms/3. Space_Complexity/1.2.3.1_Space_Complexity.md
What should i rename it to ?

I have used notes and stuff, haven't used any direct references.

If you have not used any references then i guess its good to go !!
Happy Contributing 👍

[lvi131]

@goelesha Thank You!