Giter Club home page Giter Club logo

handbook_codes's Introduction

Handbook Codes


Handbook Codes

A C++ codes repository for Competitive Programming Handbook by Antti Laaksonen.
Report Bug ยท Request Code

Table of Contents
  1. About The Project
  2. Usage
  3. Roadmap
  4. Contributing

About The Project

A Competitive Programmers Handbook by Antti Laaksonen is one of the good books which touches each topic for competitive programming. But the problem is that it just touches those topics and it becomes hard for a beginner to grasp those concepts and implement them simultaneously. I guess the book expects the reader to have at least once been introduced to the concepts. This repository comprises of all the possible codes from the same. Link

Usage

Read the book. Unable to understand any part? Come here look at the code.

Roadmap

  • Open issue if you want a particular part of the handbook to be implemented earlier or have any issue in the present codes.
  • Further, more codes will be added as I get time. :)

Contributing

Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.

  1. Fork the Project
  2. Create your Feature Branch (git checkout -b newalgorithm)
  3. Commit your Changes (git commit -m 'Added algorithm/code: "Description" , Part of book: "Description"')
  4. Push to the Branch (git push origin newalgorithm)
  5. Open a Pull Request

handbook_codes's People

Contributors

pulkit1joshi avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar

handbook_codes's Issues

Chapter 21: Number Theory

Can you do chapter 21 codes ? That would help. Here is the list:

  • Check if n is prime
  • Prime factorisation of n
  • Sieve of Eratosthenes
  • Euclid's Theorem
  • Modular Exponentiation

Chapter 18: LCA method 1

First of all, thank you for your work.

https://github.com/pulkit1joshi/handbook_codes/blob/main/Chapter%2018%3A%20Tree%20Queries/treequeries_lca_method1.1.cpp

The code for LCA Method 1 appears to have a time complexity of $O(N)$ rather than $O(logN)$ โ€” for example, if the tree is skewed.

(The book says that method 1 has a time complexity of $O(logN)$.)

Using dynamic programming, it seems like it should be possible to move up two or more steps when reaching the minimum common ancestor vertex.

Thanks.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.