GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com β€” GitHub - abhiagx/InterviewBit: A collection of Abhishek Agrawal's C++ solutions providing scalable, production-quality code to 200+ LeetCode-style problems on https://www.interviewbit.com, designed to enhance algorithmic skills through practical learning and mentorship.

BranchesTags
Open more actions menu

Latest commit

 

History

440 Commits
440 Commits

Folders and files

NameName
Last commit message
Last commit date
Arrays
Arrays
 
 
Backtracking
Backtracking
 
 
BinarySearch
BinarySearch
 
 
BitManipulation
BitManipulation
 
 
CheckpointProblems
CheckpointProblems
 
 
DynamicProgramming
DynamicProgramming
 
 
Greedy
Greedy
 
 
Hashing
Hashing
 
 
HeapsAndMaps
HeapsAndMaps
 
 
LinkedLists
LinkedLists
 
 
Math
Math
 
 
StacksAndQueues
StacksAndQueues
 
 
Strings
Strings
 
 
Trees
Trees
 
 
TwoPointers
TwoPointers
 
 
.gitattributes
.gitattributes
 
 
.gitignore
.gitignore
 
 
LICENSE
LICENSE
 
 
README.md
README.md
 
 

Repository files navigation

πŸš€ InterviewBit Solutions Repository

Welcome to my InterviewBit Solutions repository! πŸŽ‰ This project started as a hands-on learning lab to bridge the gap between algorithm theory and real-world problem-solving using the absolutely fantastic language, C++. Over time, it has evolved into a trusted resource for 250+ engineers, for its production-quality code and annotated teaching style.

Whether you're preparing for coding interviews or looking to deepen your understanding of algorithms, this repository is here to help! πŸ’‘


🌟 About the Project

This repository contains working solutions (βœ… passing all test cases on the InterviewBit online judge) written in C++. In future, I’ll try adding Java solutions as well, as I’ve transitioned to using Java in my professional work. πŸ–₯️

Key Highlights:

  • Optimized Solutions: Each solution is crafted with a focus on time ⏱️ and space complexity πŸ’Ύ.
  • Modern C++ Features: Solutions leverage C++11 features like list initialization, auto, and emplace_back.
  • Multiple Approaches: Some problems include multiple solutions with detailed comments explaining the trade-offs.
  • Mentorship-Driven: The code reflects professional C++ experience, with an emphasis on clarity and readability to foster learning. πŸ§‘β€πŸ’»

πŸ“ Notes for Users

  1. Standalone Execution: The solutions are designed for the InterviewBit platform and may not run directly in your local IDE. To execute them locally, you’ll need to write a main() function and provide appropriate inputs/test cases.
  2. Multiple Solutions: If a file contains multiple approaches, they are separated by comments. Be cautious not to copy all solutions at once when submitting to the online judge.
  3. Original Content: All code in this repository is written by me. If you find it helpful, please consider giving the repo a ⭐ to show your support!

🀝 How to Contribute

Contributions are always welcome! Here’s how you can get involved:

  1. Fork the Repository 🍴
  2. Make Changes ✏️: Add, delete, or modify solutions.
  3. Follow Standards πŸ“š: Ensure your code follows the existing structure and includes the problem statement with a link to the InterviewBit problem.
    • Example: AddOneToNumber.cpp
  4. Submit Proof πŸ“Έ: Attach a screenshot showing that your solution was ACCEPTED by the InterviewBit online judge.
  5. Create a Pull Request 🚒: Submit your changes for review.

πŸ› οΈ When Should You Contribute?

You can contribute if your solution meets any of the following criteria:

  • Better Time Complexity ⏳: Your solution is faster than the one already present.
  • Better Space Complexity πŸ’Ύ: Your solution uses less memory.
  • Conciseness βœ‚οΈ: Your solution is equally efficient but more concise.
  • Improved Readability πŸ“–: Your solution is easier to understand, with clear comments explaining the logic.
  • Enhanced Documentation πŸ“: You’ve added meaningful comments or explanations to an existing solution.

πŸ’‘ Why This Repository?

This project is more than just a collection of solutions β€” it's a learning resource designed to help engineers grow. By sharing my journey and insights, I hope to inspire others to write clean, efficient, and maintainable code. 🌱

If you find this repository helpful, don’t forget to star ⭐ it and share it with others who might benefit. Let’s grow together! πŸ™Œ


Thank you for visiting, and happy coding! 😊
Feel free to reach out if you have any questions or suggestions. πŸ’¬

About

A collection of Abhishek Agrawal's C++ solutions providing scalable, production-quality code to 200+ LeetCode-style problems on https://www.interviewbit.com, designed to enhance algorithmic skills through practical learning and mentorship.

Topics

arraysbacktrackingbinarysearchbit-manipulationcplusplus-11cplusplus-14dynamic-programminggreedy-algorithmshashingheapsinterviewbitinterviewbit-solutionslinked-listmapsmathqueuestackstring-manipulationtreestwo-pointers

Resources

Readme
MIT license
Activity

Stars

269 stars

Watchers

6 watching

Forks

166 forks
Report repository

Releases

Packages

Used by

Contributors

Languages

You are visitor 01402503 β€” GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800Γ—600. No cookies required.