All Concepts about DSA and Competitive Coding

  Contains Detailed Overview Solutions in their respective folders
  Conceptual Usage of Algorithms and their applications view 

Checking

 Array and integers
 while arthemetic operators check abt constraints
 if numbers check +ve, -ve, 0 and size_limit
 for solving problems check the case of 
 Integers values limit, duplicates(check need to avoid or include case)
   
 Strings
 check about the what kind of chars it involved and size, any leading or trailing spaces
 

Approach

If you have devised a method, first observe the base case (or smaller test cases) and check if it works.
Let's take a small example:

Factorial

• Made the algorithm? ➡️ Go to base case.
• Check if it works for the base case (like n=1 or n=0 in this case)
• Fails? ➡️ Try again! Not giving up is the key!
• Pass? ➡️ Try bigger examples or perhaps submit the code on the platform that you might be using for practice (like GFG or Leetcode)

Keypoints

Use memset for filling 0 or 1 in an array, and it won't work for any other values
  	you can use fill(begin(a), end(a), any value)