Skip to content

This repo includes the code that I must remember at all times when I encounter a problem

Notifications You must be signed in to change notification settings

RohanGoyal2014/Competetive-Code-Learns

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

99 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Competetive-Code-Learns

This repo includes the code that I must remember at all times when I encounter a problem

  1. Large Array can be declared globally
  2. Copy by reference + Global Declarations reduces running time
  3. Avoid endl, it increases runnning time. https://stackoverflow.com/questions/213907/stdendl-vs-n
  4. Bitsets may be highly useful in reducing complexities
    Example: https://www.hackerearth.com/practice/algorithms/graphs/graph-representation/practice-problems/algorithm/utkarsh-in-gardens-february-easy/description/
  5. Custom Lowerbound Function :https://stackoverflow.com/questions/12968498/compare-function-in-lower-bound
  6. Distinct Elements in range l to r using BIT: https://www.geeksforgeeks.org/queries-number-distinct-elements-subarray/
  7. Important DPs:

About

This repo includes the code that I must remember at all times when I encounter a problem

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages