Giter VIP home page Giter VIP logo

gfg-practice-questions's Introduction

GeeksforGeeks Practice

Description

This repository contains a collection of GeeksforGeeks questions that I have practiced so far. GeeksforGeeks is a popular online platform that provides a wide range of coding problems, algorithms, and data structures to enhance programming skills.

Contents

The repository consists of solution of GeeksforGeeks questions, in C++ programming language.

Usage

You can browse the repository and explore the GeeksforGeeks questions based on your interests and learning goals. Follow these steps to make the most of this repository:

  1. Clone the repository:
git clone https://github.com/your-username/geeksforgeeks-practice.git
  1. Navigate to the desired problem category or topic directory:
cd geeksforgeeks-practice/<category>/<topic>
  1. Choose a specific problem and open the corresponding solution file, which usually has the problem name as its filename.

  2. Review the problem statement and the implemented solution in the programming language of your choice.

  3. Analyze the code, understand the algorithm, and modify it as needed for your learning and exploration.

  4. If you have a more optimized solution or a different approach, feel free to contribute by submitting a pull request. Make sure to follow the contribution guidelines mentioned below.

Contributing

Contributions to this GeeksforGeeks practice repository are welcome! If you have solved a GeeksforGeeks problem and would like to contribute your solution, please follow these steps:

  1. Fork the repository.

  2. Create a new branch with a descriptive name that reflects the problem you are solving:

git checkout -b <branch-name>
  1. Implement your solution in the corresponding category or topic directory.

  2. Add your solution file and ensure it follows the naming convention.

  3. Update the README.md file in the corresponding directory to include a link to your solution and a brief description if necessary.

  4. Commit and push your changes to the forked repository:

git commit -am 'Add solution for problem XYZ'
git push origin <branch-name>
  1. Submit a pull request explaining the problem you solved and any additional information.

Please ensure that your code follows the existing coding style and includes appropriate comments and documentation.

Contact

If you have any questions or suggestions regarding this repository, please feel free to reach out to me at [email protected].

gfg-practice-questions's People

Contributors

kareen12 avatar

Watchers

 avatar

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.