Skip to content

Building DSA, algorithm, & JavaScript skills for technical interviews. This repo contains implementations, solutions, & emphasizes clean coding, efficient algorithms, & conceptual understanding. Contributions & feedback welcome!

Notifications You must be signed in to change notification settings

PavanAditya/Interview-Playground

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

48 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Interview Playground

Description:

This repository is a collection of practice problems I'm working on to improve my skills in Data Structures & Algorithms (DSA), Dynamic Programming (DP), and JavaScript fundamentals. It serves as a playground to explore solutions for potential interview questions.

Structure:

DSA & Algorithms: This folder contains problems related to data structures, algorithms, and dynamic programming techniques.

JavaScript Fundamentals: This folder explores core concepts and interview questions specific to vanilla JavaScript.

Contribution:

Contributions are welcome! Feel free to contribute your own interview questions or alternative solutions! This repository is meant for collaborative learning and improvement. Please follow these guidelines if you'd like to contribute:

  • Fork the Repository: Start by forking this repository to your own GitHub account. This creates a copy of the repository under your control.

  • Clone Your Fork: Clone your forked repository to your local machine:

git clone https://github.com/YourUsername/Interview-Playground.git
  • Create a Branch: Create a new branch with a clear and descriptive name related to your contribution. This makes it easier to track changes and manage pull requests. Example for adding a new problem (e.g., "Binary Tree Level Order Traversal"):
git checkout -b feature/binary-tree-level-order-traversal
  • Make Your Changes: Implement your solution, add new problems, or make the necessary changes within your branch.

  • Commit Your Changes: Commit your changes with a clear and concise commit message.

git add . # Add all changed files
git commit -m "Add solution for Binary Tree Level Order Traversal"
  • Push to Your Fork: Push your branch to your forked repository on GitHub:
git push origin feature/binary-tree-level-order-traversal
  • Create a Pull Request: Go to the original repository (PavanAditya/Interview-Playground) on GitHub. You should see a prompt to create a pull request from your recently pushed branch. Click on it.

  • Describe Your Changes: In the pull request, provide a clear description of the changes you've made, including:

    • What problem you're solving or what improvement you're making.
    • Any relevant context or background information.
    • If you're adding a new problem, include a clear problem statement and example inputs/outputs.
  • Wait for Review: Your pull request will be reviewed by the repository maintainers. They may provide feedback or request changes.

  • Address Feedback (If Any): If changes are requested, make the necessary modifications in your branch, commit them, and push them to your fork. The pull request will automatically update.

  • Merge: Once your pull request is approved, it will be merged into the main repository.

By following these steps, you can ensure a smooth and organized contribution process.

Technology Stack: JavaScript

Getting Started:

Clone this repository:

git clone https://github.com/PavanAditya/Interview-Playground.git

Navigate to the project directory:

cd Interview-Playground

Feel free to add your own problem folders and code solutions within the existing structure.

License: [MIT License]

Additional Information:

Preparer: Pavan Aditya M S