Giter Club home page Giter Club logo

cp-almanac's Introduction

CP-almanac

About

CP - almanac aims to compile some ready to use algorithms/learnings and will have chapters uncovering some beginners to advanced problems along with a puzzle/riddle for everyone to solve daily. It would get evolved as a single point access to many of the solutions of an everyday programmer’s perplexities!

Guidelines

Participants must follow these guidelines in order to participate in the project:

1. Contribution: Refer CONTRIBUTING.md for contribution guidelines.

2. Communicate: Feel free to ask any questions you may have on our Discord channel (#cp-almanac).

Pre-requisites

  • Basic Git and Git-Hub
  • C/C++

Note

You can't make any pull request after the issue is closed. Any conflicting PR would get rejected and once your PR gets rejected for some issues, you won't be able to raise another PR for the same issue. Only first correct PR for each issue would be considered.

Happy Coding ! 😋

cp-almanac's People

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar

cp-almanac's Issues

Huffman Coding - Greedy

Enter topic name -

Greedy

Enter sub-topic name -

Huffman Coding



Templates for reference - .md


By creating/claiming the issue or by creating PR(pull request) for this issue you agree to the below conditions -

  • I affirm that my document is less than 30% plagiarized.
  • If my document is found to be more than 30% plagiarized, my PR(pull request) can be rejected without any prior information.
  • I give the right to maintainers/admins/collaborators of this repository/project to add/remove my document wherever/whenever is found necessary.

Manacher's Algorithm - Strings

Enter topic name -

Strings

Enter sub-topic name -

Manacher's Algorithm



Templates for reference - .md


By creating/claiming the issue or by creating PR(pull request) for this issue you agree to the below conditions -

  • I affirm that my document is less than 30% plagiarized.
  • If my document is found to be more than 30% plagiarized, my PR(pull request) can be rejected without any prior information.
  • I give the right to maintainers/admins/collaborators of this repository/project to add/remove my document wherever/whenever is found necessary.

Kosaraju’s algorithm - Graph

Enter topic name -

Graph

Enter sub-topic name -

Kosaraju’s algorithm



Templates for reference - .md


By creating/claiming the issue or by creating PR(pull request) for this issue you agree to the below conditions -

  • I affirm that my document is less than 30% plagiarized.
  • If my document is found to be more than 30% plagiarized, my PR(pull request) can be rejected without any prior information.
  • I give the right to maintainers/admins/collaborators of this repository/project to add/remove my document wherever/whenever is found necessary.

Edmonds–Karp algorithm - Flows

Enter topic name -

Flows

Enter sub-topic name -

Edmonds–Karp algorithm



Templates for reference - .md


By creating/claiming the issue or by creating PR(pull request) for this issue you agree to the below conditions -

  • I affirm that my document is less than 30% plagiarized.
  • If my document is found to be more than 30% plagiarized, my PR(pull request) can be rejected without any prior information.
  • I give the right to maintainers/admins/collaborators of this repository/project to add/remove my document wherever/whenever is found necessary.

Tuples - STL

Enter topic name -

STL

Enter sub-topic name

Tuples



Templates for reference - .md


By creating/claiming the issue or by creating PR(pull request) for this issue you agree to the below conditions -

  • I affirm that my document is less than 30% plagiarized.
  • If my document is found to be more than 30% plagiarized, my PR(pull request) can be rejected without any prior information.
  • I give the right to maintainers/admins/collaborators of this repository/project to add/remove my document wherever/whenever is found necessary.

Ordered Set - Policy Based Data Structures

Enter topic name -

Policy Based Data Structures

Enter sub-topic name -

Ordered Set



Templates for reference - .md


By creating/claiming the issue or by creating PR(pull request) for this issue you agree to the below conditions -

  • I affirm that my document is less than 30% plagiarized.
  • If my document is found to be more than 30% plagiarized, my PR(pull request) can be rejected without any prior information.
  • I give the right to maintainers/admins/collaborators of this repository/project to add/remove my document wherever/whenever is found necessary.

Priority Queue - STL

Enter topic name -

Priority Queue

Enter sub-topic name -

STL



Templates for reference - .md


By creating/claiming the issue or by creating PR(pull request) for this issue you agree to the below conditions -

  • I affirm that my document is less than 30% plagiarized.
  • If my document is found to be more than 30% plagiarized, my PR(pull request) can be rejected without any prior information.
  • I give the right to maintainers/admins/collaborators of this repository/project to add/remove my document wherever/whenever is found necessary.

Magic Pair

Find the bug in the solution provided in the folder

Read the question and the solution carefully before claiming.

Adhere to the format of the pull request. Choose form 2 for this issue.




Counting a substring

Find the bug in the solution provided in the folder

Read the question and the solution carefully before claiming.

DFS on 2D Grid - Graphs

Enter topic name -

Graphs

Enter sub-topic name -

DFS on 2D Grid



Templates for reference - .md


By creating/claiming the issue or by creating PR(pull request) for this issue you agree to the below conditions -

  • I affirm that my document is less than 30% plagiarized.
  • If my document is found to be more than 30% plagiarized, my PR(pull request) can be rejected without any prior information.
  • I give the right to maintainers/admins/collaborators of this repository/project to add/remove my document wherever/whenever is found necessary.

Ternary Search - Miscellaneous

Enter topic name -

Searching

Enter sub-topic name -

Ternary Search



Templates for reference - .md


By creating/claiming the issue or by creating PR(pull request) for this issue you agree to the below conditions -

  • I affirm that my document is less than 30% plagiarized.
  • If my document is found to be more than 30% plagiarized, my PR(pull request) can be rejected without any prior information.
  • I give the right to maintainers/admins/collaborators of this repository/project to add/remove my document wherever/whenever is found necessary.

Introduce yourselves in the Contributors Data [Mandatory]

Enter your details in the JSON file Contributors Data/participants.json and edit one of the unused templates in the file. Do not create or delete any entry, only edit the unused ones.

Kindly avoid raising PRs with incomplete details for that will get rejected. You can refer to the JSON file Contributors Data/mentors.json for more clarity. And make sure you first update your forked repo with ours before pushing and raising PR.

This is an open issue. You don't have to claim this!

Clique - Graph

Enter topic name -

Graph

Enter sub-topic name -

Clique



Templates for reference - .md


By creating/claiming the issue or by creating PR(pull request) for this issue you agree to the below conditions -

  • I affirm that my document is less than 30% plagiarized.
  • If my document is found to be more than 30% plagiarized, my PR(pull request) can be rejected without any prior information.
  • I give the right to maintainers/admins/collaborators of this repository/project to add/remove my document wherever/whenever is found necessary.

String Matching using Bitsets - Strings

Enter topic name -

Strings

Enter sub-topic name -

String Matching using Bitsets



Templates for reference - .md


By creating/claiming the issue or by creating PR(pull request) for this issue you agree to the below conditions -

  • I affirm that my document is less than 30% plagiarized.
  • If my document is found to be more than 30% plagiarized, my PR(pull request) can be rejected without any prior information.
  • I give the right to maintainers/admins/collaborators of this repository/project to add/remove my document wherever/whenever is found necessary.

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.