C++ DSA cheatsheet

[CuriousRadhika]

What does this PR do?

Add new CheatSheet

Description

C++ Data Structures and Algorithms Cheat Sheet

Checklist:

• Read our contributing guidelines.
• Search for duplicates.
• Used an informative name for this pull request.

Follow-up

• Check the status of GitHub Actions and resolve any reported warnings!

[github-actions]

It's great having you contribute to this project

Welcome to the community 🤓

Thanks for joining our community - we help and encourage each other to contribute to open source little and often 🤓 . Any questions let us know.

[CuriousRadhika]

please merge the pr

[crescentpartha]

Looks to me good!

Some modifications needed based on requirements:

1. Rename your file form C++ DSA cheatsheet.md to cpp-dsa-cheatsheet.md or dsa-cheatsheet.md
2. Remove STL Library from this file and modify cpp-stl-cheatsheet.md by adding time/space complexity, operation-wise complexity, list of operations, use for and not use for in different DSA etc.
3. Link cpp-stl-cheatsheet.md inside this file.
4. Maintain the tabular format.

[crescentpartha]

Those images are not showing.

[crescentpartha]

We have a cpp-stl-cheatsheet.md sheet. You could check it.

I think it will be better if you add time/space complexity and operation-wise complexity in a tabular format in cpp-stl-cheatsheet.md sheet and just mention that sheet in cpp-dsa-cheatsheet.md.

We could rather use this sheet as a CPP DSA cheatsheet for the most commonly used DSA.

[crescentpartha]

Suggested change

	```c++
	std::stack<int> s;
	//---------------------------------
	// Container-Specific Operations
	//---------------------------------
	// Push
	s.push(20);
	// Size
	unsigned int size = s.size();
	// Pop
	s.pop();
	// Top
	int top = s.top();
	```

Command	Description
stack<int> s;	Stack Initialization
s.push(20);	Push a element on the top
s.pop();	Pop a element from the top
s.top();	Find the top element
s.size();	Find the size of a stack

I think this tabular format is better to understand what type of operations are exists in Stack. After that, you can give an example like these codes.

// Initialization
std::stack<int> s;

// Push
s.push(20);

// Size
unsigned int size = s.size();

// Pop
s.pop();

// Top
int top = s.top();