diff --git a/.editorconfig b/.editorconfig
deleted file mode 100644
index 7e44d66..0000000
--- a/.editorconfig
+++ /dev/null
@@ -1,21 +0,0 @@
-root = true
-
-[*]
-charset = utf-8
-indent_style = space
-indent_size = 2
-end_of_line = lf
-insert_final_newline = true
-trim_trailing_whitespace = true
-
-[*.md]
-trim_trailing_whitespace = false
-indent_size = 4
-
-[*.py]
-indent_size = 4
-
-[Makefile]
-indent_style = tab
-indent_size = 4
-
diff --git a/.github/CONTRIBUTING.md b/.github/CONTRIBUTING.md
deleted file mode 100644
index 854139a..0000000
--- a/.github/CONTRIBUTING.md
+++ /dev/null
@@ -1 +0,0 @@
-# Contributing
diff --git a/.github/ISSUE_TEMPLATE/custom.md b/.github/ISSUE_TEMPLATE/custom.md
deleted file mode 100644
index 9728806..0000000
--- a/.github/ISSUE_TEMPLATE/custom.md
+++ /dev/null
@@ -1,22 +0,0 @@
----
-name: Custom issue template
-about: Custom template for issues
-title: ''
-labels: ''
-assignees: ''
-
----
-
-## Problem Statement
-
-## Description
-
-### Platform
-
-### Expected behavior
-
-### Observed behavior
-
-## Steps to reproduce behavior
-
-## Other notes
diff --git a/.github/pull_request_template.md b/.github/pull_request_template.md
deleted file mode 100644
index 7765077..0000000
--- a/.github/pull_request_template.md
+++ /dev/null
@@ -1,5 +0,0 @@
-## Issue
-
-## List of proposed changes/fixes
-
-## Other notes
diff --git a/.github/workflows/codeql-analysis.yml b/.github/workflows/codeql-analysis.yml
deleted file mode 100644
index 53d0b8b..0000000
--- a/.github/workflows/codeql-analysis.yml
+++ /dev/null
@@ -1,57 +0,0 @@
-name: "CodeQL"
-
-on:
-  push:
-    branches: [source]
-  pull_request:
-    # The branches below must be a subset of the branches above
-    branches: [source]
-  schedule:
-    - cron: "0 5 * * 6"
-
-jobs:
-  analyze:
-    name: Analyze
-    runs-on: ubuntu-latest
-
-    strategy:
-      fail-fast: false
-      matrix:
-        # Override automatic language detection by changing the below list
-        # Supported options are ['csharp', 'cpp', 'go', 'java', 'javascript', 'python']
-        language: ["javascript"]
-        # Learn more...
-        # https://docs.github.com/en/github/finding-security-vulnerabilities-and-errors-in-your-code/configuring-code-scanning#overriding-automatic-language-detection
-
-    steps:
-      - name: Checkout repository
-        uses: actions/checkout@v2
-
-      # Initializes the CodeQL tools for scanning.
-      - name: Initialize CodeQL
-        uses: github/codeql-action/init@v1
-        with:
-          languages: ${{ matrix.language }}
-          # If you wish to specify custom queries, you can do so here or in a config file.
-          # By default, queries listed here will override any specified in a config file.
-          # Prefix the list here with "+" to use these queries and those in the config file.
-          # queries: ./path/to/local/query, your-org/your-repo/queries@main
-
-      # Autobuild attempts to build any compiled languages  (C/C++, C#, or Java).
-      # If this step fails, then you should remove it and run the build manually (see below)
-      - name: Autobuild
-        uses: github/codeql-action/autobuild@v1
-
-      # ℹ️ Command-line programs to run using the OS shell.
-      # 📚 https://git.io/JvXDl
-
-      # ✏️ If the Autobuild fails above, remove it and uncomment the following three lines
-      #    and modify them (or add more) to build your code if your project
-      #    uses a compiled language
-
-      #- run: |
-      #   make bootstrap
-      #   make release
-
-      - name: Perform CodeQL Analysis
-        uses: github/codeql-action/analyze@v1
diff --git a/.github/workflows/linter.yml b/.github/workflows/linter.yml
deleted file mode 100644
index 3bd13d5..0000000
--- a/.github/workflows/linter.yml
+++ /dev/null
@@ -1,52 +0,0 @@
----
-###########################
-###########################
-## Linter GitHub Actions ##
-###########################
-###########################
-name: Lint Code Base
-
-#
-# Documentation:
-# https://help.github.com/en/articles/workflow-syntax-for-github-actions
-#
-
-#############################
-# Start the job on all push #
-#############################
-on:
-  push:
-    # branches-ignore: [master]
-    # Remove the line above to run when pushing to master
-  pull_request:
-    branches: [source]
-
-###############
-# Set the Job #
-###############
-jobs:
-  build:
-    # Name the Job
-    name: Lint Code Base
-    # Set the agent to run on
-    runs-on: ubuntu-latest
-
-    ##################
-    # Load all steps #
-    ##################
-    steps:
-      ##########################
-      # Checkout the code base #
-      ##########################
-      - name: Checkout Code
-        uses: actions/checkout@v2
-
-      ################################
-      # Run Linter against code base #
-      ################################
-      - name: Lint Code Base
-        uses: github/super-linter@v3
-        env:
-          VALIDATE_ALL_CODEBASE: false
-          DEFAULT_BRANCH: master
-          GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
diff --git a/.github/workflows/main.yml b/.github/workflows/main.yml
deleted file mode 100644
index 8d89e21..0000000
--- a/.github/workflows/main.yml
+++ /dev/null
@@ -1,57 +0,0 @@
-# Should have a step to deploy to gh-pages
-
-name: build-test
-on:
-  push:
-    branches:
-      - source
-  pull_request:
-    branches:
-      - source
-  schedule:
-    - cron: "0 */13 * * *"
-  workflow_dispatch:
-jobs:
-  build:
-    name: Build
-    runs-on: ${{ matrix.os }}
-    strategy:
-      fail-fast: false
-      matrix:
-        os: [ubuntu-latest]
-    steps:
-      - uses: actions/checkout@v2
-      - name: Download artifact
-        uses: dawidd6/action-download-artifact@v2
-        with:
-          # Optional, GitHub token
-          github_token: ${{secrets.GITHUB_TOKEN}}
-          # Required, workflow file name or ID
-          workflow: main.yml
-          # Optional, the status or conclusion of a completed workflow to search for
-          # Can be one of a workflow conculsion::
-          # "failure", "success", "neutral", "cancelled", "skipped", "timed_out", "action_required"
-          # Or a workflow status:
-          # "completed", "in_progress", "queued"
-          # Default: "completed"
-          workflow_conclusion: success
-          branch: main
-          # Optional, uploaded artifact name,
-          # will download all artifacts if not specified
-          # and extract them in respective subdirectories
-          # https://github.com/actions/download-artifact#download-all-artifacts
-          name: artifacts
-          # Optional, directory where to extract artifact
-          path: ./src/website
-          # Optional, defaults to current repo
-          repo: computer-science-engineering/readme
-      - name: Deploy
-        uses: peaceiris/actions-gh-pages@v3
-        if: ${{ github.event_name == 'push' && env.BRANCH == 'source' }}
-        with:
-          github_token: ${{ secrets.GITHUB_TOKEN }}
-          publish_dir: ./src/website
-          publish_branch: main # default: gh-pages
-          keep_files: false # default: false
-          force_orphan: true
-          commit_message: "GitHub CI Updates [ci skip]"
diff --git a/.github/workflows/ossar-analysis.yml b/.github/workflows/ossar-analysis.yml
deleted file mode 100644
index 5d83b8a..0000000
--- a/.github/workflows/ossar-analysis.yml
+++ /dev/null
@@ -1,49 +0,0 @@
-# This workflow integrates a collection of open source static analysis tools
-# with GitHub code scanning. For documentation, or to provide feedback, visit
-# https://github.com/github/ossar-action
-name: OSSAR
-
-on:
-  push:
-  pull_request:
-
-jobs:
-  OSSAR-Scan:
-    # OSSAR runs on windows-latest.
-    # ubuntu-latest and macos-latest support coming soon
-    runs-on: windows-latest
-
-    steps:
-      # Checkout your code repository to scan
-    - name: Checkout repository
-      uses: actions/checkout@v2
-      with:
-        # We must fetch at least the immediate parents so that if this is
-        # a pull request then we can checkout the head.
-        fetch-depth: 2
-
-    # If this run was triggered by a pull request event, then checkout
-    # the head of the pull request instead of the merge commit.
-    - run: git checkout HEAD^2
-      if: ${{ github.event_name == 'pull_request' }}
-
-    # Ensure a compatible version of dotnet is installed.
-    # The [Microsoft Security Code Analysis CLI](https://aka.ms/mscadocs) is built with dotnet v3.1.201.
-    # A version greater than or equal to v3.1.201 of dotnet must be installed on the agent in order to run this action.
-    # Remote agents already have a compatible version of dotnet installed and this step may be skipped.
-    # For local agents, ensure dotnet version 3.1.201 or later is installed by including this action:
-    # - name: Install .NET
-    #   uses: actions/setup-dotnet@v1
-    #   with:
-    #     dotnet-version: '3.1.x'
-
-      # Run open source static analysis tools
-    - name: Run OSSAR
-      uses: github/ossar-action@v1
-      id: ossar
-
-      # Upload results to the Security tab
-    - name: Upload OSSAR results
-      uses: github/codeql-action/upload-sarif@v1
-      with:
-        sarif_file: ${{ steps.ossar.outputs.sarifFile }}
diff --git a/.gitignore b/.gitignore
deleted file mode 100644
index 78c6851..0000000
--- a/.gitignore
+++ /dev/null
@@ -1,73 +0,0 @@
-# Logs
-logs
-*.log
-npm-debug.log*
-yarn-debug.log*
-yarn-error.log*
-
-# Runtime data
-pids
-*.pid
-*.seed
-*.pid.lock
-
-# Directory for instrumented libs generated by jscoverage/JSCover
-lib-cov
-
-# Coverage directory used by tools like istanbul
-coverage
-
-# nyc test coverage
-.nyc_output
-
-# Grunt intermediate storage (http://gruntjs.com/creating-plugins#storing-task-files)
-.grunt
-
-# Bower dependency directory (https://bower.io/)
-bower_components
-
-# node-waf configuration
-.lock-wscript
-
-# Compiled binary addons (https://nodejs.org/api/addons.html)
-build/Release
-
-# Dependency directories
-node_modules/
-jspm_packages/
-
-# TypeScript v1 declaration files
-typings/
-
-# Optional npm cache directory
-.npm
-
-# Optional eslint cache
-.eslintcache
-
-# Optional REPL history
-.node_repl_history
-
-# Output of 'npm pack'
-*.tgz
-
-# Yarn Integrity file
-.yarn-integrity
-
-# dotenv environment variables file
-.env
-
-# next.js build output
-.next
-
-.metals
-
-out
-dist
-
-
-.vscode-test/
-*.vsix
-
-.vscode/.ropeproject
-__pycache__
diff --git a/.markdownlint.json b/.markdownlint.json
deleted file mode 100644
index 57b5843..0000000
--- a/.markdownlint.json
+++ /dev/null
@@ -1,7 +0,0 @@
-{
-    "default": true,
-    "MD007": {
-        "indent": 4
-    },
-    "MD013": false
-}
\ No newline at end of file
diff --git a/.github/actions/action.yml b/.nojekyll
similarity index 100%
rename from .github/actions/action.yml
rename to .nojekyll
diff --git a/.vscode/extensions.json b/.vscode/extensions.json
deleted file mode 100644
index 342de8a..0000000
--- a/.vscode/extensions.json
+++ /dev/null
@@ -1,6 +0,0 @@
-// Step1: Get extensions json data from sync gist.
-// Step2: https://jsonformatter.org/json-parser to get metadata.publisherId
-
-{
-  "recommendations": []
-}
diff --git a/.vscode/settings.json b/.vscode/settings.json
deleted file mode 100644
index d1d3483..0000000
--- a/.vscode/settings.json
+++ /dev/null
@@ -1,71 +0,0 @@
-{
-  "eslint.validate": [
-    "html",
-    "javascript",
-    "typescript",
-    "typescriptreact",
-    "markdown",
-    "json"
-  ],
-  "editor.formatOnType": true,
-  "editor.formatOnSave": true,
-  "editor.formatOnPaste": true,
-  "editor.codeActionsOnSave": {
-    "source.fixAll.eslint": true
-  },
-  "prettier.singleQuote": true,
-  "eslint.workingDirectories": [
-    {
-      "directory": "./",
-      "changeProcessCWD": true
-    },
-    {
-      "directory": "./app",
-      "changeProcessCWD": true
-    },
-    {
-      "directory": "./website",
-      "changeProcessCWD": true
-    }
-  ],
-  "markdown.extension.print.onFileSave": false,
-  "markdown.extension.toc.orderedList": true,
-  "javascript.validate.enable": true,
-  "standard.enable": false,
-  "markdown.extension.toc.levels": "2..6",
-  "markdown.extension.toc.githubCompatibility": true,
-  "editor.tabSize": 2,
-  "cSpell.words": [
-    "Sourcegraph"
-  ],
-  "files.watcherExclude": {
-    "**/target": true
-  },
-  "python.testing.unittestEnabled": false,
-  "python.testing.unittestArgs": [
-    "-v",
-    "-s",
-    ".",
-    "-p",
-    "*test.py"
-  ],
-  "python.testing.promptToConfigure": false,
-  "python.testing.pytestEnabled": false,
-  "python.testing.nosetestsEnabled": false,
-  "python.linting.pylintEnabled": true,
-  "java.test.config": [
-    {
-      "name": "myConfig",
-      "workingDirectory": "${workspaceFolder}"
-    }
-  ],
-  "java.test.defaultConfig": "myConfig",
-  "markdownShortcuts.bullets.marker": "-",
-  "java.format.settings.url": "https://raw.githubusercontent.com/google/styleguide/gh-pages/eclipse-java-google-style.xml",
-  "java.format.settings.profile": "GoogleStyle",
-  "java.checkstyle.configuration": "",
-  "java.debug.settings.console": "internalConsole",
-  "markdown.extension.list.indentationSize": "inherit",
-  "python.linting.enabled": true,
-  "c3.rootPackage": ""
-}
diff --git a/CHANGELOG.md b/CHANGELOG.md
deleted file mode 100644
index cb9b616..0000000
--- a/CHANGELOG.md
+++ /dev/null
@@ -1,28 +0,0 @@
-# Changelog
-
-All notable changes to this project will be documented in this file.
-
-The format is based on [Keep a Changelog][Keep a Changelog], and this project adheres to [Semantic Versioning][Semantic Versioning].
-
-## [Unreleased]
-
-## [0.0.1] - 2021-01-02
-
-### Added
-
-- First version.
-
-<!-- Links -->
-[Keep a Changelog]: https://keepachangelog.com/
-[Semantic Versioning]: https://semver.org/
-
-<!-- Versions -->
-[Unreleased]: https://github.com/computer-science-engineering
-/
-computer-science-engineering.github.io/compare/v0.0.1..HEAD
-[0.0.2]: https://github.com/computer-science-engineering
-/
-computer-science-engineering.github.io/compare/v0.0.1..v0.0.2
-[0.0.1]: https://github.com/computer-science-engineering
-/
-computer-science-engineering.github.io/releases/tag/v0.0.1
diff --git a/CODE_OF_CONDUCT.md b/CODE_OF_CONDUCT.md
deleted file mode 100644
index c832f87..0000000
--- a/CODE_OF_CONDUCT.md
+++ /dev/null
@@ -1,76 +0,0 @@
-# Contributor Covenant Code of Conduct
-
-## Our Pledge
-
-In the interest of fostering an open and welcoming environment, we as
-contributors and maintainers pledge to making participation in our project and
-our community a harassment-free experience for everyone, regardless of age, body
-size, disability, ethnicity, sex characteristics, gender identity and expression,
-level of experience, education, socio-economic status, nationality, personal
-appearance, race, religion, or sexual identity and orientation.
-
-## Our Standards
-
-Examples of behavior that contributes to creating a positive environment
-include:
-
-* Using welcoming and inclusive language
-* Being respectful of differing viewpoints and experiences
-* Gracefully accepting constructive criticism
-* Focusing on what is best for the community
-* Showing empathy towards other community members
-
-Examples of unacceptable behavior by participants include:
-
-* The use of sexualized language or imagery and unwelcome sexual attention or
- advances
-* Trolling, insulting/derogatory comments, and personal or political attacks
-* Public or private harassment
-* Publishing others' private information, such as a physical or electronic
- address, without explicit permission
-* Other conduct which could reasonably be considered inappropriate in a
- professional setting
-
-## Our Responsibilities
-
-Project maintainers are responsible for clarifying the standards of acceptable
-behavior and are expected to take appropriate and fair corrective action in
-response to any instances of unacceptable behavior.
-
-Project maintainers have the right and responsibility to remove, edit, or
-reject comments, commits, code, wiki edits, issues, and other contributions
-that are not aligned to this Code of Conduct, or to ban temporarily or
-permanently any contributor for other behaviors that they deem inappropriate,
-threatening, offensive, or harmful.
-
-## Scope
-
-This Code of Conduct applies both within project spaces and in public spaces
-when an individual is representing the project or its community. Examples of
-representing a project or community include using an official project e-mail
-address, posting via an official social media account, or acting as an appointed
-representative at an online or offline event. Representation of a project may be
-further defined and clarified by project maintainers.
-
-## Enforcement
-
-Instances of abusive, harassing, or otherwise unacceptable behavior may be
-reported by contacting the project team at firstname.lastname@gmail.com. All
-complaints will be reviewed and investigated and will result in a response that
-is deemed necessary and appropriate to the circumstances. The project team is
-obligated to maintain confidentiality with regard to the reporter of an incident.
-Further details of specific enforcement policies may be posted separately.
-
-Project maintainers who do not follow or enforce the Code of Conduct in good
-faith may face temporary or permanent repercussions as determined by other
-members of the project's leadership.
-
-## Attribution
-
-This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
-available at https://www.contributor-covenant.org/version/1/4/code-of-conduct.html
-
-[homepage]: https://www.contributor-covenant.org
-
-For answers to common questions about this code of conduct, see
-https://www.contributor-covenant.org/faq
diff --git a/LICENSE b/LICENSE
deleted file mode 100644
index 87bb4bc..0000000
--- a/LICENSE
+++ /dev/null
@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) 2019 Manas Talukdar
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
diff --git a/Makefile b/Makefile
deleted file mode 100644
index 32640b3..0000000
--- a/Makefile
+++ /dev/null
@@ -1,17 +0,0 @@
-workspaceFolder :=
-
-# https://gist.github.com/sighingnow/deee806603ec9274fd47
-ifneq ($(OS),Windows_NT)
-	workspaceFolder = ./
-endif
-
-backend:
-	@echo WIP
-
-cli:
-	@echo WIP
-
-frontend:
-	@echo WIP
-
-all: backend cli frontend
diff --git a/README.md b/README.md
deleted file mode 100644
index 8f7f2b7..0000000
--- a/README.md
+++ /dev/null
@@ -1,65 +0,0 @@
-# Org Website
-
-1. [Overview](#overview)
-2. [Project](#project)
-    1. [Project Management](#project-management)
-3. [Product](#product)
-4. [Development](#development)
-    1. [Contributing](#contributing)
-    2. [Other](#other)
-5. [Links](#links)
-6. [Notes](#notes)
-7. [References](#references)
-8. [License](#license)
-
-## Overview
-
-[![Actions Status](https://github.com/computer-science-engineering/computer-science-engineering.github.io/workflows/build-test/badge.svg)](https://github.com/computer-science-engineering/computer-science-engineering.github.io/actions)
-[![GitHub Super-Linter](https://github.com/computer-science-engineering/computer-science-engineering.github.io/workflows/Lint%20Code%20Base/badge.svg)](https://github.com/marketplace/actions/super-linter)
-
-[More project metadata badges [here](./documentation/project/metadata.md). More CI/CD badges [here](./documentation/development/ci-cd.md#current-status).]
-
-## Project
-
-| Document | Link                                                                       |
-| -------- | -------------------------------------------------------------------------- |
-| Metadata | [./documentation/project/metadata.md](./documentation/project/metadata.md) |
-
-### Project Management
-
-[GitHub Projects](https://github.com/computer-science-engineering/computer-science-engineering.github.io/projects)
-
-## Product
-
-| Document     | Link                                                                               |
-| ------------ | ---------------------------------------------------------------------------------- |
-| Installation | [./documentation/product/installation.md](./documentation/product/installation.md) |
-| Usage        | [./documentation/product/usage.md](./documentation/product/usage.md)               |
-
-## Development
-
-| Document                | Link                                                                                                     |
-| ----------------------- | -------------------------------------------------------------------------------------------------------- |
-| Design and Architecture | [./documentation/development/design-architecture.md](./documentation/development/design-architecture.md) |
-| Requirements            | [./documentation/development/requirements.md](./documentation/development/requirements.md)               |
-| Development             | [./documentation/development/development.md](./documentation/development/development.md)                 |
-| Testing                 | [./documentation/development/testing.md](./documentation/development/testing.md)                         |
-| CI/CD                   | [./documentation/development/ci-cd.md](./documentation/development/ci-cd.md)                             |
-
-### Contributing
-
-[./.github/CONTRIBUTING.md](./.github/CONTRIBUTING.md)
-
-### Other
-
-## Links
-
-- [Sourcegraph](https://sourcegraph.com/github.com/computer-science-engineering/computer-science-engineering.github.io/)
-
-## Notes
-
-## References
-
-## License
-
-[MIT](https://github.com/computer-science-engineering/computer-science-engineering.github.io/blob/master/LICENSE)
diff --git a/src/website/css/styles.css b/css/styles.css
similarity index 100%
rename from src/website/css/styles.css
rename to css/styles.css
diff --git a/documentation/development/ci-cd.md b/documentation/development/ci-cd.md
deleted file mode 100644
index d8822a8..0000000
--- a/documentation/development/ci-cd.md
+++ /dev/null
@@ -1,68 +0,0 @@
-# CI, CD
-
-1. [Current Status](#current-status)
-2. [Methodology](#methodology)
-    1. [Committing code](#committing-code)
-    2. [Versioning of packages/deliverables](#versioning-of-packagesdeliverables)
-    3. [Builds](#builds)
-    4. [Deployments](#deployments)
-    5. [Status badges](#status-badges)
-
-## Current Status
-
-| Platform | Provider | Operations                      | Status                                                                                                                                                                                                                                     |
-| -------- | -------- | ------------------------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ |
-| Linux    | GitHub   | Build, Test, Deploy to gh-pages | [![Actions Status](https://github.com/computer-science-engineering/computer-science-engineering.github.io/workflows/build-test/badge.svg)](https://github.com/computer-science-engineering/computer-science-engineering.github.io/actions) |
-| Linux    | GitHub   | Linter                          | [![GitHub Super-Linter](https://github.com/computer-science-engineering/computer-science-engineering.github.io/workflows/Lint%20Code%20Base/badge.svg)](https://github.com/marketplace/actions/super-linter)                               |
-
-## Methodology
-
-Implement CI-CD pipelines with the following functionality. Consider using GitHub actions.
-
-### Committing code
-
-- Code should be pushed into `master` only by using PRs. Disable direct push functionality into `master`.
-- Disable PRs into `master` lacking reference to any issue.
-- Disable commits and PRs into `develop` lacking reference to any issue.
-
-### Versioning of packages/deliverables
-
-Versioning of packages published by different branches:
-
-- `master` deploys stable production code. `latest` tag should be used for the corresponding npm package.
-- `develop` deploys under-development code. `next` tag should be used for the corresponding npm package.
-
-### Builds
-
-Automated builds should be triggered on:
-
-- Pushing code to `develop`.
-- Creating new PR into `develop`.
-- Creating new PR into `master`.
-
-### Deployments
-
-Automated deployments should be triggered on:
-
-- Successful build triggered by direct push of code into `develop`.
-- Successful merge of a PR into `develop`.
-- Successful merge of a PR into `master`.
-
-Deployment pipeline should:
-
-1. Tag the branch with the correct semantic version number. Investigate using some open-source automated semver tooling.
-2. Create GitHub release. The Release text can be initially (and automatically) populated by issues (title and link) referenced by the direct push commit or the PR that just got merged in.
-3. Publish package to npm.
-    - On `develop` package should be tagged as `next`.
-    - On `master` package should be tagged as `latest`.
-    - **Question**: What about release candidates? `rc` tags? Which branch does this go from? Typically this goes from an intermediate release branch. How would this tie into the automation?
-
-It is worth considering if steps 1, 2 and 3 above:
-
-- should be automated by a deployment pipeline, or
-- should be left as manual, or
-- should be automated but manual deployments should also be allowed.
-
-### Status badges
-
-CI/CD status badges should be provided in the README.md file for builds and deployments from both `develop` and `master` branches.
diff --git a/documentation/development/design-architecture.md b/documentation/development/design-architecture.md
deleted file mode 100644
index e5ce7e6..0000000
--- a/documentation/development/design-architecture.md
+++ /dev/null
@@ -1 +0,0 @@
-# Design and Architecture
diff --git a/documentation/development/development.md b/documentation/development/development.md
deleted file mode 100644
index 459110d..0000000
--- a/documentation/development/development.md
+++ /dev/null
@@ -1 +0,0 @@
-# Development
diff --git a/documentation/development/requirements.md b/documentation/development/requirements.md
deleted file mode 100644
index 9ea4127..0000000
--- a/documentation/development/requirements.md
+++ /dev/null
@@ -1,30 +0,0 @@
-# Requirements
-
-1. [Environment](#environment)
-   1. [Upgrading to newer versions of development environments](#upgrading-to-newer-versions-of-development-environments)
-2. [Other](#other)
-
-## Environment
-
-| Language | Version | Package |
-| -------- | ------- | ------- |
-
-I recommended using [VS Code](https://code.visualstudio.com/).
-
-If you are on Windows, I highly recommend installing [msys2](http://www.msys2.org/). After installation, run the following from the `msys2` shell:
-
-```plaintext
-pacman -Syu
-pacman -S base-devel
-pacman -S mingw-w64-x86_64-toolchain
-pacman -S mingw-w64-x86_64-cmake
-```
-
-### Upgrading to newer versions of development environments
-
-## Other
-
-1. For those who may not wish to use VSCode and instead prefer a simple text editor
-   1. There is a `Makefile` at the root of this repository for building and running tests.
-   2. Instructions will be provided at a later time for command line usage to add new problems, run tests, etc.
-2. I do not recommend using any sort of bloated IDE. They tend to add a lot of files simply for their specific plumbing.
diff --git a/documentation/development/testing.md b/documentation/development/testing.md
deleted file mode 100644
index a5f9efb..0000000
--- a/documentation/development/testing.md
+++ /dev/null
@@ -1,4 +0,0 @@
-# Testing
-
-1. VSCode tasks are available via the repository (.vscode folder) for running all language specific tests. Please familiarize yourself with using tasks in VSCode.
-2. Makefile tasks are also provided for running tests.
diff --git a/documentation/product/installation.md b/documentation/product/installation.md
deleted file mode 100644
index 25267fe..0000000
--- a/documentation/product/installation.md
+++ /dev/null
@@ -1 +0,0 @@
-# Installation
diff --git a/documentation/product/usage.md b/documentation/product/usage.md
deleted file mode 100644
index 8a226d8..0000000
--- a/documentation/product/usage.md
+++ /dev/null
@@ -1,10 +0,0 @@
-# Usage
-
-1. [Viewing](#viewing)
-
-## Viewing
-
-1. Open repository using [Visual Studio Code](https://code.visualstudio.com/). Recommended extensions have been provided by the repository (.vscode folder).
-2. Use [Sourcegraph](https://sourcegraph.com/github.com/computer-science-engineering
-/
-computer-science-engineering.github.io/).
diff --git a/documentation/project/metadata.md b/documentation/project/metadata.md
deleted file mode 100644
index 3d82738..0000000
--- a/documentation/project/metadata.md
+++ /dev/null
@@ -1,30 +0,0 @@
-# Metadata
-
-| Provider                                                              | Data                                      | Status                                                                                                                                                                                                                                                                                            |
-| --------------------------------------------------------------------- | ----------------------------------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
-| Discord                                                               | Chat Server                               |                                                                                                                                                                                                                                                                                                   |
-| GitHub                                                                | Repo Size                                 | ![GitHub repo size](https://img.shields.io/github/repo-size/computer-science-engineerin/computer-science-engineering.github.io)                                                                                                                                                                   |
-| GitHub                                                                | Code Size                                 | ![GitHub code size in bytes](https://img.shields.io/github/languages/code-size/computer-science-engineering/computer-science-engineering.github.io)                                                                                                                                               |
-| GitHub                                                                | Commit Activity                           | ![GitHub commit activity](https://img.shields.io/github/commit-activity/m/computer-science-engineering/computer-science-engineering.github.io)                                                                                                                                                    |
-| GitHub                                                                | Last Commit                               | ![GitHub last commit](https://img.shields.io/github/last-commit/computer-science-engineering/computer-science-engineering.github.io)                                                                                                                                                              |
-| GitHub                                                                | Open Issues                               | ![GitHub issues](https://img.shields.io/github/issues-raw/computer-science-engineering/computer-science-engineering.github.io)                                                                                                                                                                    |
-| GitHub                                                                | Closed Issues                             | ![GitHub issues](https://img.shields.io/github/issues-closed/computer-science-engineering/computer-science-engineering.github.io)                                                                                                                                                                 |
-| GitHub                                                                | Language Count                            | ![GitHub language count](https://img.shields.io/github/languages/count/computer-science-engineering/computer-science-engineering.github.io)                                                                                                                                                       |
-| GitHub                                                                | License                                   | ![GitHub](https://img.shields.io/github/license/computer-science-engineering/computer-science-engineering.github.io)                                                                                                                                                                              |
-| [FOSSA](https://fossa.com/)                                           | Open Source Software Management           |                                                                                                                                                                                                                                                                                                   |
-| [CII Best Practices](https://bestpractices.coreinfrastructure.org/en) | Open source software best practices check |                                                                                                                                                                                                                                                                                                   |
-| david-dm                                                              | Check node.js dependency status           | [![Dependency Status](https://img.shields.io/david/computer-science-engineering/computer-science-engineering.github.io?path=src/react-next-website)](https://david-dm.org/computer-science-engineering/computer-science-engineering.github.io?path=src/react-next-website)                        |
-| david-dm                                                              | Check node.js dev dependency status       | [![devDependencies Status](https://img.shields.io/david/computer-science-engineering/computer-science-engineering.github.io?path=src/react-next-website&type=dev)](https://david-dm.org/computer-science-engineering/computer-science-engineering.github.io?path=src/react-next-website&type=dev) |
-
-<!--
-| N/A | david-dm | Check node.js dependency status | [![Dependency Status](https://david-dm.org/computer-science-engineering
-/
-computer-science-engineering.github.io.svg?path=website)](https://david-dm.org/computer-science-engineering
-/
-computer-science-engineering.github.io?path=website) |
-| N/A | david-dm | Check node.js dev dependency status | [![devDependencies Status](https://david-dm.org/computer-science-engineering
-/
-computer-science-engineering.github.io/dev-status.svg?path=website)](https://david-dm.org/computer-science-engineering
-/
-computer-science-engineering.github.io?path=website&type=dev) |
->
diff --git a/src/website/index.html b/index.html
similarity index 100%
rename from src/website/index.html
rename to index.html
diff --git a/src/website/js/app.js b/js/app.js
similarity index 100%
rename from src/website/js/app.js
rename to js/app.js
diff --git a/src/website/js/app.min.js b/js/app.min.js
similarity index 100%
rename from src/website/js/app.min.js
rename to js/app.min.js
diff --git a/src/website/js/third-party/bootstrap-multiselect/css/bootstrap-multiselect.css b/js/third-party/bootstrap-multiselect/css/bootstrap-multiselect.css
similarity index 100%
rename from src/website/js/third-party/bootstrap-multiselect/css/bootstrap-multiselect.css
rename to js/third-party/bootstrap-multiselect/css/bootstrap-multiselect.css
diff --git a/src/website/js/third-party/bootstrap-multiselect/js/bootstrap-multiselect-collapsible-groups.js b/js/third-party/bootstrap-multiselect/js/bootstrap-multiselect-collapsible-groups.js
similarity index 100%
rename from src/website/js/third-party/bootstrap-multiselect/js/bootstrap-multiselect-collapsible-groups.js
rename to js/third-party/bootstrap-multiselect/js/bootstrap-multiselect-collapsible-groups.js
diff --git a/src/website/js/third-party/bootstrap-multiselect/js/bootstrap-multiselect.js b/js/third-party/bootstrap-multiselect/js/bootstrap-multiselect.js
similarity index 100%
rename from src/website/js/third-party/bootstrap-multiselect/js/bootstrap-multiselect.js
rename to js/third-party/bootstrap-multiselect/js/bootstrap-multiselect.js
diff --git a/src/website/js/third-party/footable/footable-components.latest/css/footable.core.bootstrap.min.css b/js/third-party/footable/footable-components.latest/css/footable.core.bootstrap.min.css
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/css/footable.core.bootstrap.min.css
rename to js/third-party/footable/footable-components.latest/css/footable.core.bootstrap.min.css
diff --git a/src/website/js/third-party/footable/footable-components.latest/css/footable.core.standalone.min.css b/js/third-party/footable/footable-components.latest/css/footable.core.standalone.min.css
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/css/footable.core.standalone.min.css
rename to js/third-party/footable/footable-components.latest/css/footable.core.standalone.min.css
diff --git a/src/website/js/third-party/footable/footable-components.latest/css/footable.editing.min.css b/js/third-party/footable/footable-components.latest/css/footable.editing.min.css
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/css/footable.editing.min.css
rename to js/third-party/footable/footable-components.latest/css/footable.editing.min.css
diff --git a/src/website/js/third-party/footable/footable-components.latest/css/footable.filtering.min.css b/js/third-party/footable/footable-components.latest/css/footable.filtering.min.css
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/css/footable.filtering.min.css
rename to js/third-party/footable/footable-components.latest/css/footable.filtering.min.css
diff --git a/src/website/js/third-party/footable/footable-components.latest/css/footable.paging.min.css b/js/third-party/footable/footable-components.latest/css/footable.paging.min.css
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/css/footable.paging.min.css
rename to js/third-party/footable/footable-components.latest/css/footable.paging.min.css
diff --git a/src/website/js/third-party/footable/footable-components.latest/css/footable.sorting.min.css b/js/third-party/footable/footable-components.latest/css/footable.sorting.min.css
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/css/footable.sorting.min.css
rename to js/third-party/footable/footable-components.latest/css/footable.sorting.min.css
diff --git a/src/website/js/third-party/footable/footable-components.latest/js/footable.core.min.js b/js/third-party/footable/footable-components.latest/js/footable.core.min.js
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/js/footable.core.min.js
rename to js/third-party/footable/footable-components.latest/js/footable.core.min.js
diff --git a/src/website/js/third-party/footable/footable-components.latest/js/footable.editing.min.js b/js/third-party/footable/footable-components.latest/js/footable.editing.min.js
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/js/footable.editing.min.js
rename to js/third-party/footable/footable-components.latest/js/footable.editing.min.js
diff --git a/src/website/js/third-party/footable/footable-components.latest/js/footable.export.min.js b/js/third-party/footable/footable-components.latest/js/footable.export.min.js
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/js/footable.export.min.js
rename to js/third-party/footable/footable-components.latest/js/footable.export.min.js
diff --git a/src/website/js/third-party/footable/footable-components.latest/js/footable.filtering.min.js b/js/third-party/footable/footable-components.latest/js/footable.filtering.min.js
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/js/footable.filtering.min.js
rename to js/third-party/footable/footable-components.latest/js/footable.filtering.min.js
diff --git a/src/website/js/third-party/footable/footable-components.latest/js/footable.paging.min.js b/js/third-party/footable/footable-components.latest/js/footable.paging.min.js
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/js/footable.paging.min.js
rename to js/third-party/footable/footable-components.latest/js/footable.paging.min.js
diff --git a/src/website/js/third-party/footable/footable-components.latest/js/footable.sorting.min.js b/js/third-party/footable/footable-components.latest/js/footable.sorting.min.js
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/js/footable.sorting.min.js
rename to js/third-party/footable/footable-components.latest/js/footable.sorting.min.js
diff --git a/src/website/js/third-party/footable/footable-components.latest/js/footable.state.min.js b/js/third-party/footable/footable-components.latest/js/footable.state.min.js
similarity index 100%
rename from src/website/js/third-party/footable/footable-components.latest/js/footable.state.min.js
rename to js/third-party/footable/footable-components.latest/js/footable.state.min.js
diff --git a/src/website/js/third-party/footable/footable-standalone.latest/css/footable.standalone.min.css b/js/third-party/footable/footable-standalone.latest/css/footable.standalone.min.css
similarity index 100%
rename from src/website/js/third-party/footable/footable-standalone.latest/css/footable.standalone.min.css
rename to js/third-party/footable/footable-standalone.latest/css/footable.standalone.min.css
diff --git a/src/website/js/third-party/footable/footable-standalone.latest/js/footable.min.js b/js/third-party/footable/footable-standalone.latest/js/footable.min.js
similarity index 100%
rename from src/website/js/third-party/footable/footable-standalone.latest/js/footable.min.js
rename to js/third-party/footable/footable-standalone.latest/js/footable.min.js
diff --git a/src/website/js/third-party/momentjs/moment.js b/js/third-party/momentjs/moment.js
similarity index 100%
rename from src/website/js/third-party/momentjs/moment.js
rename to js/third-party/momentjs/moment.js
diff --git a/src/website/js/third-party/selectize/selectize.default.css b/js/third-party/selectize/selectize.default.css
similarity index 100%
rename from src/website/js/third-party/selectize/selectize.default.css
rename to js/third-party/selectize/selectize.default.css
diff --git a/src/website/js/third-party/selectize/selectize.js b/js/third-party/selectize/selectize.js
similarity index 100%
rename from src/website/js/third-party/selectize/selectize.js
rename to js/third-party/selectize/selectize.js
diff --git a/metadata.json b/metadata.json
deleted file mode 100644
index 3720ca3..0000000
--- a/metadata.json
+++ /dev/null
@@ -1,5 +0,0 @@
-{
-  "type": "Website",
-  "name": "Org Website",
-  "skip_for_problems_list": "True"
-}
diff --git a/problems_list.json b/problems_list.json
new file mode 100644
index 0000000..5895444
--- /dev/null
+++ b/problems_list.json
@@ -0,0 +1,14546 @@
+[
+  {
+    "Id": 1,
+    "Type": "Coding",
+    "Name": "Median of Arrays",
+    "Origin": "Byte by Byte",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ByteByByte/src/CodingInterviewQuestions/Array/P1_MedianOfArrays",
+    "Companies": [],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array",
+      "Searching"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 2,
+    "Type": "Coding",
+    "Name": "0-1 Knapsack",
+    "Origin": "Byte by Byte",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ByteByByte/src/CodingInterviewQuestions/Array/P2_01Knapsack",
+    "Companies": [],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array",
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 3,
+    "Type": "Coding",
+    "Name": "BTree Printer",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/Helper/BTreePrinter",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 4,
+    "Type": "Coding",
+    "Name": "Linked List Node",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/Helper/LinkedListNode",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 5,
+    "Type": "Coding",
+    "Name": "Tree Node",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/Helper/TreeNode",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 6,
+    "Type": "Coding",
+    "Name": "Trie",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/Helper/Trie",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 7,
+    "Type": "Coding",
+    "Name": "Trie Node",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/Helper/TrieNode",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 8,
+    "Type": "Coding",
+    "Name": "ArrayList",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q0_Introduction/ArrayList",
+    "Companies": [],
+    "Categories": [
+      "Books",
+      "Known Data Structures"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 9,
+    "Type": "Coding",
+    "Name": "HashTable",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q0_Introduction/HashTable",
+    "Companies": [],
+    "Categories": [
+      "Books",
+      "Known Data Structures"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 10,
+    "Type": "Coding",
+    "Name": "StringBuilder",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q0_Introduction/StringBuilder",
+    "Companies": [],
+    "Categories": [
+      "Books",
+      "Known Data Structures"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 11,
+    "Type": "Coding",
+    "Name": "Q1 Is Unique",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q1_IsUnique",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays",
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 12,
+    "Type": "Coding",
+    "Name": "Q2 Check Permutation",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q2_CheckPermutation",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays",
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 13,
+    "Type": "Coding",
+    "Name": "Q3 URLify",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q3_URLify",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays",
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 14,
+    "Type": "Coding",
+    "Name": "Q4 Palindrome Permutation",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q4_PalindromePermutation",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays",
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 15,
+    "Type": "Coding",
+    "Name": "Linked List",
+    "Origin": "Cracking the Coding Interview",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch02_LinkedLists",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Linked Lists"
+    ],
+    "Languages": [
+      "Python"
+    ]
+  },
+  {
+    "Id": 16,
+    "Type": "Coding",
+    "Name": "1. Two Sum",
+    "Origin": "Daily Coding Problem",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyCodingProblem/src/P1_P100/P1_TwoSum",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 17,
+    "Type": "Coding",
+    "Name": "2. Product of Array Except Self",
+    "Origin": "Daily Coding Problem",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyCodingProblem/src/P1_P100/P2_ProductOfArrayExceptSelf",
+    "Companies": [
+      "Uber"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 18,
+    "Type": "Coding",
+    "Name": "3. Serialize and Deserialize Binary Tree",
+    "Origin": "Daily Coding Problem",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyCodingProblem/src/P1_P100/P3_SerializeAndDeserializeBinaryTree",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Tree",
+      "Design"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 19,
+    "Type": "Coding",
+    "Name": "4. First Missing Positive",
+    "Origin": "Daily Coding Problem",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyCodingProblem/src/P1_P100/P4_FirstMissingPositive",
+    "Companies": [
+      "Stripe"
+    ],
+    "Categories": [
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 20,
+    "Type": "Coding",
+    "Name": "5. First and Last Element of Pair",
+    "Origin": "Daily Coding Problem",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyCodingProblem/src/P1_P100/P5_FirstAndLastElementOfPair",
+    "Companies": [
+      "Jane Street"
+    ],
+    "Categories": [
+      "Difficulty -> Easy"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 21,
+    "Type": "Coding",
+    "Name": "205. Next Permutation Of Integer In Absolute Order",
+    "Origin": "Daily Coding Problem",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyCodingProblem/src/P201_300/P205_NextPermutationOfIntegerInAbsoluteOrder",
+    "Companies": [
+      "IBM"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 22,
+    "Type": "Coding",
+    "Name": "1. Add two numbers as a linked list",
+    "Origin": "Daily Interview Pro",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyInterviewPro/src/P1_P100/P1_AddTwoNumbersAsALinkedList",
+    "Companies": [
+      "Microsoft"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 23,
+    "Type": "Coding",
+    "Name": "2. Longest Substring Without Repeating Characters",
+    "Origin": "Daily Interview Pro",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyInterviewPro/src/P1_P100/P2_LongestSubstringWithoutRepeatingCharacters",
+    "Companies": [
+      "Microsoft"
+    ],
+    "Categories": [
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Arrays",
+      "Sliding Window"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 24,
+    "Type": "Coding",
+    "Name": "3. Longest Palindromic Substring",
+    "Origin": "Daily Interview Pro",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyInterviewPro/src/P1_P100/P3_LongestPalindromicSubstring",
+    "Companies": [
+      "Twitter"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 25,
+    "Type": "Coding",
+    "Name": "4. Validate Balanced Parentheses",
+    "Origin": "Daily Interview Pro",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyInterviewPro/src/P1_P100/P4_ValidateBalancedParentheses",
+    "Companies": [
+      "Uber"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 26,
+    "Type": "Course",
+    "Name": "Grokking the Coding Interview: Patterns for Coding Questions",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions"
+    ],
+    "Tags": [],
+    "Languages": ""
+  },
+  {
+    "Id": 27,
+    "Type": "Coding",
+    "Name": "Maximum Sum Subarray of Size K",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P1_MaximumSumSubarrayOfSizeK",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Sliding Window"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java",
+      "Python"
+    ]
+  },
+  {
+    "Id": 28,
+    "Type": "Coding",
+    "Name": "Smallest Subarray with a given sum",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P2_SmallestSubarrayWithAGivenSum",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Sliding Window"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java",
+      "Python"
+    ]
+  },
+  {
+    "Id": 29,
+    "Type": "Coding",
+    "Name": "Longest Substring with K Distinct Character",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P3_LongestSubstringWithKDistinctCharacters",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Sliding Window"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 30,
+    "Type": "Coding",
+    "Name": "Fruits into Baskets",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P4_FruitsIntoBaskets",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Sliding Window"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 31,
+    "Type": "Coding",
+    "Name": "No-repeat Substring",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P5_NoRepeatSubstring",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Sliding Window"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 32,
+    "Type": "Coding",
+    "Name": "Longest Substring with Same Letters after Replacement",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P6_LongestSubstringWithSameLettersAfterReplacement",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Sliding Window"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 33,
+    "Type": "Coding",
+    "Name": "Longest Subarray with Ones after Replacement",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P7_LongestSubarrayWithOnesAfterReplacement",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Sliding Window"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 34,
+    "Type": "Coding",
+    "Name": "Permutation in a String",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/PC1_PermutationInAString",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Sliding Window"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 35,
+    "Type": "Coding",
+    "Name": "String Anagrams",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/PC2_StringAnagrams",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Sliding Window"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 36,
+    "Type": "Coding",
+    "Name": "Smallest Window containing Substring",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/PC3_SmallestWindowContainingSubstring",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Sliding Window"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 37,
+    "Type": "Coding",
+    "Name": "Words Concatenation",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/PC4_WordsConcatenation",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Sliding Window"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 38,
+    "Type": "Coding",
+    "Name": "Average of Subarray of Size K",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/_Introduction_P0_AverageOfSubarrayOfSizeK",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Sliding Window"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java",
+      "Python"
+    ]
+  },
+  {
+    "Id": 39,
+    "Type": "Coding",
+    "Name": "Pair with Target Sum",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P1_PairWithTargetSum",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays",
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 40,
+    "Type": "Coding",
+    "Name": "Remove Duplicates",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P2_RemoveDuplicates",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 41,
+    "Type": "Coding",
+    "Name": "Remove All Instances of K",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P2_RemoveDuplicates/Variants/P1_RemoveAllInstancesOfK",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 42,
+    "Type": "Coding",
+    "Name": "Squaring a Sorted Array",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P3_SquaringASortedArray",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 43,
+    "Type": "Coding",
+    "Name": "Triplet Sum to Zero",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P4_TripletSumToZero",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 44,
+    "Type": "Coding",
+    "Name": "Triplet Sum Close to Target",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P5_TripleSumCloseToTarget",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 45,
+    "Type": "Coding",
+    "Name": "Triplets with Smaller Sum",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P6_TripletsWithSmallerSum",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 46,
+    "Type": "Coding",
+    "Name": "Return Triplets with Smaller Sum",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P6_TripletsWithSmallerSum/_Variants/P1_ReturnTripletsWithSmallerSum",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 47,
+    "Type": "Coding",
+    "Name": "Subarrays with Product Less than a Target",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P7_SubarraysWithProductLessThanATarget",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 48,
+    "Type": "Coding",
+    "Name": "Dutch National Flag Problem",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P8_DutchNationalFlagProblem",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 49,
+    "Type": "Coding",
+    "Name": "Quadruple Sum to Target",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/PC1_QuadrupleSumToTarget",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 50,
+    "Type": "Coding",
+    "Name": "Comparing Strings containing Backspaces",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/PC2_ComparingStringsContainingBackspaces",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 51,
+    "Type": "Coding",
+    "Name": "Minimum Window Sort",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/PC3_MinimumWindowSort",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 52,
+    "Type": "Coding",
+    "Name": "Maximum Trapping Water",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/PC4_MaximumTrappingWater",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Two Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 53,
+    "Type": "Coding",
+    "Name": "LinkedList Cycle",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/P1_LinkedListCycle",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Fast and Slow Pointers"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 54,
+    "Type": "Coding",
+    "Name": "Length of Linked List Cycle",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/P1_LinkedListCycle/_Variants/P1_LengthOfLinkedListCycle",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Fast and Slow Pointers"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 55,
+    "Type": "Coding",
+    "Name": "Start of LinkedList Cycle",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/P2_StartOfLinkedListCycle",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Fast and Slow Pointers"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 56,
+    "Type": "Coding",
+    "Name": "Happy Number",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/P3_HappyNumber",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Fast and Slow Pointers"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 57,
+    "Type": "Coding",
+    "Name": "Middle of the LinkedList",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/P4_MiddleOfTheLinkedList",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Fast and Slow Pointers"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 58,
+    "Type": "Coding",
+    "Name": "Palindrome LinkedList",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/PC1_PalindromeLinkedList",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Fast and Slow Pointers"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 59,
+    "Type": "Coding",
+    "Name": "Rearrange a LinkedList",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/PC2_RearrangeALinkedList",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Fast and Slow Pointers"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 60,
+    "Type": "Coding",
+    "Name": "Cycle in a Circular Array",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/PC3_CycleInACircularArray",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Fast and Slow Pointers"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 61,
+    "Type": "Coding",
+    "Name": "Merge Intervals",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/P1_MergeIntervals",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Merge Intervals"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 62,
+    "Type": "Coding",
+    "Name": "Find If Intervals Overlap",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/P1_MergeIntervals/_Variants/FindIfIntervalsOverlap",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Merge Intervals"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 63,
+    "Type": "Coding",
+    "Name": "Insert Interval",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/P2_InsertInterval",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Merge Intervals"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 64,
+    "Type": "Coding",
+    "Name": "Intervals Intersection",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/P3_IntervalsIntersection",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Merge Intervals"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 65,
+    "Type": "Coding",
+    "Name": "Conflicting Appointments",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/P4_ConflictingAppointments",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Merge Intervals"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 66,
+    "Type": "Coding",
+    "Name": "Find All Conflicting Appointments",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/P4_ConflictingAppointments/_Variants/P1_FindAllConflictingAppointments",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Merge Intervals"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 67,
+    "Type": "Coding",
+    "Name": "Minimum Meeting Rooms",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/PC1_MinimumMeetingRooms",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Merge Intervals"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 68,
+    "Type": "Coding",
+    "Name": "Maximum Number Of Intervals Overlap Point",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/PC1_MinimumMeetingRooms/_Variants/P1_MaximumNumberOfIntervalsOverlapPoint",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Merge Intervals"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 69,
+    "Type": "Coding",
+    "Name": "Minimum Number of Platforms for Train Station",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/PC1_MinimumMeetingRooms/_Variants/P2_MinimumNumberOfPlatformsForTrainStation",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Merge Intervals"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 70,
+    "Type": "Coding",
+    "Name": "Maximum CPU Load",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/PC2_MaximumCpuLoad",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Merge Intervals"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 71,
+    "Type": "Coding",
+    "Name": "Employee Free Time",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/PC3_EmployeeFreeTime",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Merge Intervals"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 72,
+    "Type": "Coding",
+    "Name": "Cyclic Sort",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/P1_CyclicSort",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Cyclic Sort"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 73,
+    "Type": "Coding",
+    "Name": "Find the Missing Number",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/P2_FindTheMissingNumber",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Cyclic Sort"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 74,
+    "Type": "Coding",
+    "Name": "Find all Missing Numbers",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/P3_FindAllMissingNumbers",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Cyclic Sort"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 75,
+    "Type": "Coding",
+    "Name": "Find the Duplicate Number",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/P4_FindTheDuplicateNumber",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Cyclic Sort"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 76,
+    "Type": "Coding",
+    "Name": "Find all Duplicate Numbers",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/P5_FindAllDuplicateNumbers",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Cyclic Sort"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 77,
+    "Type": "Coding",
+    "Name": "Find the Corrupt Pair",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/PC1_FindTheCorruptPair",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Cyclic Sort"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 78,
+    "Type": "Coding",
+    "Name": "Find the Smallest Missing Positive Number",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/PC2_FindTheSmallestMissingPositiveNumber",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Cyclic Sort"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 79,
+    "Type": "Coding",
+    "Name": "Find the First K Missing Positive Numbers",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/PC3_FindTheFirstKMissingPositiveNumbers",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Cyclic Sort"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 80,
+    "Type": "Coding",
+    "Name": "Reverse a LinkedList",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/P1_ReverseALinkedList",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> In-place Reversal of a LinkedList"
+    ],
+    "Tags": [
+      "LinkedList"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 81,
+    "Type": "Coding",
+    "Name": "Reverse a Sub-list",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/P2_ReverseASubList",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> In-place Reversal of a LinkedList"
+    ],
+    "Tags": [
+      "LinkedList"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 82,
+    "Type": "Coding",
+    "Name": "Reverse First K Elements of a LinkedList",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/P2_ReverseASubList/_Variants/P1_ReverseFirstKElementsOfLinkedList",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> In-place Reversal of a LinkedList"
+    ],
+    "Tags": [
+      "LinkedList"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 83,
+    "Type": "Coding",
+    "Name": "Reverse LinkedList based on Even or Odd Size",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/P2_ReverseASubList/_Variants/P2_ReverseLinkedListEvenOddSize",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> In-place Reversal of a LinkedList"
+    ],
+    "Tags": [
+      "LinkedList"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 84,
+    "Type": "Coding",
+    "Name": "Reverse every K-element Sub-list",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/P3_ReverseEveryKElementSubList",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> In-place Reversal of a LinkedList"
+    ],
+    "Tags": [
+      "LinkedList"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 85,
+    "Type": "Coding",
+    "Name": "Reverse alternating K-element Sub-list",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/PC1_ReverseAlternatingKElementSubList",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> In-place Reversal of a LinkedList"
+    ],
+    "Tags": [
+      "LinkedList"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 86,
+    "Type": "Coding",
+    "Name": "Rotate a LinkedList",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/PC2_RotateALinkedList",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> In-place Reversal of a LinkedList"
+    ],
+    "Tags": [
+      "LinkedList"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 87,
+    "Type": "Coding",
+    "Name": "Binary Tree Level Order Traversal",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P1_BinaryTreeLevelOrderTraversal",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Tree Breadth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Breadth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 88,
+    "Type": "Coding",
+    "Name": "Reverse Level Order Traversal",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P2_ReverseLevelOrderTraversal",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Tree Breadth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Breadth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 89,
+    "Type": "Coding",
+    "Name": "Zigzag Traversal",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P3_ZigzagTraversal",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Tree Breadth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Breadth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 90,
+    "Type": "Coding",
+    "Name": "Level Averages in a Binary Tree",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P4_LevelAveragesInABinaryTree",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Tree Breadth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Breadth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 91,
+    "Type": "Coding",
+    "Name": "Largest Value on Each Level of a Binary Tree",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P4_LevelAveragesInABinaryTree/_Variants/P1_LargestValueOnEachLevelOfABinaryTree",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Tree Breadth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Breadth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 92,
+    "Type": "Coding",
+    "Name": "Minimum Depth of a Binary Tree",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P5_MinimumDepthOfABinaryTree",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Tree Breadth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Breadth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 93,
+    "Type": "Coding",
+    "Name": "Maximum Depth of a Binary Tree",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P5_MinimumDepthOfABinaryTree/_Variants/P1_MaximumDepthOfABinaryTree",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Tree Breadth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Breadth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 94,
+    "Type": "Coding",
+    "Name": "Level Order Successor",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P6_LevelOrderSuccessor",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Tree Breadth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Breadth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 95,
+    "Type": "Coding",
+    "Name": "Connect Level Order Siblings",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P7_ConnectLevelOrderSiblings",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Tree Breadth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Breadth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 96,
+    "Type": "Coding",
+    "Name": "Connect All Level Order Siblings",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/PC1_ConnectAllLevelOrderSiblings",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Tree Breadth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Breadth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 97,
+    "Type": "Coding",
+    "Name": "Right View of a Binary Tree",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/PC2_RightViewOfABinaryTree",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Tree Breadth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Breadth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 98,
+    "Type": "Coding",
+    "Name": "Left View of a Binary Tree",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/PC2_RightViewOfABinaryTree/_Variants/P1_LeftViewOfABinaryTree",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Tree Breadth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Breadth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 99,
+    "Type": "Coding",
+    "Name": "Binary Tree Path Sum",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P1_BinaryTreePathSum",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Tree Depth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Depth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 100,
+    "Type": "Coding",
+    "Name": "All Paths for a Sum",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P2_AllPathsForASum",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Tree Depth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Depth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 101,
+    "Type": "Coding",
+    "Name": "All Root to Leaf Paths",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P2_AllPathsForASum/_Variants/P1_AllRootToLeafPaths",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Tree Depth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Depth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 102,
+    "Type": "Coding",
+    "Name": "Root to Leaf Path with Maximum Sum",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P2_AllPathsForASum/_Variants/P2_RootToLeafPathMaxSum",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Tree Depth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Depth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 103,
+    "Type": "Coding",
+    "Name": "Sum of Path Numbers",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P3_SumOfPathNumbers",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Tree Depth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Depth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 104,
+    "Type": "Coding",
+    "Name": "Path With Given Sequence",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P4_PathWithGivenSequence",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Tree Depth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Depth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 105,
+    "Type": "Coding",
+    "Name": "Count Paths for a Sum",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P5_CountPathsForASum",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Tree Depth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Depth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 106,
+    "Type": "Coding",
+    "Name": "Tree Diameter",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/PC1_TreeDiameter",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Tree Depth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Depth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 107,
+    "Type": "Coding",
+    "Name": "Path with Maximum Sum",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/PC2_PathWithMaximumSum",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Tree Depth First Search"
+    ],
+    "Tags": [
+      "Binary Tree",
+      "Depth First Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 108,
+    "Type": "Coding",
+    "Name": "Find the Median of a Number Stream",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch10_TwoHeaps/P1_FindTheMedianOfANumberStream",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Two Heaps"
+    ],
+    "Tags": [
+      "Two Heaps"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 109,
+    "Type": "Coding",
+    "Name": "Sliding Window Median",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch10_TwoHeaps/P2_SlidingWindowMedian",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Two Heaps"
+    ],
+    "Tags": [
+      "Two Heaps"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 110,
+    "Type": "Coding",
+    "Name": "Maximize Capital",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch10_TwoHeaps/P3_MaximizeCapital",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Two Heaps"
+    ],
+    "Tags": [
+      "Two Heaps"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 111,
+    "Type": "Coding",
+    "Name": "Next Interval",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch10_TwoHeaps/PC1_NextInterval",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Two Heaps"
+    ],
+    "Tags": [
+      "Two Heaps"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 112,
+    "Type": "Coding",
+    "Name": "Subsets",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/P1_Subsets",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Subsets"
+    ],
+    "Tags": [
+      "Subsets"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 113,
+    "Type": "Coding",
+    "Name": "Subsets With Duplicates",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/P2_SubsetsWithDuplicates",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Subsets"
+    ],
+    "Tags": [
+      "Subsets"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 114,
+    "Type": "Coding",
+    "Name": "Permutations",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/P3_Permutations",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Subsets"
+    ],
+    "Tags": [
+      "Subsets"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 115,
+    "Type": "Coding",
+    "Name": "String Permutations by changing case",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/P4_StringPermutationsByChangingCase",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Subsets"
+    ],
+    "Tags": [
+      "Subsets"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 116,
+    "Type": "Coding",
+    "Name": "Balanced Parentheses",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/P5_BalancedParentheses",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Subsets"
+    ],
+    "Tags": [
+      "Subsets"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 117,
+    "Type": "Coding",
+    "Name": "Unique Generalized Abbreviations",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/P6_UniqueGeneralizedAbbreviations",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Subsets"
+    ],
+    "Tags": [
+      "Subsets"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 118,
+    "Type": "Coding",
+    "Name": "Evaluate Expression",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/PC1_EvaluateExpression",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Subsets"
+    ],
+    "Tags": [
+      "Subsets"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 119,
+    "Type": "Coding",
+    "Name": "Structurally Unique Binary Search Trees",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/PC2_StructurallyUniqueBinarySearchTrees",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Subsets"
+    ],
+    "Tags": [
+      "Subsets"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 120,
+    "Type": "Coding",
+    "Name": "Count of Structurally Unique Binary Search Trees",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/PC3_CountOfStructurallyUniqueBinarySearchTrees",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Subsets"
+    ],
+    "Tags": [
+      "Subsets"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 121,
+    "Type": "Coding",
+    "Name": "Order-agnostic Binary Search",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P1_OrderAgnosticBinarySearch",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 122,
+    "Type": "Coding",
+    "Name": "Ceiling of a Number",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P2_CeilingOfANumber",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 123,
+    "Type": "Coding",
+    "Name": "Floor of a Number",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P2_CeilingOfANumber/_Variants/P1_FloorOfANumber",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 124,
+    "Type": "Coding",
+    "Name": "Next Letter",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P3_NextLetter",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 125,
+    "Type": "Coding",
+    "Name": "Number Range",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P4_NumberRange",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 126,
+    "Type": "Coding",
+    "Name": "Search in a Sorted Infinite Array",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P5_SearchInASortedInfiniteArray",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 127,
+    "Type": "Coding",
+    "Name": "Minimum Difference Element",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P6_MinimumDifferenceElement",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 128,
+    "Type": "Coding",
+    "Name": "Bitonic Array Maximum",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P7_BitonicArrayMaximum",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 129,
+    "Type": "Coding",
+    "Name": "Search Bitonic Array",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/PC1_SearchBitonicArray",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 130,
+    "Type": "Coding",
+    "Name": "Search in Rotated Array",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/PC2_SearchInRotatedArray",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 131,
+    "Type": "Coding",
+    "Name": "Search in Rotated Array with Duplicates",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/PC2_SearchInRotatedArray/_Variants/P1_SearchInRotatedArrayWithDuplicates",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 132,
+    "Type": "Coding",
+    "Name": "Rotation Count",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/PC3_RotationCount",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 133,
+    "Type": "Coding",
+    "Name": "Rotation Count with Duplicates",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/PC3_RotationCount/_Variants/P1_RotationCountWithDuplicates",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Modified Binary Search"
+    ],
+    "Tags": [
+      "Modified Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 134,
+    "Type": "Coding",
+    "Name": "Sum of Elements",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P10_SumOfElements",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 135,
+    "Type": "Coding",
+    "Name": "Rearrange String",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P11_RearrangeString",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 136,
+    "Type": "Coding",
+    "Name": "Top 'K' Numbers",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P1_TopKNumbers",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 137,
+    "Type": "Coding",
+    "Name": "Kth Smallest Number",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P2_KthSmallestNumber",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 138,
+    "Type": "Coding",
+    "Name": "'K' Closest Points to the Origin",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P3_KClosestPointsToTheOrigin",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 139,
+    "Type": "Coding",
+    "Name": "Connect Ropes",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P4_ConnectRopes",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Easy",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 140,
+    "Type": "Coding",
+    "Name": "Top 'K' Frequent Numbers",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P5_TopKFrequentNumbers",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 141,
+    "Type": "Coding",
+    "Name": "Frequency Sort",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P6_FrequencySort",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 142,
+    "Type": "Coding",
+    "Name": "Kth Largest Number in a Stream",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P7_KthLargestNumberInAStream",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 143,
+    "Type": "Coding",
+    "Name": "'K' Closest Numbers",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P8_KClosestNumbers",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 144,
+    "Type": "Coding",
+    "Name": "Maximum Distinct Elements",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P9_MaximumDistinctEKements",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 145,
+    "Type": "Coding",
+    "Name": "Rearrange String K Distance Apart",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/PC1_RearrangeStringKDistanceApart",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 146,
+    "Type": "Coding",
+    "Name": "Scheduling Tasks",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/PC2_SchedulingTasks",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 147,
+    "Type": "Coding",
+    "Name": "Frequency Stack",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/PC3_FrequencyStack",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> Top K Elements"
+    ],
+    "Tags": [
+      "Top K Elements"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 148,
+    "Type": "Coding",
+    "Name": "Merge K Sorted Lists",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/P1_MergeKSortedLists",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> K Way Merge"
+    ],
+    "Tags": [
+      "K Way Merge"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 149,
+    "Type": "Coding",
+    "Name": "Kth Smallest Number in M Sorted Lists",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/P2_KthSmallestNumberInMSortedLists",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> K Way Merge"
+    ],
+    "Tags": [
+      "K Way Merge"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 150,
+    "Type": "Coding",
+    "Name": "Median Among M Sorted Arrays",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/P2_KthSmallestNumberInMSortedLists/_Variants/P1_MedianAmongMSortedArrays",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> K Way Merge"
+    ],
+    "Tags": [
+      "K Way Merge"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 151,
+    "Type": "Coding",
+    "Name": "Merge K Sorted Arrays",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/P2_KthSmallestNumberInMSortedLists/_Variants/P2_MergeKSortedArrays",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> K Way Merge"
+    ],
+    "Tags": [
+      "K Way Merge"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 152,
+    "Type": "Coding",
+    "Name": "Kth Smallest Number in a Sorted Matrix",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/P3_KthSmallestNumberInASortedMatrix",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> K Way Merge"
+    ],
+    "Tags": [
+      "K Way Merge"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 153,
+    "Type": "Coding",
+    "Name": "Smallest Number Range",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/P4_SmallestNumberRange",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> K Way Merge"
+    ],
+    "Tags": [
+      "K Way Merge"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 154,
+    "Type": "Coding",
+    "Name": "K Pairs with Largest Sums",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/PC1_KPairsWithLargestSums",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Hard",
+      "Pattern -> K Way Merge"
+    ],
+    "Tags": [
+      "K Way Merge"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 155,
+    "Type": "Coding",
+    "Name": "0/1 Knapsack",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch16_01Knapsack_DynamicProgramming/P1_01Knapsack",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> 0/1 Knapsack (Dynamic Programming)"
+    ],
+    "Tags": [
+      "0/1 Knapsack",
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 156,
+    "Type": "Coding",
+    "Name": "Equal Subset Sum Partition",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch16_01Knapsack_DynamicProgramming/P2_EqualSubsetSumPartition",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the Coding Interview: Patterns for Coding Questions",
+      "Difficulty -> Medium",
+      "Pattern -> 0/1 Knapsack (Dynamic Programming)"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 157,
+    "Type": "Course",
+    "Name": "Grokking the System Design Interview",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 158,
+    "Type": "Systems Design",
+    "Name": "Designing an API Rate Limiter",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/ApiRateLimiter",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 159,
+    "Type": "Systems Design",
+    "Name": "Designing Dropbox",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/Dropbox",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 160,
+    "Type": "Systems Design",
+    "Name": "Designing Facebook Messenger",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/FacebookMessenger",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 161,
+    "Type": "Systems Design",
+    "Name": "Designing Facebook's Newsfeed",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/FacebookNewsfeed",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 162,
+    "Type": "Systems Design",
+    "Name": "Designing Instagram",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/Instagram",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 163,
+    "Type": "Systems Design",
+    "Name": "Designing Pastebin",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/Pastebin",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 164,
+    "Type": "Systems Design",
+    "Name": "Design Ticketmaster",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/Ticketmaster",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 165,
+    "Type": "Systems Design",
+    "Name": "Designing Twitter",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/Twitter",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 166,
+    "Type": "Systems Design",
+    "Name": "Designing Twitter Search",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/TwitterSearch",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 167,
+    "Type": "Systems Design",
+    "Name": "Designing Typeahead Suggestion",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/TypeaheadSuggestion",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 168,
+    "Type": "Systems Design",
+    "Name": "Designing a URL Shortening service like TinyURL",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/URLShorteningServiceLikeTinyURL",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 169,
+    "Type": "Systems Design",
+    "Name": "Designing Uber backend",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/UberBackend",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 170,
+    "Type": "Systems Design",
+    "Name": "Designing a Web Crawler",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/WebCrawler",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 171,
+    "Type": "Systems Design",
+    "Name": "Designing Yelp or Nearby Friends",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/YelpOrNearlyFriends",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 172,
+    "Type": "Systems Design",
+    "Name": "Designing Youtube or Netflix",
+    "Origin": "Educative",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/YoutubeOrNetflix",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Grokking the System Design Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 173,
+    "Type": "Coding",
+    "Name": "Q0 Boot Camp",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q0_BootCamp",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Primitive Types"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 174,
+    "Type": "Coding",
+    "Name": "Q1 Compute Parity Of Word",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q1_ComputeParityOfWord",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Primitive Types"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 175,
+    "Type": "Coding",
+    "Name": "Q2 Swap Bits",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q2_SwapBits",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Primitive Types"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 176,
+    "Type": "Coding",
+    "Name": "Q3 Reverse Bits",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q3_ReverseBits",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Primitive Types"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 177,
+    "Type": "Coding",
+    "Name": "Q4 Find Closest Int With Same Weight",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q4_FindClosestIntWithSameWeight",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Primitive Types"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 178,
+    "Type": "Coding",
+    "Name": "Q5 Multiply Without Arithmetical Operators",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q5_MultiplyWithoutArithmeticalOperators",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Primitive Types"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 179,
+    "Type": "Coding",
+    "Name": "Q6 Compute Division",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q6_ComputeDivision",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Primitive Types"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 180,
+    "Type": "Coding",
+    "Name": "Q7 Compute Power",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q7_ComputePower",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Primitive Types"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 181,
+    "Type": "Coding",
+    "Name": "Q8 Reverse Digits",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q8_ReverseDigits",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Primitive Types"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 182,
+    "Type": "Coding",
+    "Name": "Q9 Decimal Integer Palindrome Check",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q9_DecimalIntegerPalindromeCheck",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Primitive Types"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 183,
+    "Type": "Coding",
+    "Name": "Computing An Alternation",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/ComputingAnAlternation",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 184,
+    "Type": "Coding",
+    "Name": "Q0 Boot Camp",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q0_BootCamp",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java",
+      "Python"
+    ]
+  },
+  {
+    "Id": 185,
+    "Type": "Coding",
+    "Name": "Q10 Compute The Next Permutation",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q10_ComputeTheNextPermutation",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 186,
+    "Type": "Coding",
+    "Name": "Previous Permutation",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q10_ComputeTheNextPermutation/Variants/PreviousPermutation",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 187,
+    "Type": "Coding",
+    "Name": "kth Permutation",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q10_ComputeTheNextPermutation/Variants/kthPermutation",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 188,
+    "Type": "Coding",
+    "Name": "Q11 Sample Offline Data",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q11_SampleOfflineData",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 189,
+    "Type": "Coding",
+    "Name": "Q12 Sample Online Data",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q12_SampleOnlineData",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 190,
+    "Type": "Coding",
+    "Name": "Q13 Compute Random Permutation",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q13_ComputeRandomPermutation",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 191,
+    "Type": "Coding",
+    "Name": "Q14 Compute Random Subset",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q14_ComputeRandomSubset",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 192,
+    "Type": "Coding",
+    "Name": "Q1 Dutch National Flag",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q1_DutchNationalFlag",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 193,
+    "Type": "Coding",
+    "Name": "Q2 Increment An Arbitrary Precision Integer",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q2_IncrementAnArbitraryPrecisionInteger",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 194,
+    "Type": "Coding",
+    "Name": "Q3 Multiply Two Arbitrary Precision Integers",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q3_MultiplyTwoArbitraryPrecisionIntegers",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 195,
+    "Type": "Coding",
+    "Name": "Q4 Advancing Through An Array",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q4_AdvancingThroughAnArray",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 196,
+    "Type": "Coding",
+    "Name": "Min Number Of Steps",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q4_AdvancingThroughAnArray/Variants/MinNumberOfSteps",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 197,
+    "Type": "Coding",
+    "Name": "Q5 Delete Duplicates From Sorted Array",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q5_DeleteDuplicatesFromSortedArray",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 198,
+    "Type": "Coding",
+    "Name": "Limit Duplicates",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q5_DeleteDuplicatesFromSortedArray/Variants/LimitDuplicates",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 199,
+    "Type": "Coding",
+    "Name": "Q6 Buy And Sell Stock Once",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q6_BuyAndSellStockOnce",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 200,
+    "Type": "Coding",
+    "Name": "Q7 Buy And Sell Stock Twice",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q7_BuyAndSellStockTwice",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 201,
+    "Type": "Coding",
+    "Name": "Q8 Enumerate All Primes To N",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q8_EnumerateAllPrimesToN",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 202,
+    "Type": "Coding",
+    "Name": "Q9 Permute Elements Of Array",
+    "Origin": "Elements of Programming Interviews",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q9_PermuteElementsOfArray",
+    "Companies": [],
+    "Categories": [
+      "Books"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 203,
+    "Type": "Coding",
+    "Name": "Binary Search On Array Of Integers",
+    "Origin": "Firecode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Firecode/src/Problems/Level1/BinarySearchOnArrayOfIntegers",
+    "Companies": [
+      "Oracle"
+    ],
+    "Categories": [
+      "Level1"
+    ],
+    "Tags": [
+      "Strings",
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 204,
+    "Type": "Coding",
+    "Name": "Find the First Non Duplicate Character in a String",
+    "Origin": "Firecode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Firecode/src/Problems/Level1/FindFirstNonDuplicateCharacterInAString",
+    "Companies": [
+      "Oracle"
+    ],
+    "Categories": [
+      "Level1"
+    ],
+    "Tags": [
+      "Strings",
+      "Hash Tables"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 205,
+    "Type": "Coding",
+    "Name": "Flip It",
+    "Origin": "Firecode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Firecode/src/Problems/Level1/FlipIt",
+    "Companies": [
+      "Infosys"
+    ],
+    "Categories": [
+      "Level1"
+    ],
+    "Tags": [
+      "Arrays",
+      "Multi Dimensional Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 206,
+    "Type": "Coding",
+    "Name": "Palindrome Tester",
+    "Origin": "Firecode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Firecode/src/Problems/Level1/PalindromeTester",
+    "Companies": [],
+    "Categories": [
+      "Level1"
+    ],
+    "Tags": [
+      "Strings",
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 207,
+    "Type": "Coding",
+    "Name": "Repeated Elements In An Array",
+    "Origin": "Firecode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Firecode/src/Problems/Level1/RepeatedElementsInAnArray",
+    "Companies": [
+      "Bloomberg"
+    ],
+    "Categories": [
+      "Level1"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 208,
+    "Type": "Coding",
+    "Name": "Reverse A String",
+    "Origin": "Firecode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Firecode/src/Problems/Level1/ReverseAString",
+    "Companies": [
+      "Microsoft"
+    ],
+    "Categories": [
+      "Level1"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 209,
+    "Type": "Coding",
+    "Name": "Binary Tree",
+    "Origin": "GitHub Repository",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/BillRyan/src/AlgorithmExercise/Part1_Basics/BasicDataStructure/BinaryTree",
+    "Companies": [],
+    "Categories": [
+      "GitHub -> billryan - yuanbin -> Algorithm Exercise"
+    ],
+    "Tags": [
+      "Binary Tree"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 210,
+    "Type": "Coding",
+    "Name": "Linked List",
+    "Origin": "GitHub Repository",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/BillRyan/src/AlgorithmExercise/Part1_Basics/BasicDataStructure/LinkedList",
+    "Companies": [],
+    "Categories": [
+      "GitHub -> billryan - yuanbin -> Algorithm Exercise"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 211,
+    "Type": "Reading",
+    "Name": "System Design Interview",
+    "Origin": "GitHub Repository",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview",
+    "Companies": [],
+    "Categories": [
+      "GitHub -> checkcheckzz -> System Design Interview"
+    ],
+    "Tags": [
+      "Distributed Systems Design",
+      "Object Oriented Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 212,
+    "Type": "Reading",
+    "Name": "Fallacies of Distributed Systems",
+    "Origin": "Notes - Article",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/FallaciesOfDistributedSystems",
+    "Companies": [],
+    "Categories": [
+      "GitHub -> checkcheckzz -> System Design Interview",
+      "Articles",
+      "Authors -> Arnon Rotem-Gal-Oz"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 213,
+    "Type": "Reading",
+    "Name": "How to Ace a Systems Design Interview",
+    "Origin": "Notes - Blog Post",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/HowToRockASystemsDesignInterview",
+    "Companies": [],
+    "Categories": [
+      "GitHub -> checkcheckzz -> System Design Interview",
+      "Blogs -> Palantir Blog"
+    ],
+    "Tags": [],
+    "Languages": ""
+  },
+  {
+    "Id": 214,
+    "Type": "Reading",
+    "Name": "Introduction to architecting systems for scale",
+    "Origin": "Notes - Blog Post",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/IntroductionToArchitectingSystemsForScale",
+    "Companies": [],
+    "Categories": [
+      "GitHub -> checkcheckzz -> System Design Interview",
+      "Blogs -> Irrational Exuberance!",
+      "Authors -> Will Larson"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 215,
+    "Type": "Reading",
+    "Name": "Numbers Everyone Should Know",
+    "Origin": "Notes - Blog Post",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/NumbersEveryoneShouldKnow",
+    "Companies": [],
+    "Categories": [
+      "GitHub -> checkcheckzz -> System Design Interview",
+      "Blogs -> Everything is Data",
+      "Authors -> Neil Conway"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 216,
+    "Type": "Reading",
+    "Name": "Scalability for Dummies",
+    "Origin": "Notes - Blog Post",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/ScalabilityForDummies",
+    "Companies": [],
+    "Categories": [
+      "GitHub -> checkcheckzz -> System Design Interview",
+      "Blogs -> Le Cloud Blog",
+      "Authors -> Sebastian Kreutzberger"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 217,
+    "Type": "Reading",
+    "Name": "Scalable System Design Patterns",
+    "Origin": "Notes - Blog Post",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/ScalableSystemDesignPatterns",
+    "Companies": [],
+    "Categories": [
+      "GitHub -> checkcheckzz -> System Design Interview",
+      "Blogs -> Pragmatic Programming Techniques",
+      "Authors -> Ricky Ho"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 218,
+    "Type": "Reading",
+    "Name": "Scalable Web Architecture and Distributed Systems",
+    "Origin": "Notes - Book Chapter",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/ScalableWebArchitectureAndDistributedSystems",
+    "Companies": [],
+    "Categories": [
+      "GitHub -> checkcheckzz -> System Design Interview",
+      "Books -> The Architecture of Open Source Applications, Volume II",
+      "Authors -> Kate Matsudaira"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 219,
+    "Type": "Coding",
+    "Name": "Number Of Strings From Encoded Alphabet",
+    "Origin": "Glassdoor",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Glassdoor/src/Facebook/NumberOfStringsFromEncodedAlphabet",
+    "Companies": [
+      "Facebook"
+    ],
+    "Categories": [],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Python"
+    ]
+  },
+  {
+    "Id": 220,
+    "Type": "Coding",
+    "Name": "HackerRank In A String",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Contests/RookieRank2/HackerRankInAString",
+    "Companies": [],
+    "Categories": [
+      "Contests -> RookieRank 2"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 221,
+    "Type": "Coding",
+    "Name": "KnightL On A Chessboard",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Contests/RookieRank2/KnightLOnAChessboard",
+    "Companies": [],
+    "Categories": [
+      "Contests -> RookieRank 2"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 222,
+    "Type": "Coding",
+    "Name": "Migratory Birds",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Contests/RookieRank2/MigratoryBirds",
+    "Companies": [],
+    "Categories": [
+      "Contests -> RookieRank 2"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 223,
+    "Type": "Coding",
+    "Name": "Minimum Absolute Difference In An Array",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Contests/RookieRank2/MinimumAbsoluteDifferenceInAnArray",
+    "Companies": [],
+    "Categories": [
+      "Contests -> RookieRank 2"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 224,
+    "Type": "Coding",
+    "Name": "Dam Design",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Miscellaneous/DamDesign",
+    "Companies": [],
+    "Categories": [
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Python"
+    ]
+  },
+  {
+    "Id": 225,
+    "Type": "Coding",
+    "Name": "Divisible Sum Pairs",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Implementation/DivisibleSumPairs",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Algorithms -> Implementation",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 226,
+    "Type": "Coding",
+    "Name": "A Very Big Sum",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/AVeryBigSum",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Algorithms -> Warmup"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 227,
+    "Type": "Coding",
+    "Name": "Circular Array Rotation",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/CircularArrayRotation",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Algorithms -> Warmup"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 228,
+    "Type": "Coding",
+    "Name": "Compare The Triplets",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/CompareTheTriplets",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Algorithms -> Warmup"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 229,
+    "Type": "Coding",
+    "Name": "Diagonal Difference",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/DiagonalDifference",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Algorithms -> Warmup"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 230,
+    "Type": "Coding",
+    "Name": "Plus Minus",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/PlusMinus",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Algorithms -> Warmup"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 231,
+    "Type": "Coding",
+    "Name": "Simple Array Sum",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/SimpleArraySum",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Algorithms -> Warmup"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 232,
+    "Type": "Coding",
+    "Name": "Solve Me First",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/SolveMeFirst",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Algorithms -> Warmup"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 233,
+    "Type": "Coding",
+    "Name": "Staircase",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/Staircase",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Algorithms -> Warmup"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 234,
+    "Type": "Coding",
+    "Name": "Time Conversion",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/TimeConversion",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Algorithms -> Warmup"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 235,
+    "Type": "Coding",
+    "Name": "Arrays_DS",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/DataStructures/Arrays/Arrays_DS",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Data Structures"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 236,
+    "Type": "Coding",
+    "Name": "2DArray_DS",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/DataStructures/Arrays/TwoDArray_DS",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Data Structures"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 237,
+    "Type": "Coding",
+    "Name": "Reverse A Linked List",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/DataStructures/LinkedLists/ReverseALinkedList",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Problem Solving -> Data Structures"
+    ],
+    "Tags": [
+      "Linked Lists"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 238,
+    "Type": "Coding",
+    "Name": "D0 Hello World",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D0_HelloWorld",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 239,
+    "Type": "Coding",
+    "Name": "D10 Binary Numbers",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D10_BinaryNumbers",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 240,
+    "Type": "Coding",
+    "Name": "D11 2D Arrays",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D11_2DArrays",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 241,
+    "Type": "Coding",
+    "Name": "D12 Inheritance",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D12_Inheritance",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 242,
+    "Type": "Coding",
+    "Name": "D13 Abstract Classes",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D13_AbstractClasses",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 243,
+    "Type": "Coding",
+    "Name": "D14 Scope",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D14_Scope",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 244,
+    "Type": "Coding",
+    "Name": "D15 Linked List",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D15_LinkedList",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 245,
+    "Type": "Coding",
+    "Name": "D16 Exceptions String To Integer",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D16_Exceptions_StringToInteger",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 246,
+    "Type": "Coding",
+    "Name": "D17 More Exceptions",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D17_MoreExceptions",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 247,
+    "Type": "Coding",
+    "Name": "D18 Queues And Stacks",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D18_QueuesAndStacks",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 248,
+    "Type": "Coding",
+    "Name": "D19 Interfaces",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D19_Interfaces",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 249,
+    "Type": "Coding",
+    "Name": "D1 Data Types",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D1_DataTypes",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 250,
+    "Type": "Coding",
+    "Name": "D20 Sorting",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D20_Sorting",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 251,
+    "Type": "Coding",
+    "Name": "D21 Generics",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D21_Generics",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 252,
+    "Type": "Coding",
+    "Name": "D22 Binary Search Trees",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D22_BinarySearchTrees",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 253,
+    "Type": "Coding",
+    "Name": "D23 BST Level Order Traversal",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D23_BSTLevelOrderTraversal",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 254,
+    "Type": "Coding",
+    "Name": "D24 More Linked Lists",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D24_MoreLinkedLists",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 255,
+    "Type": "Coding",
+    "Name": "D25 Running Time And Complexity",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D25_RunningTimeAndComplexity",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 256,
+    "Type": "Coding",
+    "Name": "D26 Nested Logic",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D26_NestedLogic",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 257,
+    "Type": "Coding",
+    "Name": "D27 Testing",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D27_Testing",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 258,
+    "Type": "Coding",
+    "Name": "D28 RegEx Patterns And Intro To Databases",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D28_RegExPatternsAndIntroToDatabases",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 259,
+    "Type": "Coding",
+    "Name": "D29 Bitwise AND",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D29_BitwiseAND",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 260,
+    "Type": "Coding",
+    "Name": "D2 Operators",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D2_Operators",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 261,
+    "Type": "Coding",
+    "Name": "D3 Intro To Conditional Statements",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D3_IntroToConditionalStatements",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 262,
+    "Type": "Coding",
+    "Name": "D4 Class Vs Instance",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D4_ClassVsInstance",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 263,
+    "Type": "Coding",
+    "Name": "D5 Loops",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D5_Loops",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 264,
+    "Type": "Coding",
+    "Name": "D6 Lets Review",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D6_LetsReview",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 265,
+    "Type": "Coding",
+    "Name": "D7 Arrays",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D7_Arrays",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 266,
+    "Type": "Coding",
+    "Name": "D8 Dictionaries And Maps",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D8_DictionariesAndMaps",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 267,
+    "Type": "Coding",
+    "Name": "D9 Recursion",
+    "Origin": "HackerRank",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D9_Recursion",
+    "Companies": [],
+    "Categories": [
+      "Tracks -> Tutorials -> Thirty Days of Code"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 268,
+    "Type": "Coding",
+    "Name": "amortized1",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/AmortizedComplexity/amortized1",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 269,
+    "Type": "Coding",
+    "Name": "choose4",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/BasicPrimer/choose4",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 270,
+    "Type": "Coding",
+    "Name": "loop_cmpl",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/BasicPrimer/loop_cmpl",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 271,
+    "Type": "Coding",
+    "Name": "nested_cmpl",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/BasicPrimer/nested_cmpl",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 272,
+    "Type": "Coding",
+    "Name": "nested_cmpl2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/BasicPrimer/nested_cmpl2",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 273,
+    "Type": "Coding",
+    "Name": "choose1",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/CompareFunctions/choose1",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 274,
+    "Type": "Coding",
+    "Name": "choose2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/CompareFunctions/choose2",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 275,
+    "Type": "Coding",
+    "Name": "choose3",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/CompareFunctions/choose3",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 276,
+    "Type": "Coding",
+    "Name": "rec_cmpl1",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/FunctionCallingItself/rec_cmpl1",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 277,
+    "Type": "Coding",
+    "Name": "rec_cmpl2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/FunctionCallingItself/rec_cmpl2",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 278,
+    "Type": "Coding",
+    "Name": "rec_cmpl3",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/FunctionCallingItself/rec_cmpl3",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 279,
+    "Type": "Coding",
+    "Name": "gcd_cmpl",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/Math/gcd_cmpl",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 280,
+    "Type": "Coding",
+    "Name": "loop_cmpl2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/Math/loop_cmpl2",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 281,
+    "Type": "Coding",
+    "Name": "nested_cmpl3",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/Math/nested_cmpl3",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 282,
+    "Type": "Coding",
+    "Name": "while_cmpl",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/Math/while_cmpl",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Time Complexity"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 283,
+    "Type": "Coding",
+    "Name": "Spiral Order Matrix 1",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Examples/SpiralOrderMatrix1",
+    "Companies": [
+      "Microsoft",
+      "JPMorgan",
+      "Amazon",
+      "Flipkart"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 284,
+    "Type": "Coding",
+    "Name": "Array Bug",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Primers/ArrayBug",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 285,
+    "Type": "Coding",
+    "Name": "Array 2D",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Primers/Array_2D",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 286,
+    "Type": "Coding",
+    "Name": "Array Impl 1",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Primers/Array_impl1",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 287,
+    "Type": "Coding",
+    "Name": "Largest Number",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/Arrangement/LargestNumber",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 288,
+    "Type": "Coding",
+    "Name": "Rotate Matrix",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/Arrangement/RotateMatrix",
+    "Companies": [
+      "Google",
+      "Facebook",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 289,
+    "Type": "Coding",
+    "Name": "Add One To Number",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/ArrayMath/AddOneToNumber",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 290,
+    "Type": "Coding",
+    "Name": "Min Steps In Infinite Grid",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/ArrayMath/MinStepsInInfiniteGrid",
+    "Companies": [
+      "Directi"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 291,
+    "Type": "Coding",
+    "Name": "Noble Integer",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/Bucketing/NobleInteger",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 292,
+    "Type": "Coding",
+    "Name": "Wave Array",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/BucketingOrSorting/WaveArray",
+    "Companies": [
+      "Google",
+      "Adobe"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 293,
+    "Type": "Coding",
+    "Name": "First Missing Integer",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/MissingOrRepeatedNumber/FirstMissingInteger",
+    "Companies": [
+      "Model N",
+      "InMobi"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 294,
+    "Type": "Coding",
+    "Name": "Max Non Negative SubArray",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/SimulationArray/MaxNonNegativeSubArray",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 295,
+    "Type": "Coding",
+    "Name": "Spiral Order Matrix 2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/SimulationArray/SpiralOrderMatrix2",
+    "Companies": [
+      "Microsoft",
+      "JPMorgan",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 296,
+    "Type": "Coding",
+    "Name": "Set Matrix Zeros",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/SpaceRecycle/SetMatrixZeros",
+    "Companies": [
+      "Oracle",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 297,
+    "Type": "Coding",
+    "Name": "Merge Intervals",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/ValueRanges/MergeIntervals",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 298,
+    "Type": "Coding",
+    "Name": "Bubble Sort",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/SortingAlgorithms/BubbleSort",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming",
+      "Known Algorithms"
+    ],
+    "Tags": [
+      "Arrays",
+      "Sorting"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 299,
+    "Type": "Coding",
+    "Name": "Insertion Sort",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/SortingAlgorithms/InsertionSort",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming",
+      "Known Algorithms"
+    ],
+    "Tags": [
+      "Arrays",
+      "Sorting"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 300,
+    "Type": "Coding",
+    "Name": "Merge Sort",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/SortingAlgorithms/MergeSort",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming",
+      "Known Algorithms"
+    ],
+    "Tags": [
+      "Arrays",
+      "Sorting"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 301,
+    "Type": "Coding",
+    "Name": "Quick Sort",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/SortingAlgorithms/QuickSort",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming",
+      "Known Algorithms"
+    ],
+    "Tags": [
+      "Arrays",
+      "Sorting"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 302,
+    "Type": "Coding",
+    "Name": "Selection Sort",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/SortingAlgorithms/SelectionSort",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming",
+      "Known Algorithms"
+    ],
+    "Tags": [
+      "Arrays",
+      "Sorting"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 303,
+    "Type": "Coding",
+    "Name": "All Factors",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Examples/AllFactors",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 304,
+    "Type": "Coding",
+    "Name": "Binary Representation",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Examples/BinaryRepresentation",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 305,
+    "Type": "Coding",
+    "Name": "Prime Numbers",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Examples/PrimeNumbers",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 306,
+    "Type": "Coding",
+    "Name": "Verify Prime",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Examples/VerifyPrime",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 307,
+    "Type": "Coding",
+    "Name": "Math Bug01",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Primers/Math_Bug01",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 308,
+    "Type": "Coding",
+    "Name": "Math Bug02",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Primers/Math_Bug02",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 309,
+    "Type": "Coding",
+    "Name": "Prime Sum",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/AdHoc/PrimeSum",
+    "Companies": [
+      "Epic Systems"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 310,
+    "Type": "Coding",
+    "Name": "Sum Of Pairwise Hamming Distance",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/AdHoc/SumOfPairwiseHammingDistance",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 311,
+    "Type": "Coding",
+    "Name": "Numbers Of Length N And Values Less Than K",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/ArrayDp/NumbersOfLengthNAndValuesLessThanK",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 312,
+    "Type": "Coding",
+    "Name": "Excel Column Title",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/BaseConversion/ExcelColumnTitle",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 313,
+    "Type": "Coding",
+    "Name": "Grid Unique Paths",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/Combinatorics/GridUniquePaths",
+    "Companies": [
+      "Google",
+      "Amazon",
+      "Microsoft",
+      "Adobe"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 314,
+    "Type": "Coding",
+    "Name": "Palindrome Integer",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/DigitOp/PalindromeInteger",
+    "Companies": [
+      "HCL"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 315,
+    "Type": "Coding",
+    "Name": "Reverse Integer",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/DigitOp/ReverseInteger",
+    "Companies": [
+      "HCL",
+      "Bloomberg"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 316,
+    "Type": "Coding",
+    "Name": "Rearrange Array",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/NumberEncoding/RearrangeArray",
+    "Companies": [
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 317,
+    "Type": "Coding",
+    "Name": "Greatest Common Divisor",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/NumberTheory/GreatestCommonDivisor",
+    "Companies": [
+      "Google",
+      "NetApp"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 318,
+    "Type": "Coding",
+    "Name": "Sorted Permutation Rank With Repeats",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/NumberTheory/SortedPermutationRankWithRepeats",
+    "Companies": [
+      "Housing",
+      "Zenefits"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 319,
+    "Type": "Coding",
+    "Name": "Trailing Zeros In Factorial",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/NumberTheory/TrailingZerosInFactorial",
+    "Companies": [
+      "Microsoft",
+      "Jabong",
+      "Zillow"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 320,
+    "Type": "Coding",
+    "Name": "Find Element Occurrence",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Examples/FindElementOccurrence",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 321,
+    "Type": "Coding",
+    "Name": "Rotated Array",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Examples/RotatedArray",
+    "Companies": [
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 322,
+    "Type": "Coding",
+    "Name": "Square Root Of Integer",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Problems/SearchAnswer/SquareRootOfInteger",
+    "Companies": [
+      "Facebook",
+      "Amazon",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 323,
+    "Type": "Coding",
+    "Name": "Implement Power Function",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Problems/SearchStepSimulation/ImplementPowerFunction",
+    "Companies": [
+      "Google",
+      "LinkedIn"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 324,
+    "Type": "Coding",
+    "Name": "Search For A Range",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Problems/SimpleBinarySearch/SearchForARange",
+    "Companies": [
+      "Google",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 325,
+    "Type": "Coding",
+    "Name": "Median Of Array",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Problems/SortModification/MedianOfArray",
+    "Companies": [
+      "Amazon",
+      "VMware",
+      "Google",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 326,
+    "Type": "Coding",
+    "Name": "Rotated Sorted Array Search",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Problems/SortModification/RotatedSortedArraySearch",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 327,
+    "Type": "Coding",
+    "Name": "Single Number 2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BitManipulation/Problems/BitArray/SingleNumber2",
+    "Companies": [
+      "Google",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Bit Manipulation"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 328,
+    "Type": "Coding",
+    "Name": "Different Bits Sum Pairwise",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BitManipulation/Problems/BitPlay/DifferentBitsSumPairwise",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Bit Manipulation"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 329,
+    "Type": "Coding",
+    "Name": "Min XOR Value",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BitManipulation/Problems/Bucketing/MinXorValue",
+    "Companies": [
+      "Booking.com"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Bit Manipulation"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 330,
+    "Type": "Coding",
+    "Name": "Justified Text",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/PrettyPrint/JustifiedText",
+    "Companies": [
+      "LinkedIn",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 331,
+    "Type": "Coding",
+    "Name": "Add Binary Strings",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringMath/AddBinaryStrings",
+    "Companies": [
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 332,
+    "Type": "Coding",
+    "Name": "Integer To Roman",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringMath/IntegerToRoman",
+    "Companies": [
+      "Amazon",
+      "Facebook",
+      "Microsoft",
+      "Twitter"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 333,
+    "Type": "Coding",
+    "Name": "Multiply Strings",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringMath/MultiplyStrings",
+    "Companies": [
+      "Microsoft",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 334,
+    "Type": "Coding",
+    "Name": "Roman To Integer",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringMath/RomanToInteger",
+    "Companies": [
+      "Amazon",
+      "Facebook",
+      "Microsoft",
+      "Twitter"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 335,
+    "Type": "Coding",
+    "Name": "Atoi",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringParsing/Atoi",
+    "Companies": [
+      "Adobe",
+      "Nvidia",
+      "Agilent Systems",
+      "Bloomberg",
+      "Amazon",
+      "Apple",
+      "Microsoft",
+      "Groupon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 336,
+    "Type": "Coding",
+    "Name": "Implement StrStr",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringSearch/ImplementStrStr",
+    "Companies": [
+      "Facebook",
+      "Amazon",
+      "Qualcomm",
+      "Wipro",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 337,
+    "Type": "Coding",
+    "Name": "Count And Say",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringSimulation/CountAndSay",
+    "Companies": [
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 338,
+    "Type": "Coding",
+    "Name": "Longest Common Prefix",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringSimulation/LongestCommonPrefix",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 339,
+    "Type": "Coding",
+    "Name": "Palindrome String",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringSimulation/PalindromeString",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 340,
+    "Type": "Coding",
+    "Name": "Longest Palindromic Substring",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringTricks/LongestPalindromicSubstring",
+    "Companies": [
+      "Amazon",
+      "Microsoft",
+      "Groupon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 341,
+    "Type": "Coding",
+    "Name": "Reverse The String",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/Words/ReverseTheString",
+    "Companies": [
+      "Qualcomm",
+      "Amazon",
+      "Microsoft",
+      "Cisco",
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 342,
+    "Type": "Coding",
+    "Name": "Remove Duplicates From Sorted Array",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_TwoPointers/Problems/InplaceUpdate/RemoveDuplicatesFromSortedArray",
+    "Companies": [
+      "United Healthgroup",
+      "Amazon",
+      "Google",
+      "Microsoft",
+      "Expedia"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 343,
+    "Type": "Coding",
+    "Name": "Intersection Of Sorted Arrays",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_TwoPointers/Problems/MultipleArrays/IntersectionOfSortedArrays",
+    "Companies": [
+      "Facebook",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 344,
+    "Type": "Coding",
+    "Name": "Three Sum",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_TwoPointers/Problems/Sorting/ThreeSum",
+    "Companies": [
+      "Facebook",
+      "Amazon",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 345,
+    "Type": "Coding",
+    "Name": "Container With Most Water",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_TwoPointers/Problems/Tricks/ContainerWithMostWater",
+    "Companies": [
+      "Facebook",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 346,
+    "Type": "Coding",
+    "Name": "Minimize The Absolute Difference",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_TwoPointers/Problems/TwoPointer/MinimizeAbsoluteDifference",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 347,
+    "Type": "Coding",
+    "Name": "Intersection of Linked Lists",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Examples/IntersectionOfLinkedLists",
+    "Companies": [
+      "Amazon",
+      "Microsoft",
+      "NetApp",
+      "Apache Design"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Linked Lists"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 348,
+    "Type": "Coding",
+    "Name": "Reverse Linked List",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Examples/ReverseLinkedList",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Linked Lists"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 349,
+    "Type": "Coding",
+    "Name": "Reverse Link List 2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Problems/List2Pointer/ReverseLinkList2",
+    "Companies": [
+      "Facebook",
+      "Microsoft",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Linked Lists"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 350,
+    "Type": "Coding",
+    "Name": "List Cycle",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Problems/ListCycle/ListCycle",
+    "Companies": [
+      "Amazon",
+      "Microsoft",
+      "NetApp"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Linked Lists"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 351,
+    "Type": "Coding",
+    "Name": "Add Two Numbers As Lists",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Problems/ListMath/AddTwoNumbersAsLists",
+    "Companies": [
+      "Amazon",
+      "Qualcomm",
+      "Microsoft",
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Linked Lists"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 352,
+    "Type": "Coding",
+    "Name": "Insertion Sort List",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Problems/ListSort/InsertionSortList",
+    "Companies": [
+      "Microsoft",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Linked Lists"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 353,
+    "Type": "Coding",
+    "Name": "Reorder List",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Problems/PointerMove/ReorderList",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Linked Lists"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 354,
+    "Type": "Coding",
+    "Name": "Generate All Parentheses",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_StacksAndQueues/Examples/GenerateAllParentheses",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Stacks",
+      "Queues"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 355,
+    "Type": "Coding",
+    "Name": "Reverse String",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_StacksAndQueues/Examples/ReverseString",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Stacks",
+      "Queues"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 356,
+    "Type": "Coding",
+    "Name": "Largest Rectangle In Histogram",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_StacksAndQueues/Problems/CleverStack/LargestRectangleInHistogram",
+    "Companies": [
+      "Google",
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Stacks",
+      "Queues"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 357,
+    "Type": "Coding",
+    "Name": "Min Stack",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_StacksAndQueues/Problems/MultipleStack/MinStack",
+    "Companies": [
+      "Yahoo",
+      "Amazon",
+      "Adobe"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Stacks",
+      "Queues"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 358,
+    "Type": "Coding",
+    "Name": "Evaluate Expression",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_StacksAndQueues/Problems/StackMath/EvaluateExpression",
+    "Companies": [
+      "Yahoo",
+      "Google",
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Stacks",
+      "Queues"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 359,
+    "Type": "Coding",
+    "Name": "Redundant Braces",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_StacksAndQueues/Problems/StackSimple/RedundantBraces",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Stacks",
+      "Queues"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 360,
+    "Type": "Coding",
+    "Name": "Modular Expression",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Examples/ModularExpression",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 361,
+    "Type": "Coding",
+    "Name": "Reverse Linked List Recursion",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Examples/ReverseLinkedListRecursion",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 362,
+    "Type": "Coding",
+    "Name": "Palindrome Partitioning",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Problems/BruteForceBuilder/PalindromePartitioning",
+    "Companies": [
+      "Amazon",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 363,
+    "Type": "Coding",
+    "Name": "NQueens",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Problems/GameSolving/NQueens",
+    "Companies": [
+      "Qualcomm",
+      "Google",
+      "Amazon",
+      "Splunk"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 364,
+    "Type": "Coding",
+    "Name": "Kth Permutation Sequence",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Problems/MathsAndBacktracking/KthPermutationSequence",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 365,
+    "Type": "Coding",
+    "Name": "Permutations",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Problems/Permutations/Permutations",
+    "Companies": [
+      "Microsoft",
+      "Adobe",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 366,
+    "Type": "Coding",
+    "Name": "Generated All Parentheses 2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Problems/PrunedBuilder/GenerateAllParentheses2",
+    "Companies": [
+      "Facebook",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 367,
+    "Type": "Coding",
+    "Name": "Combination Sum",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Problems/Subsets/CombinationSum",
+    "Companies": [
+      "Facebook",
+      "Amazon",
+      "Adobe"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 368,
+    "Type": "Coding",
+    "Name": "Four Sum",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Hashing/Problems/HashSearch/FourSum",
+    "Companies": [
+      "Amazon",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Hashing"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 369,
+    "Type": "Coding",
+    "Name": "Two Sum",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Hashing/Problems/HashSearch/TwoSum",
+    "Companies": [
+      "Facebook",
+      "Amazon",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Hashing"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 370,
+    "Type": "Coding",
+    "Name": "Window String",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Hashing/Problems/HashingTwoPointer/WindowString",
+    "Companies": [
+      "Google",
+      "Directi"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Hashing"
+    ],
+    "Languages": [
+      "Java",
+      "Python"
+    ]
+  },
+  {
+    "Id": 371,
+    "Type": "Coding",
+    "Name": "Substring Concatenation",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Hashing/Problems/IncrementalHash/SubstringConcatenation",
+    "Companies": [
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Hashing"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 372,
+    "Type": "Coding",
+    "Name": "Equal",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Hashing/Problems/KeyFormation/Equal",
+    "Companies": [
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Hashing"
+    ],
+    "Languages": [
+      "Java",
+      "Python"
+    ]
+  },
+  {
+    "Id": 373,
+    "Type": "Coding",
+    "Name": "Points On The Straight Line",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Hashing/Problems/MathsAndHashing/PointsOnTheStraightLine",
+    "Companies": [
+      "Google",
+      "Amazon",
+      "InMobi"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Hashing"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 374,
+    "Type": "Coding",
+    "Name": "Merge K Sorted Lists",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_HeapsAndMaps/Problems/Heap/MergeKSortedLists",
+    "Companies": [
+      "Flipkart",
+      "Amazon",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Heaps",
+      "Maps"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 375,
+    "Type": "Coding",
+    "Name": "LRU Cache",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_HeapsAndMaps/Problems/Heapmap/LruCache",
+    "Companies": [
+      "Adobe",
+      "Citigroup",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Heaps",
+      "Maps"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 376,
+    "Type": "Coding",
+    "Name": "Ways To Form Max Heap",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_HeapsAndMaps/Problems/Math/WaysToFormMaxHeap",
+    "Companies": [
+      "Directi"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Heaps",
+      "Maps"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 377,
+    "Type": "Coding",
+    "Name": "Next Greater Number Bst",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Examples/NextGreaterNumberBst",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 378,
+    "Type": "Coding",
+    "Name": "Valid Binary Search Tree",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Examples/ValidBinarySearchTree",
+    "Companies": [
+      "Amazon",
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 379,
+    "Type": "Coding",
+    "Name": "BST Iterator",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/BstTraversal/BstIterator",
+    "Companies": [
+      "Apple",
+      "Amazon",
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 380,
+    "Type": "Coding",
+    "Name": "Kth Smallest Element In Tree",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/BstTraversal/KthSmallestElementInTree",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 381,
+    "Type": "Coding",
+    "Name": "Recover Binary Search Tree",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/BstTraversal/RecoverBinarySearchTree",
+    "Companies": [
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 382,
+    "Type": "Coding",
+    "Name": "Two Sum Binary Tree",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/BstTraversal/TwoSumBinaryTree",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 383,
+    "Type": "Coding",
+    "Name": "Invert The Binary Tree",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/InPlaceChange/InvertTheBinaryTree",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 384,
+    "Type": "Coding",
+    "Name": "Order of People Heights",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/IntervalTree/OrderOfPeopleHeights",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 385,
+    "Type": "Coding",
+    "Name": "ZigZag Level Order Traversal BT",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/LevelOrder/ZigZagLevelOrderTraversalBt",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 386,
+    "Type": "Coding",
+    "Name": "Flatten Binary Tree To LinkedList",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/LinkedListTree/FlattenBinaryTreeToLinkedList",
+    "Companies": [
+      "Adobe",
+      "Amazon",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 387,
+    "Type": "Coding",
+    "Name": "Root to Leaf Paths With Sum",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/RootToLeaf/RootToLeafPathsWithSum",
+    "Companies": [
+      "Microsoft",
+      "Yahoo",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 388,
+    "Type": "Coding",
+    "Name": "Balanced Binary Tree",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/SimpleTreeOps/BalancedBinaryTree",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 389,
+    "Type": "Coding",
+    "Name": "InOrder Traversal",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/Traversal/InOrderTraversal",
+    "Companies": [
+      "Amazon",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 390,
+    "Type": "Coding",
+    "Name": "PostOrder Traversal",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/Traversal/PostOrderTraversal",
+    "Companies": [
+      "Amazon",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 391,
+    "Type": "Coding",
+    "Name": "PreOrder Traversal",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/Traversal/PreOrderTraversal",
+    "Companies": [
+      "Amazon",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 392,
+    "Type": "Coding",
+    "Name": "Vertical Order Traversal Of Binary Tree",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/Traversal/VerticalOrderTraversalOfBinaryTree",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 393,
+    "Type": "Coding",
+    "Name": "Binary Tree From InOrder And PostOrder",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/TreeConstruction/BinaryTreeFromInorderAndPostorder",
+    "Companies": [
+      "Amazon",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 394,
+    "Type": "Coding",
+    "Name": "Construct Binary Tree From InOrder And PreOrder",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/TreeConstruction/ConstructBinaryTreeFromInorderAndPreorder",
+    "Companies": [
+      "Amazon",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 395,
+    "Type": "Coding",
+    "Name": "Sorted Array To Balanced Bst",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/TreeConstruction/SortedArrayToBalancedBst",
+    "Companies": [
+      "VMware",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 396,
+    "Type": "Coding",
+    "Name": "Least Common Ancestor",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/TreeSearch/LeastCommonAncestor",
+    "Companies": [
+      "Facebook",
+      "Adobe",
+      "Microsoft",
+      "Amazon",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 397,
+    "Type": "Coding",
+    "Name": "Shortest Unique Prefix",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/Trie/ShortestUniquePrefix",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 398,
+    "Type": "Coding",
+    "Name": "Hotel Reviews",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/Tries/HotelReviews",
+    "Companies": [
+      "Booking.com"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 399,
+    "Type": "Coding",
+    "Name": "Identical Binary Trees",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/TwoTrees/IdenticalBinaryTrees",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 400,
+    "Type": "Coding",
+    "Name": "Symmetric Binary Tree",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/TwoTrees/SymmetricBinaryTree",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Trees"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 401,
+    "Type": "Coding",
+    "Name": "Best Time to Buy and Sell Stock 2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/AdHoc/BestTimeToBuyAndSellStock2",
+    "Companies": [
+      "Amazon",
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 402,
+    "Type": "Coding",
+    "Name": "Palindrome Partitioning 2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/BreakingWords/PalindromePartitioning2",
+    "Companies": [
+      "Amazon",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 403,
+    "Type": "Coding",
+    "Name": "Max Sum Without Adjacent Elements",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/DerivedDp/MaxSumWithoutAdjacentElements",
+    "Companies": [
+      "Epic Systems"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 404,
+    "Type": "Coding",
+    "Name": "Word Break 2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/DpOptimizedBacktrack/WordBreak2",
+    "Companies": [
+      "IBM",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 405,
+    "Type": "Coding",
+    "Name": "Best Time to Buy and Sell Stocks 3",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/DpTricky/BestTimeToBuyAndSellStocks3",
+    "Companies": [
+      "Amazon",
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 406,
+    "Type": "Coding",
+    "Name": "Shortest Common SuperString",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/DpTricky/ShortestCommonSuperString",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 407,
+    "Type": "Coding",
+    "Name": "Min Jumps Array",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/GreedyOrDp/MinJumpsArray",
+    "Companies": [
+      "Amazon",
+      "eBay",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 408,
+    "Type": "Coding",
+    "Name": "Equal Average Partition",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/Knapsack/EqualAveragePartition",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 409,
+    "Type": "Coding",
+    "Name": "Unique Paths in a Grid",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/MatrixDp/UniquePathsInAGrid",
+    "Companies": [
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 410,
+    "Type": "Coding",
+    "Name": "Unique Binary Search Trees 2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/MultiplyDp/UniqueBinarySearchTrees2",
+    "Companies": [
+      "Amazon",
+      "Twitter",
+      "Samsung"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 411,
+    "Type": "Coding",
+    "Name": "Max Rectangle In Binary Matrix",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/PreProcessDp/MaxRectangleInBinaryMatrix",
+    "Companies": [
+      "Google",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 412,
+    "Type": "Coding",
+    "Name": "Length Of Longest Subsequence",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/SimpleArrayDp/LengthOfLongestSubsequence",
+    "Companies": [
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 413,
+    "Type": "Coding",
+    "Name": "Ways to Decode",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/SimpleArrayDp/WaysToDecode",
+    "Companies": [
+      "Facebook",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 414,
+    "Type": "Coding",
+    "Name": "Best Time to Buy and Sell Stocks 1",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/SuffixPrefixDp/BestTimeToBuyAndSellStocks1",
+    "Companies": [
+      "Amazon",
+      "Facebook"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 415,
+    "Type": "Coding",
+    "Name": "Max Sum Path In Binary Tree",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/TreeDp/MaxSumPathInBinaryTree",
+    "Companies": [
+      "Directi",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 416,
+    "Type": "Coding",
+    "Name": "Edit Distance",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/TwoDStringDp/EditDistance",
+    "Companies": [
+      "Google",
+      "LinkedIn",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 417,
+    "Type": "Coding",
+    "Name": "Assign Mice To Holes",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket1/AssignMiceToHoles",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Greedy"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 418,
+    "Type": "Coding",
+    "Name": "Distribute Candy",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket1/DistributeCandy",
+    "Companies": [
+      "Microsoft"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Greedy"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 419,
+    "Type": "Coding",
+    "Name": "Gas Station",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket2/GasStation",
+    "Companies": [
+      "Bloomberg",
+      "Google",
+      "DE Shaw",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Greedy"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 420,
+    "Type": "Coding",
+    "Name": "Majority Element",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket3/MajorityElement",
+    "Companies": [
+      "Microsoft",
+      "Yahoo",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Greedy"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 421,
+    "Type": "Coding",
+    "Name": "Seats",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket4/Seats",
+    "Companies": [
+      "Walmart Labs"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Greedy"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 422,
+    "Type": "Coding",
+    "Name": "Highest Product",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket5/HighestProduct",
+    "Companies": [
+      "Coursera",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Greedy"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 423,
+    "Type": "Coding",
+    "Name": "Bulbs",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket6/Bulbs",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Greedy"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 424,
+    "Type": "Coding",
+    "Name": "Level   Order",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/Bfs/LevelOrder",
+    "Companies": [
+      "Facebook",
+      "Groupon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Graphs"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 425,
+    "Type": "Coding",
+    "Name": "Largest Distance Between Nodes of a Tree",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/DepthFirstSearch/LargestDistanceBetweenNodesOfATree",
+    "Companies": [
+      "Facebook",
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Graphs"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 426,
+    "Type": "Coding",
+    "Name": "Convert Sorted List to Binary Search Tree",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/GraphAdHoc/ConvertSortedListToBinarySearchTree",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Graphs"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 427,
+    "Type": "Coding",
+    "Name": "Capture Regions On Board",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/GraphConnectivity/CaptureRegionsOnBoard",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Graphs"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 428,
+    "Type": "Coding",
+    "Name": "Clone Graph",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/GraphHashing/CloneGraph",
+    "Companies": [
+      "Google",
+      "Facebook",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Graphs"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 429,
+    "Type": "Coding",
+    "Name": "Word Search Board",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/GraphTraversal/WordSearchBoard",
+    "Companies": [
+      "Epic Systems",
+      "Amazon"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Graphs"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 430,
+    "Type": "Coding",
+    "Name": "Word Ladder 1",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/ShortestPath/WordLadder1",
+    "Companies": [
+      "Google",
+      "Microsoft",
+      "eBay"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Graphs"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 431,
+    "Type": "Coding",
+    "Name": "Word Ladder 2",
+    "Origin": "InterviewBit",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/ShortestPath/WordLadder2",
+    "Companies": [
+      "Google",
+      "Microsoft",
+      "eBay"
+    ],
+    "Categories": [
+      "Courses -> Programming"
+    ],
+    "Tags": [
+      "Graphs"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 432,
+    "Type": "Coding",
+    "Name": "29. Bracket Validator",
+    "Origin": "InterviewCake",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewCake/src/Questions/BracketValidator",
+    "Companies": [],
+    "Categories": [
+      "Questions"
+    ],
+    "Tags": [
+      "Stacks"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 433,
+    "Type": "Coding",
+    "Name": "25. Kth to Last Node in a Singly-Linked List",
+    "Origin": "InterviewCake",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewCake/src/Questions/KthToLastNodeInSinglyLinkedList",
+    "Companies": [],
+    "Categories": [
+      "Questions"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 434,
+    "Type": "Coding",
+    "Name": "43. Merge Sorted Arrays",
+    "Origin": "InterviewCake",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewCake/src/Questions/MergeSortedArrays",
+    "Companies": [],
+    "Categories": [
+      "Questions"
+    ],
+    "Tags": [
+      "Arrays"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 435,
+    "Type": "Coding",
+    "Name": "10. Second Largest Item In Bst",
+    "Origin": "InterviewCake",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewCake/src/Questions/SecondLargestItemInBst",
+    "Companies": [],
+    "Categories": [
+      "Questions"
+    ],
+    "Tags": [
+      "Binary Search Tree"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 436,
+    "Type": "Systems Design",
+    "Name": "Google Maps",
+    "Origin": "interviewing.io",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewingIo/src/SystemsDesign/GoogleMaps",
+    "Companies": [],
+    "Categories": [
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 437,
+    "Type": "Coding",
+    "Name": "Add Bold Tag in String",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/AddBoldTagInString",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 438,
+    "Type": "Coding",
+    "Name": "First Missing Positive",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/FirstMissingPositive",
+    "Companies": [
+      "Databricks",
+      "Google",
+      "Amazon",
+      "Adobe",
+      "Airbnb",
+      "Bloomberg",
+      "VMware",
+      "Pocket Gems",
+      "Alibaba",
+      "Facebook",
+      "Microsoft",
+      "Uber",
+      "Apple",
+      "Baidu"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 439,
+    "Type": "Coding",
+    "Name": "First Unique Character in a String",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/FirstUniqueCharacterInAString",
+    "Companies": [
+      "Amazon",
+      "Bloomberg",
+      "Facebook",
+      "Apple",
+      "Zillow",
+      "Goldman Sachs",
+      "Microsoft",
+      "Google",
+      "Yahoo",
+      "Airbnb",
+      "SAP",
+      "Alibaba",
+      "Oracle"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String",
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 440,
+    "Type": "Coding",
+    "Name": "Game of Life",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/GameOfLife",
+    "Companies": [
+      "Dropbox",
+      "Uber",
+      "Amazon",
+      "Google",
+      "Square",
+      "Microsoft",
+      "Bloomberg",
+      "Booking.com",
+      "Baidu",
+      "Apple",
+      "Snapchat",
+      "Two Sigma"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 441,
+    "Type": "Coding",
+    "Name": "Image Smoother",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ImageSmoother",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 442,
+    "Type": "Coding",
+    "Name": "Intersection of Two Arrays",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/IntersectionOfTwoArrays",
+    "Companies": [
+      "Facebook",
+      "Lyft",
+      "Amazon",
+      "LinkedIn",
+      "Yelp",
+      "Indeed",
+      "Oracle",
+      "Google",
+      "Microsoft",
+      "Apple",
+      "Bloomberg",
+      "Adobe",
+      "Tencent",
+      "Two Sigma"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Hash Table",
+      "Two Pointers",
+      "Binary Search",
+      "Sort"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 443,
+    "Type": "Coding",
+    "Name": "Longest Substring with At Most K Distinct Characters",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/LongestSubstringWithAtMostKDistinctCharacters",
+    "Companies": [
+      "Google",
+      "Facebook",
+      "Amazon",
+      "Quora",
+      "AppDynamics",
+      "Coupang"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Hash Table",
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 444,
+    "Type": "Coding",
+    "Name": "Max Consecutive Ones",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/MaxConsecutiveOnes",
+    "Companies": [
+      "Google",
+      "Amazon"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 445,
+    "Type": "Coding",
+    "Name": "Max Consecutive Ones II",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/MaxConsecutiveOnes2",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 446,
+    "Type": "Coding",
+    "Name": "Move Zeroes",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/MoveZeroes",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "SAP",
+      "Walmart Labs",
+      "Bloomberg",
+      "Microsoft",
+      "Apple",
+      "Uber",
+      "Paypal",
+      "Lyft",
+      "Yahoo",
+      "Oracle",
+      "eBay",
+      "Baidu"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 447,
+    "Type": "Coding",
+    "Name": "One Edit Distance",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/OneEditDistance",
+    "Companies": [
+      "Facebook",
+      "Uber",
+      "Microsoft",
+      "Yelp",
+      "Google",
+      "Twitter",
+      "Snapchat"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 448,
+    "Type": "Coding",
+    "Name": "Plus One",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/PlusOne",
+    "Companies": [
+      "Google",
+      "Facebook",
+      "Uber",
+      "Microsoft",
+      "Bloomberg",
+      "eBay",
+      "Adobe",
+      "Amazon",
+      "Airbnb"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 449,
+    "Type": "Coding",
+    "Name": "Read N Characters Given Read4",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ReadNCharactersGivenRead4",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Uber",
+      "Apple",
+      "Amazon"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 450,
+    "Type": "Coding",
+    "Name": "Read N Characters Given Read4 II - Call multiple times",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ReadNCharactersGivenRead4_2_CallMultipleTimes",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Lyft",
+      "Rubric",
+      "Uber",
+      "Pinterest",
+      "Microsoft",
+      "Bloomberg"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 451,
+    "Type": "Coding",
+    "Name": "Remove Duplicates from Sorted Array",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/RemoveDuplicatesFromSortedArray",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Microsoft",
+      "Uber",
+      "Amazon",
+      "Bloomberg",
+      "Cisco",
+      "Adobe",
+      "Yahoo",
+      "VMware",
+      "Walmart Labs",
+      "Tencent",
+      "Apple",
+      "Alibaba",
+      "Baidu",
+      "NetEase"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 452,
+    "Type": "Coding",
+    "Name": "Shortest Palindrome",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ShortestPalindrome",
+    "Companies": [
+      "Bloomberg",
+      "Two Sigma",
+      "Walmart Labs",
+      "Facebook",
+      "Adobe",
+      "Alibaba",
+      "Microsoft",
+      "Google",
+      "Pocket Gems"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 453,
+    "Type": "Coding",
+    "Name": "Spiral Matrix",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/SpiralMatrix",
+    "Companies": [
+      "Microsoft",
+      "Google",
+      "Bloomberg",
+      "Apple",
+      "Zillow",
+      "Amazon",
+      "Uber",
+      "Hulu",
+      "Paypal",
+      "Epic Systems",
+      "Yelp",
+      "eBay",
+      "Baidu",
+      "Adobe",
+      "Dataminr",
+      "JPMorgan",
+      "Facebook",
+      "Tencent",
+      "Walmart Labs",
+      "Yahoo",
+      "Redfin",
+      "ServiceNow",
+      "Oracle"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 454,
+    "Type": "Coding",
+    "Name": "Trapping Rain Water",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/TrappingRainWater",
+    "Companies": [
+      "Goldman Sachs",
+      "Facebook",
+      "Lyft",
+      "Amazon",
+      "Bloomberg",
+      "Google",
+      "Microsoft",
+      "Airbnb",
+      "Uber",
+      "Apple",
+      "Adobe",
+      "Dataminr",
+      "Grab",
+      "Qualtrics",
+      "Intuit",
+      "Snapchat",
+      "Wish",
+      "Alibaba",
+      "Twitter",
+      "eBay",
+      "Baidu",
+      "Zenefits",
+      "Intel",
+      "Palantir Technologies",
+      "TripAdvisor",
+      "Huawei"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Array",
+      "Two Pointers",
+      "Stack"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 455,
+    "Type": "Coding",
+    "Name": "Valid Number",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ValidNumber",
+    "Companies": [
+      "Facebook",
+      "LinkedIn",
+      "Apple",
+      "Zillow",
+      "Adobe",
+      "Google"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Math",
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 456,
+    "Type": "Coding",
+    "Name": "Valid Palindrome",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ValidPalindrome",
+    "Companies": [
+      "Facebook",
+      "Apple",
+      "Microsoft",
+      "Amazon",
+      "Google",
+      "Adobe",
+      "Yandex",
+      "TripAdvisor",
+      "Airbnb",
+      "Snapchat",
+      "Uber",
+      "Zenefits"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Two Pointers",
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 457,
+    "Type": "Coding",
+    "Name": "Valid Parentheses",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ValidParentheses",
+    "Companies": [
+      "Facebook",
+      "LinkedIn",
+      "Amazon",
+      "Bloomberg",
+      "Google",
+      "Microsoft",
+      "Twitter",
+      "Expedia",
+      "Uber",
+      "Akuna Capital",
+      "Apple",
+      "VMware",
+      "Paypal",
+      "Twilio",
+      "Mathworks",
+      "Samsung",
+      "Riot Games",
+      "Yandex",
+      "Lyft",
+      "Zillow",
+      "Alibaba",
+      "Cloudera",
+      "Adobe",
+      "Tencent",
+      "Blizzard",
+      "eBay",
+      "Baidu",
+      "Visa",
+      "Pure Storage",
+      "Indeed",
+      "TripleByte",
+      "ServiceNow",
+      "Yahoo",
+      "Capital One",
+      "Oracle",
+      "Huawei",
+      "Yelp",
+      "Zappos",
+      "Qualcomm",
+      "Gilt Groupe",
+      "Aetion",
+      "Yatra",
+      "Rubrik",
+      "Zynga",
+      "TripAdvisor",
+      "Booking.com",
+      "Lending Club",
+      "Zenefits"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String",
+      "Stack"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 458,
+    "Type": "Coding",
+    "Name": "Binary Search Tree Iterator",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Design/BinarySearchTreeIterator",
+    "Companies": [
+      "Facebook",
+      "Amazon",
+      "Microsoft",
+      "Bloomberg",
+      "Qualtrics",
+      "Cloudera",
+      "Uber",
+      "Google",
+      "Oracle",
+      "LinkedIn",
+      "Cisco",
+      "AppDynamics",
+      "Apple"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Stack",
+      "Tree",
+      "Design"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 459,
+    "Type": "Coding",
+    "Name": "Design Tic-Tac-Toe",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Design/DesignTicTacToe",
+    "Companies": [
+      "Microsoft",
+      "Amazon",
+      "Google",
+      "Facebook",
+      "Apple",
+      "TripleByte",
+      "Twitter"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Design"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 460,
+    "Type": "Coding",
+    "Name": "Moving Average from Data Stream",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Design/MovingAverageFromDataStream",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Bloomberg",
+      "Uber",
+      "Twitter",
+      "Amazon",
+      "Microsoft",
+      "Indeed"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Design",
+      "Queue"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 461,
+    "Type": "Coding",
+    "Name": "Peeking Iterator",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Design/PeekingIterator",
+    "Companies": [
+      "Apple",
+      "Amazon",
+      "Paypal",
+      "Google",
+      "Square",
+      "Microsoft",
+      "Morgan Stanley",
+      "Yahoo"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Design"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 462,
+    "Type": "Coding",
+    "Name": "Range Sum Query 2D - Mutable",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Design/RangeSumQuery2DMutable",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Microsoft",
+      "Houzz",
+      "Baidu"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 463,
+    "Type": "Coding",
+    "Name": "Zigzag Iterator",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Design/ZigzagIterator",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Apple",
+      "Groupon"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Design"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 464,
+    "Type": "Coding",
+    "Name": "Decode Ways",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/DecodeWays",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Microsoft",
+      "Uber",
+      "Amazon",
+      "Bloomberg",
+      "Yahoo",
+      "LiveRamp",
+      "Expedia",
+      "Salesforce",
+      "Twitter",
+      "Databricks",
+      "Square",
+      "Pinterest",
+      "Apple",
+      "Goldman Sachs"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "String",
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 465,
+    "Type": "Coding",
+    "Name": "Edit Distance",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/EditDistance",
+    "Companies": [
+      "Google",
+      "LinkedIn",
+      "Microsoft",
+      "Amazon",
+      "Bloomberg",
+      "Baidu",
+      "Yahoo",
+      "Apple",
+      "Alibaba",
+      "NetEase",
+      "Square",
+      "TripleByte",
+      "Cisco",
+      "Facebook",
+      "Snapchat",
+      "Adobe",
+      "Huawei",
+      "VMware"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "String",
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 466,
+    "Type": "Coding",
+    "Name": "House Robber II",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/HouseRobber2",
+    "Companies": [
+      "Google",
+      "Salesforce",
+      "Baidu",
+      "Adobe",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 467,
+    "Type": "Coding",
+    "Name": "Maximum Vacation Days",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/MaximumVacationDays",
+    "Companies": [
+      "Google",
+      "Facebook",
+      "Uber"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 468,
+    "Type": "Coding",
+    "Name": "Minimum Path Sum",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/MinimumPathSum",
+    "Companies": [
+      "Microsoft",
+      "Google",
+      "Amazon",
+      "Goldman Sachs",
+      "Bloomberg",
+      "Alibaba",
+      "Yelp"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array",
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 469,
+    "Type": "Coding",
+    "Name": "Sentence Screen Fitting",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/SentenceScreenFitting",
+    "Companies": [
+      "Google",
+      "Yelp"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 470,
+    "Type": "Coding",
+    "Name": "Word Break",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/WordBreak",
+    "Companies": [
+      "Facebook",
+      "Amazon",
+      "Google",
+      "Uber",
+      "Bloomberg",
+      "Yelp",
+      "Apple",
+      "Snapchat",
+      "Microsoft",
+      "Qualtrics",
+      "VMWare",
+      "Zillow",
+      "Oracle",
+      "Alibaba",
+      "Paypal",
+      "Yahoo",
+      "Twitter",
+      "Lyft",
+      "Adobe",
+      "Zenefits",
+      "Pinterest",
+      "eBay",
+      "Indeed",
+      "Pocket Gems",
+      "Square",
+      "Coupang"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 471,
+    "Type": "Coding",
+    "Name": "K Empty Slots",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/InterviewProcess/KEmptySlots",
+    "Companies": [
+      "Google",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Array",
+      "Binary Search Tree"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 472,
+    "Type": "Coding",
+    "Name": "License Key Formatting",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/InterviewProcess/LicenseKeyFormatting",
+    "Companies": [
+      "Google",
+      "Amazon"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 473,
+    "Type": "Coding",
+    "Name": "Longest Univalue Path",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/InterviewProcess/LongestUnivaluePath",
+    "Companies": [
+      "Google",
+      "Alibaba",
+      "Amazon"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Tree",
+      "Recursion"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 474,
+    "Type": "Coding",
+    "Name": "Next Closest Time",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/InterviewProcess/NextClosestTime",
+    "Companies": [
+      "Google",
+      "Facebook"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 475,
+    "Type": "Coding",
+    "Name": "Repeated String Match",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/InterviewProcess/RepeatedStringMatch",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 476,
+    "Type": "Coding",
+    "Name": "Insert into a Cyclic Sorted List",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/LinkedList/InsertIntoACyclicSortedList",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 477,
+    "Type": "Coding",
+    "Name": "Merge k Sorted Lists",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/LinkedList/MergeKSortedLists",
+    "Companies": [
+      "Microsoft",
+      "Amazon",
+      "LinkedIn",
+      "Google",
+      "Facebook",
+      "Uber",
+      "Twitter",
+      "Airbnb",
+      "IXL"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Linked List",
+      "Divide and Conquer",
+      "Heap"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 478,
+    "Type": "Coding",
+    "Name": "Maximum Product of Word Lengths",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Others/MaximumProductOfWordLengths",
+    "Companies": [
+      "Works Applications",
+      "Google"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Bit Manipulation"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 479,
+    "Type": "Coding",
+    "Name": "UTF-8 Validation",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Others/UTF8Validation",
+    "Companies": [
+      "Palantir Technologies",
+      "Google",
+      "Facebook",
+      "Apple",
+      "Uber",
+      "Nvidia"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Bit Manipulation"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 480,
+    "Type": "Coding",
+    "Name": "Android Unlock Patterns",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Recursion/AndroidUnlockPatterns",
+    "Companies": [
+      "Google",
+      "Snapchat",
+      "Microsoft",
+      "Apple"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Dynamic Programming",
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 481,
+    "Type": "Coding",
+    "Name": "Strobogrammatic Number II",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Recursion/StrobogrammaticNumber2",
+    "Companies": [
+      "Google",
+      "Facebook"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Math",
+      "Recursion"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 482,
+    "Type": "Coding",
+    "Name": "Word Search II",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Recursion/WordSearch2",
+    "Companies": [
+      "Amazon",
+      "Facebook",
+      "Google",
+      "Microsoft",
+      "Airbnb",
+      "Uber",
+      "Houzz",
+      "Snapchat",
+      "Yelp",
+      "Apple",
+      "Pocket Gems",
+      "Yahoo",
+      "Lyft"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Backtracking",
+      "Trie"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 483,
+    "Type": "Coding",
+    "Name": "Word Squares",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Recursion/WordSquares",
+    "Companies": [
+      "Oracle",
+      "Google"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Backtracking",
+      "Trie"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 484,
+    "Type": "Coding",
+    "Name": "Diagonal Traverse",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/DiagonalTraverse",
+    "Companies": [
+      "Google",
+      "Facebook",
+      "Bloomberg",
+      "Adobe",
+      "Amazon"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 485,
+    "Type": "Coding",
+    "Name": "Evaluate Reverse Polish Notation",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/EvaluateReversePolishNotation",
+    "Companies": [
+      "LinkedIn",
+      "Microsoft",
+      "Two Sigma",
+      "Google",
+      "Uber",
+      "Amazon",
+      "Pure Storage",
+      "Adobe",
+      "Yelp"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Stack"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 486,
+    "Type": "Coding",
+    "Name": "Find K Pairs with Smallest Sums",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/FindKPairsWithSmallestSums",
+    "Companies": [
+      "Amazon",
+      "Google",
+      "LinkedIn",
+      "Microsoft",
+      "Uber"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Heap"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 487,
+    "Type": "Coding",
+    "Name": "Find K-th Smallest Pair Distance",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/FindKthSmallestPairDistance",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Array",
+      "Binary Search",
+      "Heap"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 488,
+    "Type": "Coding",
+    "Name": "Insert Interval",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/InsertInterval",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Uber",
+      "Google",
+      "Microsoft",
+      "Amazon",
+      "Twitter",
+      "Tableau",
+      "Square",
+      "Lyft",
+      "Dropbox"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Array",
+      "Sort"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 489,
+    "Type": "Coding",
+    "Name": "Kth Largest Element in an Array",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/KthLargestElementInAnArray",
+    "Companies": [
+      "Facebook",
+      "Amazon",
+      "Google",
+      "Microsoft",
+      "Goldman Sachs",
+      "Apple",
+      "Baidu",
+      "Tencent",
+      "Nvidia",
+      "LinkedIn",
+      "Alibaba",
+      "Bloomberg",
+      "Airbnb",
+      "eBay",
+      "Twitter",
+      "IXL",
+      "Snapchat",
+      "Yelp",
+      "Yahoo",
+      "Pocket Gems"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Divide and Conquer",
+      "Heap"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 490,
+    "Type": "Coding",
+    "Name": "Longest Palindromic Substring",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/LongestPalindromicSubstring",
+    "Companies": [
+      "Amazon",
+      "Microsoft",
+      "Facebook",
+      "Google",
+      "Adobe",
+      "Apple",
+      "Yahoo",
+      "Alibaba",
+      "Airbnb",
+      "GoDaddy",
+      "Roblox",
+      "Baidu",
+      "Cisco",
+      "NetEase",
+      "IBM",
+      "JPMorgan",
+      "Yelp",
+      "eBay",
+      "Tencent",
+      "Uber",
+      "Bloomberg",
+      "Huawei",
+      "Twitter",
+      "Works Applications",
+      "Expedia",
+      "Lyft",
+      "Pure Storage",
+      "Sumologic",
+      "Zenefits",
+      "VMWare",
+      "VMWare",
+      "Goo",
+      "Qualtrics",
+      "Dropbox",
+      "Walmart Labs",
+      "Yandex",
+      "Paypal",
+      "Oracle",
+      "Salesforce"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "String",
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 491,
+    "Type": "Coding",
+    "Name": "Merge Intervals",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/MergeIntervals",
+    "Companies": [
+      "Palantir Technologies",
+      "Facebook",
+      "Google",
+      "Bloomberg",
+      "Uber",
+      "Microsoft",
+      "LinkedIn",
+      "Amazon",
+      "Apple",
+      "Oracle",
+      "Cisco",
+      "Yelp",
+      "Goldman Sachs",
+      "Twitter",
+      "Salesforce",
+      "Yahoo",
+      "Nvidia",
+      "Dataminr",
+      "Paypal",
+      "Intuit",
+      "Zenefits",
+      "Snapchat",
+      "GoDaddy",
+      "Dropbox",
+      "Pinterest",
+      "Walmart Labs",
+      "SAP"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array",
+      "Sort"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 492,
+    "Type": "Coding",
+    "Name": "Minimum Window Substring",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/MinimumWindowSubstring",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "LinkedIn",
+      "Amazon",
+      "Microsoft",
+      "Airbnb",
+      "Apple",
+      "Uber",
+      "Bloomberg",
+      "Walmart Labs",
+      "VMware",
+      "Alibaba",
+      "LiveRamp",
+      "Netsuite",
+      "Yahoo",
+      "Adobe",
+      "Snapchat"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Hash Table",
+      "Two Pointers",
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 493,
+    "Type": "Coding",
+    "Name": "Next Greater Element I",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/NextGreaterElement1",
+    "Companies": [
+      "Amazon",
+      "Bloomberg",
+      "Google",
+      "Mathworks",
+      "Adobe"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Stack"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 494,
+    "Type": "Coding",
+    "Name": "Pacific Atlantic Water Flow",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/PacificAtlanticWaterFlow",
+    "Companies": [
+      "Microsoft",
+      "Amazon",
+      "Oracle",
+      "Google",
+      "Uber",
+      "Expedia"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Depth-first Search",
+      "Breadth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 495,
+    "Type": "Coding",
+    "Name": "Range Module",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/RangeModule",
+    "Companies": [
+      "Google",
+      "Machine Zone",
+      "Coupang"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Array",
+      "Segment Tree",
+      "Binary Search Tree"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 496,
+    "Type": "Coding",
+    "Name": "Shortest Distance from All Buildings",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/ShortestDistanceFromAllBuildings",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Amazon",
+      "Zenefits"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Breadth-first search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 497,
+    "Type": "Coding",
+    "Name": "Sort Transformed Array",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/SortTransformedArray",
+    "Companies": [
+      "Google",
+      "Facebook"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Math",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 498,
+    "Type": "Coding",
+    "Name": "Sqrt(x)",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/SqrtOfX",
+    "Companies": [
+      "Google",
+      "LinkedIn",
+      "Microsoft",
+      "Bloomberg",
+      "Apple",
+      "Amazon",
+      "Facebook",
+      "Uber",
+      "Alibaba",
+      "Yahoo",
+      "Salesforce"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Math",
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 499,
+    "Type": "Coding",
+    "Name": "Closest Binary Search Tree Value",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/ClosestBinarySearchTreeValue",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Microsoft",
+      "Amazon",
+      "LinkedIn",
+      "eBay",
+      "Snapchat"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Binary Search",
+      "Tree"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 500,
+    "Type": "Coding",
+    "Name": "Course Schedule",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/CourseSchedule",
+    "Companies": [
+      "Amazon",
+      "Facebook",
+      "Google",
+      "Goldman Sachs",
+      "Yelp",
+      "Intuit",
+      "Paypal",
+      "Microsoft",
+      "Uber",
+      "Oracle",
+      "LinkedIn",
+      "Apple",
+      "Zenefits"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Depth-first Search",
+      "Breadth-first Search",
+      "Graph",
+      "Topological Sort"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 501,
+    "Type": "Coding",
+    "Name": "Evaluate Division",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/EvaluateDivision",
+    "Companies": [
+      "Google",
+      "Facebook",
+      "Uber"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Union Find",
+      "Graph"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 502,
+    "Type": "Coding",
+    "Name": "Inorder Successor in BST",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/InorderSuccessorInBst",
+    "Companies": [
+      "Google",
+      "Microsoft",
+      "Amazon",
+      "Facebook",
+      "Palantir Technologies",
+      "Arista Networks",
+      "Pocket Gems",
+      "Baidu"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Tree"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 503,
+    "Type": "Coding",
+    "Name": "Redundant Connection II",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/RedundantConnection2",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Tree",
+      "Depth-first Search",
+      "Union Find",
+      "Graph"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 504,
+    "Type": "Coding",
+    "Name": "Robot Room Cleaner",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/RobotRoomCleaner",
+    "Companies": [
+      "Google",
+      "Facebook",
+      "Amazon"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Depth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 505,
+    "Type": "Coding",
+    "Name": "Validate Binary Search Tree",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/ValidateBinarySearchTree",
+    "Companies": [
+      "Facebook",
+      "Bloomberg",
+      "Microsoft",
+      "Amazon",
+      "Google",
+      "Uber",
+      "Capital One",
+      "TripAdvisor",
+      "LinkedIn",
+      "Apple",
+      "Walmart Labs",
+      "Nvidia",
+      "Nutanix",
+      "Qualtrics",
+      "VMware",
+      "Square",
+      "Snapchat",
+      "Baidu"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Google Interview",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Tree",
+      "Depth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 506,
+    "Type": "Coding",
+    "Name": "Best Time to Buy and Sell Stock II",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/BestTimeToBuySellStock2",
+    "Companies": [
+      "Amazon",
+      "Facebook",
+      "Alibaba",
+      "Goldman Sachs",
+      "Adobe",
+      "Bloomberg",
+      "Microsoft",
+      "Intuit",
+      "Zappos",
+      "Google",
+      "Zenefits",
+      "Citadel",
+      "VMware",
+      "Baidu",
+      "Airbnb",
+      "Tencent",
+      "JPMorgan",
+      "Morgan Stanley",
+      "Oracle",
+      "Apple",
+      "LinkedIn",
+      "Palantir Technologies",
+      "Grab",
+      "Uber",
+      "Yahoo"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Greedy"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 507,
+    "Type": "Coding",
+    "Name": "Contains Duplicate",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/ContainsDuplicate",
+    "Companies": [
+      "Adobe",
+      "Microsoft",
+      "Google",
+      "Bloomberg",
+      "Amazon",
+      "Yahoo",
+      "Facebook",
+      "Baidu",
+      "Yelp",
+      "Airbnb",
+      "Palantir Technologies"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 508,
+    "Type": "Coding",
+    "Name": "Intersection of Two Arrays II",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/IntersectionOfTwoArrays2",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Oracle",
+      "Yelp",
+      "Bloomberg",
+      "Amazon",
+      "Alibaba"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Hash Table",
+      "Two Pointers",
+      "Binary Search",
+      "Sort"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 509,
+    "Type": "Coding",
+    "Name": "Move Zeroes",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/MoveZeroes",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "SAP",
+      "Walmart Labs",
+      "Bloomberg",
+      "Microsoft",
+      "Apple",
+      "eBay",
+      "Uber",
+      "Paypal",
+      "Baidu",
+      "Lyft",
+      "Amazon",
+      "Yahoo",
+      "Oracle"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 510,
+    "Type": "Coding",
+    "Name": "Plus One",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/PlusOne",
+    "Companies": [
+      "Google",
+      "Facebook",
+      "Uber",
+      "Microsoft",
+      "Bloomberg",
+      "eBay",
+      "Adobe",
+      "Amazon",
+      "Airbnb"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 511,
+    "Type": "Coding",
+    "Name": "Remove Duplicates from Sorted Array",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/RemoveDuplicatesFromSortedArray",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Microsoft",
+      "Amazon",
+      "Uber",
+      "Bloomberg",
+      "Cisco",
+      "Adobe",
+      "Yahoo",
+      "VMware",
+      "Walmart Labs",
+      "Apple",
+      "Alibaba",
+      "NetEase"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 512,
+    "Type": "Coding",
+    "Name": "Rotate Array",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/RotateArray",
+    "Companies": [
+      "Uber",
+      "Facebook",
+      "Amazon",
+      "Microsoft",
+      "Google",
+      "Oracle",
+      "Adobe",
+      "Bloomberg"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 513,
+    "Type": "Coding",
+    "Name": "Rotate Image",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/RotateImage",
+    "Companies": [
+      "Microsoft",
+      "Amazon",
+      "Apple",
+      "Google",
+      "Nvidia",
+      "Facebook",
+      "Akuna Capital",
+      "Houzz",
+      "ServiceNow",
+      "Baidu",
+      "Wish",
+      "Adobe",
+      "Bloomberg",
+      "Epic Systems",
+      "Salesforce",
+      "Paypal"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 514,
+    "Type": "Coding",
+    "Name": "Single Number",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/SingleNumber",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Adobe",
+      "SAP",
+      "Alibaba",
+      "Amazon",
+      "Microsoft",
+      "Oracle",
+      "Twitter",
+      "Zillow",
+      "Expedia",
+      "Airbnb",
+      "Baidu",
+      "Riot Games",
+      "Zappos",
+      "VMware",
+      "Palantir Technologies"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Hash Table",
+      "Bit Manipulation"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 515,
+    "Type": "Coding",
+    "Name": "Two Sum",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/TwoSum",
+    "Companies": [
+      "Google",
+      "Adobe",
+      "Amazon",
+      "Apple",
+      "Microsoft",
+      "Facebook",
+      "Uber",
+      "Yahoo",
+      "Alibaba",
+      "Bloomberg",
+      "LinkedIn",
+      "Baidu",
+      "Morgan Stanley",
+      "SAP",
+      "Airbnb",
+      "Yandex",
+      "Goldman Sachs",
+      "Aetion",
+      "Paypal",
+      "Visa",
+      "Indeed",
+      "GoDaddy",
+      "Affirm",
+      "Box",
+      "eBay",
+      "Cisco",
+      "Oracle",
+      "Works Applications",
+      "Radius",
+      "Snapchat",
+      "Tencent",
+      "Zenefits",
+      "Samsung",
+      "Valve",
+      "BlackRock",
+      "Lyft",
+      "IBM",
+      "Citrix",
+      "NetEase",
+      "Expedia",
+      "Twitter",
+      "Huawei",
+      "Mathworks",
+      "Two Sigma",
+      "Intuit",
+      "Hulu",
+      "Coursera",
+      "Yelp",
+      "MAQ Software",
+      "Helix",
+      "Walmart Labs",
+      "Grab",
+      "Zappos",
+      "Nvidia",
+      "Fallible",
+      "Zillow",
+      "Pinterest",
+      "TripAdvisor",
+      "Symantec",
+      "IXL",
+      "Zynga",
+      "Intel",
+      "HTC",
+      "Riot Games",
+      "AppDynamics",
+      "Quora",
+      "Alation",
+      "Gilt Groupe",
+      "JPMorgan",
+      "Epic Systems",
+      "Dropbox",
+      "VMware",
+      "Jump Trading",
+      "Sina",
+      "Lending Club",
+      "Salesforce",
+      "Wish",
+      "LiveRamp",
+      "Pocket Gems",
+      "Groupon",
+      "Tableau",
+      "Deutsche Bank",
+      "Capital One",
+      "ServiceNow",
+      "Jane Street",
+      "Akuna Capital",
+      "Redfin",
+      "Drawbridge",
+      "Booking.com",
+      "Blizzard"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 516,
+    "Type": "Coding",
+    "Name": "Valid Sudoku",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/ValidSudoku",
+    "Companies": [
+      "Uber",
+      "Microsoft",
+      "Facebook",
+      "Pinterest",
+      "Apple",
+      "Amazon",
+      "Google",
+      "Bloomberg",
+      "Snapchat"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array",
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 517,
+    "Type": "Coding",
+    "Name": "Best Time to Buy and Sell Stock",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/DynamicProgramming/BestTimeToBuyAndSellStock",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 518,
+    "Type": "Coding",
+    "Name": "Climbing Stairs",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/DynamicProgramming/ClimbingStairs",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 519,
+    "Type": "Coding",
+    "Name": "Maximum Subarray",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/DynamicProgramming/MaximumSubarray",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Divide and Conquer",
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 520,
+    "Type": "Coding",
+    "Name": "Delete Node in a Linked List",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/LinkedList/DeleteNodeInALinkedList",
+    "Companies": [
+      "Microsoft",
+      "Paypal",
+      "Apple",
+      "Amazon",
+      "VMware",
+      "Google",
+      "Adobe",
+      "Bloomberg",
+      "Capital One",
+      "NetEase",
+      "Tencent",
+      "Baidu"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 521,
+    "Type": "Coding",
+    "Name": "Linked List Cycle",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/LinkedList/LinkedListCycle",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Linked List",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 522,
+    "Type": "Coding",
+    "Name": "Merge Two Sorted Lists",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/LinkedList/MergeTwoSortedLists",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 523,
+    "Type": "Coding",
+    "Name": "Palindrome Linked List",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/LinkedList/PalindromeLinkedList",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Linked List",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 524,
+    "Type": "Coding",
+    "Name": "Remove Nth Node From End of List",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/LinkedList/RemoveNthNodeFromEndOfList",
+    "Companies": [
+      "Microsoft",
+      "Google",
+      "Adobe",
+      "Bloomberg",
+      "Apple",
+      "Cisco",
+      "Uber",
+      "Facebook",
+      "Aetion",
+      "Amazon",
+      "Baidu",
+      "Expedia",
+      "Zenefits",
+      "eBay",
+      "Alibaba",
+      "ServiceNow"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Linked List",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 525,
+    "Type": "Coding",
+    "Name": "Reverse Linked List",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/LinkedList/ReverseLinkedList",
+    "Companies": [
+      "Microsoft",
+      "Apple",
+      "Amazon",
+      "Facebook",
+      "Bloomberg",
+      "Yandex",
+      "Adobe",
+      "Mathworks",
+      "Google",
+      "Goldman Sachs",
+      "Cisco",
+      "Nvidia",
+      "VMware",
+      "Alibaba",
+      "Oracle",
+      "Baidu",
+      "Intuit",
+      "Intel",
+      "Paypal",
+      "Two Sigma",
+      "Tencent",
+      "Expedia",
+      "Yahoo",
+      "Walmart Labs",
+      "TripAdvisor",
+      "Qualcomm",
+      "Zynga",
+      "Zappos",
+      "Citrix",
+      "SAP",
+      "Nutanix",
+      "eBay",
+      "EMC",
+      "Snapchat",
+      "Zenefits",
+      "Yelp",
+      "Uber",
+      "Twitter"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 526,
+    "Type": "Coding",
+    "Name": "First Bad Version",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/SortingAndSearching/FirstBadVersion",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 527,
+    "Type": "Coding",
+    "Name": "Merge Sorted Array",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/SortingAndSearching/MergeSortedArray",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 528,
+    "Type": "Coding",
+    "Name": "Count and Say",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/CountAndSay",
+    "Companies": [
+      "Google",
+      "Microsoft",
+      "Amazon",
+      "Adobe",
+      "Bloomberg",
+      "Facebook",
+      "Apple",
+      "Intuit",
+      "eBay",
+      "Epic Systems",
+      "Airbnb",
+      "VMware",
+      "Salesforce"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 529,
+    "Type": "Coding",
+    "Name": "First Unique Character in a String",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/FirstUniqueCharacterInAString",
+    "Companies": [
+      "Bloomberg",
+      "Facebook",
+      "Amazon",
+      "Apple",
+      "Zillow",
+      "Goldman Sachs",
+      "Google",
+      "Microsoft",
+      "Yahoo",
+      "Airbnb",
+      "SAP",
+      "Alibaba",
+      "Oracle"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String",
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 530,
+    "Type": "Coding",
+    "Name": "Implement strStr()",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/ImplementStrStr",
+    "Companies": [
+      "Microsoft",
+      "Amazon",
+      "Facebook",
+      "Apple",
+      "Bloomberg",
+      "Adobe",
+      "Pocket Gems",
+      "Tencent",
+      "Alibaba",
+      "Yahoo",
+      "Google",
+      "Baidu",
+      "Salesforce",
+      "Zillow"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 531,
+    "Type": "Coding",
+    "Name": "Longest Common Prefix",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/LongestCommonPrefix",
+    "Companies": [
+      "Adobe",
+      "Facebook",
+      "Apple",
+      "Google",
+      "Quora",
+      "Yahoo",
+      "Oracle",
+      "Pinterest",
+      "Microsoft",
+      "IXL",
+      "Airbnb",
+      "Yelp",
+      "Citrix",
+      "Amazon",
+      "Aetion",
+      "Alibaba",
+      "Baidu",
+      "Tencent",
+      "Expedia",
+      "Samsung",
+      "Deutsche Bank",
+      "VMware",
+      "Huawei"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 532,
+    "Type": "Coding",
+    "Name": "Reverse Integer",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/ReverseInteger",
+    "Companies": [
+      "Adobe",
+      "Bloomberg",
+      "Google",
+      "Amazon",
+      "Microsoft",
+      "Apple",
+      "JPMorgan",
+      "Facebook",
+      "Yahoo",
+      "Lyft",
+      "NetEase",
+      "Alibaba",
+      "Aetion",
+      "Airbnb",
+      "Symantec",
+      "Baidu",
+      "Huawei",
+      "Oracle",
+      "Tencent",
+      "Twitter",
+      "LinkedIn",
+      "GoDaddy",
+      "eBay",
+      "VMware",
+      "Epic Systems",
+      "Pocket Gems",
+      "Quora",
+      "Works Applications",
+      "Zillow",
+      "HTC"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String",
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 533,
+    "Type": "Coding",
+    "Name": "Reverse String",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/ReverseString",
+    "Companies": [
+      "Microsoft",
+      "Apple",
+      "Bloomberg",
+      "Adobe",
+      "Google",
+      "GoDaddy",
+      "Walmart Labs",
+      "Alibaba",
+      "Goldman Sachs",
+      "Tencent",
+      "eBay",
+      "Amazon",
+      "Facebook",
+      "Baidu",
+      "LinkedIn",
+      "Airbnb",
+      "VMware",
+      "IBM",
+      "Cisco"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 534,
+    "Type": "Coding",
+    "Name": "String to Integer (atoi)",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/StringToIntegerAtoi",
+    "Companies": [
+      "Microsoft",
+      "Facebook",
+      "Goldman Sachs",
+      "Google",
+      "Amazon",
+      "Apple",
+      "Adobe",
+      "Cisco",
+      "Redfin",
+      "Zillow",
+      "LinkedIn",
+      "Bloomberg",
+      "Yahoo",
+      "Baidu",
+      "Alibaba",
+      "VMware",
+      "Citrix",
+      "eBay",
+      "Airbnb",
+      "Tencent",
+      "Huawei",
+      "Uber"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "String",
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 535,
+    "Type": "Coding",
+    "Name": "Valid Anagram",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/ValidAnagram",
+    "Companies": [
+      "Bloomberg",
+      "Google",
+      "Microsoft",
+      "Apple",
+      "Yahoo",
+      "Uber",
+      "Facebook",
+      "Amazon",
+      "Goldman Sachs",
+      "Paypal",
+      "VMware",
+      "Snapchat",
+      "Samsung",
+      "Oracle",
+      "Cisco",
+      "Yelp",
+      "LeetCode"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String",
+      "Hash Table",
+      "Sort"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 536,
+    "Type": "Coding",
+    "Name": "Valid Palindrome",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/ValidPalindrome",
+    "Companies": [
+      "Facebook",
+      "Microsoft",
+      "Amazon",
+      "Apple",
+      "Google",
+      "Adobe",
+      "Yandex",
+      "Airbnb",
+      "Snapchat",
+      "TripAdvisor",
+      "Uber",
+      "Zenefits"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 537,
+    "Type": "Coding",
+    "Name": "Binary Tree Level Order Traversal",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Trees/BinaryTreeLevelOrderTraversal",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Tree",
+      "Breadth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 538,
+    "Type": "Coding",
+    "Name": "Convert Sorted Array to Binary Search Tree",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Trees/ConvertSortedArrayToBinarySearchTree",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Tree",
+      "Depth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 539,
+    "Type": "Coding",
+    "Name": "Maximum Depth of Binary Tree",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Trees/MaximumDepthOfBinaryTree",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Tree",
+      "Depth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 540,
+    "Type": "Coding",
+    "Name": "Symmetric Tree",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Trees/SymmetricTree",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Tree",
+      "Depth-first Search",
+      "Breadth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 541,
+    "Type": "Coding",
+    "Name": "Validate Binary Search Tree",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Trees/ValidateBinarySearchTree",
+    "Companies": [],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Tree",
+      "Depth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 542,
+    "Type": "Coding",
+    "Name": "103. Binary Tree Zigzag Level Order Traversal",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P103_BinaryTreeZigzagLevelOrderTraversal",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Amazon",
+      "Google",
+      "Microsoft",
+      "Apple",
+      "Uber",
+      "Bloomberg",
+      "Apple",
+      "Tencent",
+      "eBay",
+      "Alibaba"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Stack",
+      "Tree",
+      "Breadth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 543,
+    "Type": "Coding",
+    "Name": "122. Best Time to Buy and Sell Stock II",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P122_BestTimeToBuySellStock2",
+    "Companies": [
+      "Amazon",
+      "Facebook",
+      "Alibaba",
+      "Goldman Sachs",
+      "Adobe",
+      "Bloomberg",
+      "Microsoft",
+      "Intuit",
+      "Zappos",
+      "Google",
+      "Zenefits",
+      "Citadel",
+      "VMware",
+      "Baidu",
+      "Airbnb",
+      "Tencent",
+      "JPMorgan",
+      "Morgan Stanley",
+      "Oracle",
+      "Apple",
+      "LinkedIn",
+      "Palantir Technologies",
+      "Grab",
+      "Uber",
+      "Yahoo"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Greedy"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 544,
+    "Type": "Coding",
+    "Name": "125. Valid Palindrome",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P125_ValidPalindrome",
+    "Companies": [
+      "Facebook",
+      "Microsoft",
+      "Amazon",
+      "Apple",
+      "Google",
+      "Adobe",
+      "Yandex",
+      "Airbnb",
+      "Snapchat",
+      "TripAdvisor",
+      "Uber",
+      "Zenefits"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 545,
+    "Type": "Coding",
+    "Name": "127. Word Ladder",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P127_WordLadder",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Amazon",
+      "Google",
+      "Microsoft",
+      "Twitter",
+      "Bloomberg",
+      "Lyft",
+      "Yelp",
+      "eBay",
+      "Hulu",
+      "Snapchat"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Breadth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 546,
+    "Type": "Coding",
+    "Name": "131. Palindrome Partitioning",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P131_PalindromePartitioning",
+    "Companies": [],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 547,
+    "Type": "Coding",
+    "Name": "136. Single Number",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P136_SingleNumber",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Adobe",
+      "SAP",
+      "Alibaba",
+      "Amazon",
+      "Microsoft",
+      "Oracle",
+      "Twitter",
+      "Zillow",
+      "Expedia",
+      "Airbnb",
+      "Baidu",
+      "Riot Games",
+      "Zappos",
+      "VMware",
+      "Palantir Technologies"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Hash Table",
+      "Bit Manipulation"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 548,
+    "Type": "Coding",
+    "Name": "149. Max Points on a Line",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P149_MaxPointsOnALine",
+    "Companies": [
+      "LinkedIn",
+      "Microsoft",
+      "Google",
+      "Amazon",
+      "Adobe",
+      "Alibaba",
+      "Twitter",
+      "Apple"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Hash Table",
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 549,
+    "Type": "Coding",
+    "Name": "150. Evaluate Reverse Polish Notation",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P150_EvaluateReversePolishNotation",
+    "Companies": [
+      "LinkedIn",
+      "Microsoft",
+      "Two Sigma",
+      "Google",
+      "Uber"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Stack"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 550,
+    "Type": "Coding",
+    "Name": "152. Maximum Product Subarray",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P152_MaximumProductSubarray",
+    "Companies": [
+      "LinkedIn",
+      "Microsoft",
+      "Yelp",
+      "Amazon",
+      "Google",
+      "Pocket Gems"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array",
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 551,
+    "Type": "Coding",
+    "Name": "156. Binary Tree Upside Down",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P156_BinaryTreeUpsideDown",
+    "Companies": [
+      "LinkedIn",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Tree"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 552,
+    "Type": "Coding",
+    "Name": "170. Two Sum III - Data structure design",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P170_TwoSum3_DataStructureDesign",
+    "Companies": [
+      "LinkedIn",
+      "Uber"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Hash Table",
+      "Design"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 553,
+    "Type": "Coding",
+    "Name": "173. Binary Search Tree Iterator",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P173_BinarySearchTreeIterator",
+    "Companies": [
+      "Facebook",
+      "Amazon",
+      "Microsoft",
+      "Bloomberg",
+      "Qualtrics",
+      "Cloudera",
+      "Uber",
+      "Google",
+      "Oracle",
+      "LinkedIn",
+      "Cisco",
+      "AppDynamics",
+      "Apple"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Stack",
+      "Tree",
+      "Design"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 554,
+    "Type": "Coding",
+    "Name": "187. Repeated DNA Sequences",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P187_RepeatedDnaSequences",
+    "Companies": [
+      "LinkedIn",
+      "Amazon"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Hash Table",
+      "Bit Manipulation"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 555,
+    "Type": "Coding",
+    "Name": "189. Rotate Array",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P189_RotateArray",
+    "Companies": [
+      "Uber",
+      "Facebook",
+      "Amazon",
+      "Microsoft",
+      "Google",
+      "Oracle",
+      "Adobe",
+      "Bloomberg"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 556,
+    "Type": "Coding",
+    "Name": "198. House Robber",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P198_HouseRobber",
+    "Companies": [
+      "LinkedIn",
+      "Airbnb",
+      "Tencent",
+      "Alibaba",
+      "Samsung",
+      "Baidu",
+      "Pocket Gems",
+      "Amazon",
+      "Google"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 557,
+    "Type": "Coding",
+    "Name": "200. Number of Islands",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P200_NumberOfIslands",
+    "Companies": [
+      "Amazon",
+      "Lyft",
+      "Google",
+      "Facebook",
+      "Bloomberg",
+      "Uber",
+      "LinkedIn",
+      "Microsoft",
+      "Apple",
+      "Qualtrics",
+      "Yahoo",
+      "Twitter",
+      "Alibaba",
+      "AppDynamics",
+      "Yelp",
+      "Oracle",
+      "eBay",
+      "Expedia",
+      "Goldman Sachs",
+      "Affirm"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Depth-first Search",
+      "Breadth-first Search",
+      "Union Find"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 558,
+    "Type": "Coding",
+    "Name": "10. Regular Expression Matching",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P10_RegularExpressionMatching",
+    "Companies": [
+      "Facebook",
+      "Microsoft",
+      "Google",
+      "Coursera",
+      "Bloomberg",
+      "Apple"
+    ],
+    "Categories": [
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "String",
+      "Dynamic Programming",
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 559,
+    "Type": "Coding",
+    "Name": "14. Longest Common Prefix",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P14_LongestCommonPrefix",
+    "Companies": [
+      "Adobe",
+      "Facebook",
+      "Apple",
+      "Google",
+      "Quora",
+      "Yahoo",
+      "Oracle",
+      "Pinterest",
+      "Microsoft",
+      "IXL",
+      "Airbnb",
+      "Yelp",
+      "Citrix",
+      "Amazon",
+      "Aetion",
+      "Alibaba",
+      "Baidu",
+      "Tencent",
+      "Expedia",
+      "Samsung",
+      "Deutsche Bank",
+      "VMware",
+      "Huawei"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 560,
+    "Type": "Coding",
+    "Name": "15. 3Sum",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P15_ThreeSum",
+    "Companies": [],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 561,
+    "Type": "Coding",
+    "Name": "18. 4Sum",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P18_FourSum",
+    "Companies": [
+      "Facebook"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array",
+      "Hash Table",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 562,
+    "Type": "Coding",
+    "Name": "19. Remove Nth Node From End of List",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P19_RemoveNthNodeFromEndOfList",
+    "Companies": [
+      "Microsoft",
+      "Google",
+      "Adobe",
+      "Bloomberg",
+      "Apple",
+      "Cisco",
+      "Uber",
+      "Facebook",
+      "Aetion",
+      "Amazon",
+      "Baidu",
+      "Expedia",
+      "Zenefits",
+      "eBay",
+      "Alibaba",
+      "ServiceNow"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Linked List",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 563,
+    "Type": "Coding",
+    "Name": "1. Two Sum",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P1_TwoSum",
+    "Companies": [
+      "Google",
+      "Adobe",
+      "Amazon",
+      "Apple",
+      "Microsoft",
+      "Facebook",
+      "Uber",
+      "Yahoo",
+      "Alibaba",
+      "Bloomberg",
+      "LinkedIn",
+      "Baidu",
+      "Morgan Stanley",
+      "SAP",
+      "Airbnb",
+      "Yandex",
+      "Goldman Sachs",
+      "Aetion",
+      "Paypal",
+      "Visa",
+      "Indeed",
+      "GoDaddy",
+      "Affirm",
+      "Box",
+      "eBay",
+      "Cisco",
+      "Oracle",
+      "Works Applications",
+      "Radius",
+      "Snapchat",
+      "Tencent",
+      "Zenefits",
+      "Samsung",
+      "Valve",
+      "BlackRock",
+      "Lyft",
+      "IBM",
+      "Citrix",
+      "NetEase",
+      "Expedia",
+      "Twitter",
+      "Huawei",
+      "Mathworks",
+      "Two Sigma",
+      "Intuit",
+      "Hulu",
+      "Coursera",
+      "Yelp",
+      "MAQ Software",
+      "Helix",
+      "Walmart Labs",
+      "Grab",
+      "Zappos",
+      "Nvidia",
+      "Fallible",
+      "Zillow",
+      "Pinterest",
+      "TripAdvisor",
+      "Symantec",
+      "IXL",
+      "Zynga",
+      "Intel",
+      "HTC",
+      "Riot Games",
+      "AppDynamics",
+      "Quora",
+      "Alation",
+      "Gilt Groupe",
+      "JPMorgan",
+      "Epic Systems",
+      "Dropbox",
+      "VMware",
+      "Jump Trading",
+      "Sina",
+      "Lending Club",
+      "Salesforce",
+      "Wish",
+      "LiveRamp",
+      "Pocket Gems",
+      "Groupon",
+      "Tableau",
+      "Deutsche Bank",
+      "Capital One",
+      "ServiceNow",
+      "Jane Street",
+      "Akuna Capital",
+      "Redfin",
+      "Drawbridge",
+      "Booking.com",
+      "Blizzard"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 564,
+    "Type": "Coding",
+    "Name": "21. Merge Two Sorted Lists",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P21_MergeTwoSortedLists",
+    "Companies": [
+      "Microsoft",
+      "Amazon",
+      "LinkedIn",
+      "Apple"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 565,
+    "Type": "Coding",
+    "Name": "23. Merge k Sorted Lists",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P23_MergeKSortedLists",
+    "Companies": [
+      "Microsoft",
+      "Amazon",
+      "LinkedIn",
+      "Google",
+      "Facebook",
+      "Uber",
+      "Twitter",
+      "Airbnb",
+      "IXL"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Linked List",
+      "Divide and Conquer",
+      "Heap"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 566,
+    "Type": "Coding",
+    "Name": "26. Remove Duplicates from Sorted Array",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P26_RemoveDuplicatesFromSortedArray",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Microsoft",
+      "Amazon",
+      "Uber",
+      "Bloomberg",
+      "Cisco",
+      "Adobe",
+      "Yahoo",
+      "VMware",
+      "Walmart Labs",
+      "Apple",
+      "Alibaba",
+      "NetEase"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 567,
+    "Type": "Coding",
+    "Name": "28. Implement strStr()",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P28_ImplementStrStr",
+    "Companies": [
+      "Microsoft",
+      "Amazon",
+      "Facebook",
+      "Apple",
+      "Bloomberg",
+      "Adobe",
+      "Pocket Gems",
+      "Tencent",
+      "Alibaba",
+      "Yahoo",
+      "Google",
+      "Baidu",
+      "Salesforce",
+      "Zillow"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 568,
+    "Type": "Coding",
+    "Name": "31. Next Permutation",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P31_NextPermutation",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Microsoft",
+      "Amazon",
+      "Sumologic",
+      "Uber",
+      "Quora",
+      "Houzz",
+      "Samsung",
+      "Apple",
+      "Adobe",
+      "Rubrik",
+      "LinkedIn",
+      "Airbnb",
+      "Matlab"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 569,
+    "Type": "Coding",
+    "Name": "33. Search in Rotated Sorted Array",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P33_SearchInRotatedSortedArray",
+    "Companies": [
+      "Microsoft",
+      "LinkedIn",
+      "Facebook",
+      "Uber",
+      "Bloomberg"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array",
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 570,
+    "Type": "Coding",
+    "Name": "34. Find First and Last Position of Element in Sorted Array",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P34_FindFirstAndLastPositionOfElementInSortedArray",
+    "Companies": [
+      "LinkedIn"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array",
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 571,
+    "Type": "Coding",
+    "Name": "35. Search Insert Position",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P35_SearchInsertPosition",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 572,
+    "Type": "Coding",
+    "Name": "36. Valid Sudoku",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P36_ValidSudoku",
+    "Companies": [
+      "Uber",
+      "Microsoft",
+      "Facebook",
+      "Pinterest",
+      "Apple",
+      "Amazon",
+      "Google",
+      "Bloomberg",
+      "Snapchat"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 573,
+    "Type": "Coding",
+    "Name": "38. Count and Say",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P38_CountAndSay",
+    "Companies": [
+      "Google",
+      "Microsoft",
+      "Amazon",
+      "Adobe",
+      "Bloomberg",
+      "Facebook",
+      "Apple",
+      "Intuit",
+      "eBay",
+      "Epic Systems",
+      "Airbnb",
+      "VMware",
+      "Salesforce"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 574,
+    "Type": "Coding",
+    "Name": "46. Permutations",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P46_Permutations",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Google",
+      "Amazon",
+      "Microsoft",
+      "Bloomberg",
+      "Yahoo"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 575,
+    "Type": "Coding",
+    "Name": "47. Permutations II",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P47_Permutations2",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Tencent",
+      "Houzz",
+      "Google",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 576,
+    "Type": "Coding",
+    "Name": "48. Rotate Image",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P48_RotateImage",
+    "Companies": [
+      "Microsoft",
+      "Amazon",
+      "Apple",
+      "Google",
+      "Nvidia",
+      "Facebook",
+      "Akuna Capital",
+      "Houzz",
+      "ServiceNow",
+      "Baidu",
+      "Wish",
+      "Adobe",
+      "Bloomberg",
+      "Epic Systems",
+      "Salesforce",
+      "Paypal"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 577,
+    "Type": "Coding",
+    "Name": "4. Median of Two Sorted Arrays",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P4_MedianOfTwoSortedArrays",
+    "Companies": [
+      "Google",
+      "Amazon",
+      "Adobe",
+      "Microsoft",
+      "Apple",
+      "Goldman Sachs",
+      "Uber",
+      "Bloomberg",
+      "Walmart Labs",
+      "Facebook",
+      "Rubrik",
+      "Tencent",
+      "Alibaba",
+      "VMWare",
+      "Airbnb",
+      "Two Sigma",
+      "Baidu",
+      "NetEase",
+      "Twitter",
+      "Snapchat",
+      "Zillow",
+      "Pocket Gems",
+      "Aetion",
+      "Yahoo",
+      "Hulu",
+      "eBay",
+      "Lyft",
+      "Cloudera",
+      "Zappos",
+      "LinkedIn",
+      "Pinterest",
+      "Nutanix",
+      "Zenefits",
+      "Dropbox"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Array",
+      "Binary Search",
+      "Divide and Conquer"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 578,
+    "Type": "Coding",
+    "Name": "50. Pow(x, n)",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P50_Pow_x_n",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Amazon",
+      "Google",
+      "Microsoft",
+      "Bloomberg",
+      "Alibaba"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Math",
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 579,
+    "Type": "Coding",
+    "Name": "53. Maximum Subarray",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P53_MaximumSubarray",
+    "Companies": [
+      "Facebook",
+      "Microsoft",
+      "Amazon",
+      "eBay",
+      "Uber",
+      "LinkedIn",
+      "Apple",
+      "NetEase",
+      "Tencent",
+      "Adobe",
+      "Google",
+      "Alibaba",
+      "Hulu",
+      "Bloomberg"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Divide and Conquer",
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 580,
+    "Type": "Coding",
+    "Name": "56. Merge Intervals",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P56_MergeIntervals",
+    "Companies": [
+      "Facebook",
+      "Palantir Technologies",
+      "Google",
+      "Amazon",
+      "Uber",
+      "LinkedIn",
+      "Apple",
+      "Microsoft",
+      "Bloomberg",
+      "Yelp",
+      "Zenefits",
+      "Twitter"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array",
+      "Sort"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 581,
+    "Type": "Coding",
+    "Name": "57. Insert Interval",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P57_InsertInterval",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Uber",
+      "Google",
+      "Microsoft",
+      "Amazon",
+      "Twitter"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Array",
+      "Sort"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 582,
+    "Type": "Coding",
+    "Name": "65. Valid Number",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P65_ValidNumber",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Adobe",
+      "Google"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Math",
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 583,
+    "Type": "Coding",
+    "Name": "66. Plus One",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P66_PlusOne",
+    "Companies": [
+      "Google",
+      "Facebook",
+      "Uber",
+      "Microsoft",
+      "Bloomberg",
+      "eBay",
+      "Adobe",
+      "Amazon",
+      "Airbnb"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 584,
+    "Type": "Coding",
+    "Name": "68. Text Justification",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P68_TextJustification",
+    "Companies": [
+      "Apple",
+      "Microsoft",
+      "Uber",
+      "Google",
+      "Facebook",
+      "Snapchat",
+      "Amazon",
+      "LinkedIn",
+      "Airbnb"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 585,
+    "Type": "Coding",
+    "Name": "76. Minimum Window Substring",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P76_MinimumWindowSubstring",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "LinkedIn",
+      "Amazon",
+      "Microsoft",
+      "Airbnb",
+      "Apple",
+      "Uber",
+      "Bloomberg",
+      "Walmart Labs",
+      "VMware",
+      "Alibaba",
+      "LiveRamp",
+      "Netsuite",
+      "Yahoo",
+      "Adobe",
+      "Snapchat"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Hash Table",
+      "Two Pointers",
+      "String"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 586,
+    "Type": "Coding",
+    "Name": "7. Reverse Integer",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P7_ReverseInteger",
+    "Companies": [
+      "Adobe",
+      "Bloomberg",
+      "Google",
+      "Amazon",
+      "Microsoft",
+      "Apple",
+      "JPMorgan",
+      "Facebook",
+      "Yahoo",
+      "Lyft",
+      "NetEase",
+      "Alibaba",
+      "Aetion",
+      "Airbnb",
+      "Symantec",
+      "Baidu",
+      "Huawei",
+      "Oracle",
+      "Tencent",
+      "Twitter",
+      "LinkedIn",
+      "GoDaddy",
+      "eBay",
+      "VMware",
+      "Epic Systems",
+      "Pocket Gems",
+      "Quora",
+      "Works Applications",
+      "Zillow",
+      "HTC"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 587,
+    "Type": "Coding",
+    "Name": "8. String to Integer (atoi)",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P8_StringToIntegerAtoi",
+    "Companies": [
+      "Microsoft",
+      "Facebook",
+      "Goldman Sachs",
+      "Google",
+      "Amazon",
+      "Apple",
+      "Adobe",
+      "Cisco",
+      "Redfin",
+      "Zillow",
+      "LinkedIn",
+      "Bloomberg",
+      "Yahoo",
+      "Baidu",
+      "Alibaba",
+      "VMware",
+      "Citrix",
+      "eBay",
+      "Airbnb",
+      "Tencent",
+      "Huawei",
+      "Uber"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "String",
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 588,
+    "Type": "Coding",
+    "Name": "205. Isomorphic Strings",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P205_IsomorphicStrings",
+    "Companies": [
+      "LinkedIn",
+      "Google",
+      "Bloomberg",
+      "Yahoo",
+      "eBay"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 589,
+    "Type": "Coding",
+    "Name": "206. Reverse Linked List",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P206_ReverseLinkedList",
+    "Companies": [
+      "Microsoft",
+      "Apple",
+      "Amazon",
+      "Facebook",
+      "Bloomberg",
+      "Yandex",
+      "Adobe",
+      "Mathworks",
+      "Google",
+      "Goldman Sachs",
+      "Cisco",
+      "Nvidia",
+      "VMware",
+      "Alibaba",
+      "Oracle",
+      "Baidu",
+      "Intuit",
+      "Intel",
+      "Paypal",
+      "Two Sigma",
+      "Tencent",
+      "Expedia",
+      "Yahoo",
+      "Walmart Labs",
+      "TripAdvisor",
+      "Qualcomm",
+      "Zynga",
+      "Zappos",
+      "Citrix",
+      "SAP",
+      "Nutanix",
+      "eBay",
+      "EMC",
+      "Snapchat",
+      "Zenefits",
+      "Yelp",
+      "Uber",
+      "Twitter"
+    ],
+    "Categories": [
+      "Explore -> Interview -> Top Interview Questions - Easy",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 590,
+    "Type": "Coding",
+    "Name": "211. Add and Search Word - Data structure design",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P211_AddAndSearchWord_DataStructureDesign",
+    "Companies": [
+      "Facebook",
+      "Amazon"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Backtracking",
+      "Design",
+      "Trie"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 591,
+    "Type": "Coding",
+    "Name": "217. Contains Duplicate",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P217_ContainsDuplicate",
+    "Companies": [
+      "Adobe",
+      "Microsoft",
+      "Google",
+      "Bloomberg",
+      "Amazon",
+      "Yahoo",
+      "Facebook",
+      "Baidu",
+      "Yelp",
+      "Airbnb",
+      "Palantir Technologies"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 592,
+    "Type": "Coding",
+    "Name": "236. Lowest Common Ancestor of a Binary Tree",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P236_LowestCommonAncestorOfABinaryTree",
+    "Companies": [
+      "LinkedIn",
+      "Microsoft",
+      "Tencent",
+      "Bloomberg",
+      "Uber",
+      "Amazon",
+      "Facebook",
+      "Apple"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Tree"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 593,
+    "Type": "Coding",
+    "Name": "237. Delete Node in a Linked List",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P237_DeleteNodeInALinkedList",
+    "Companies": [
+      "Microsoft",
+      "Paypal",
+      "Apple",
+      "Amazon",
+      "VMware",
+      "Google",
+      "Adobe",
+      "Bloomberg",
+      "Capital One",
+      "NetEase",
+      "Tencent",
+      "Baidu"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Linked List"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 594,
+    "Type": "Coding",
+    "Name": "238. Product of Array Except Self",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P238_ProductOfArrayExceptSelf",
+    "Companies": [
+      "LinkedIn",
+      "Microsoft",
+      "Yelp",
+      "Expedia",
+      "Zenefits",
+      "Google",
+      "Hulu",
+      "Apple",
+      "Amazon",
+      "Facebook",
+      "Lyft"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 595,
+    "Type": "Coding",
+    "Name": "242. Valid Anagram",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P242_ValidAnagram",
+    "Companies": [
+      "Bloomberg",
+      "Google",
+      "Microsoft",
+      "Apple",
+      "Yahoo",
+      "Uber",
+      "Facebook",
+      "Amazon",
+      "Goldman Sachs",
+      "Paypal",
+      "VMware",
+      "Snapchat",
+      "Samsung",
+      "Oracle",
+      "Cisco",
+      "Yelp",
+      "LeetCode"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Hash Table",
+      "Sort"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 596,
+    "Type": "Coding",
+    "Name": "243. Shortest Word Distance",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P243_ShortestWordDistance",
+    "Companies": [
+      "LinkedIn",
+      "Microsoft",
+      "Indeed"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 597,
+    "Type": "Coding",
+    "Name": "244. Shortest Word Distance 2",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P244_ShortedWordDistance2",
+    "Companies": [
+      "LinkedIn",
+      "Uber",
+      "Indeed",
+      "Bloomberg"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Hash Table",
+      "Design"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 598,
+    "Type": "Coding",
+    "Name": "245. Shortest Word Distance 3",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P245_ShortestWordDistance3",
+    "Companies": [
+      "LinkedIn"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 599,
+    "Type": "Coding",
+    "Name": "254. Factor Combinations",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P254_FactorCombinations",
+    "Companies": [
+      "LinkedIn",
+      "Bloomberg",
+      "Uber"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Backtracking"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 600,
+    "Type": "Coding",
+    "Name": "256. Paint House",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P256_PaintHouse",
+    "Companies": [
+      "LinkedIn"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 601,
+    "Type": "Coding",
+    "Name": "272. Closest Binary Search Tree Value II",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P272_ClosestBinarySearchTreeValue2",
+    "Companies": [
+      "LinkedIn",
+      "ForUsAll"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Stack",
+      "Tree"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 602,
+    "Type": "Coding",
+    "Name": "277. Find the Celebrity",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P277_FindTheCelebrity",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Microsoft",
+      "Pinterest",
+      "Apple",
+      "Yahoo"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 603,
+    "Type": "Coding",
+    "Name": "283. Move Zeroes",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P283_MoveZeroes",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "SAP",
+      "Walmart Labs",
+      "Bloomberg",
+      "Microsoft",
+      "Apple",
+      "eBay",
+      "Uber",
+      "Paypal",
+      "Baidu",
+      "Lyft",
+      "Amazon",
+      "Yahoo",
+      "Oracle"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 604,
+    "Type": "Coding",
+    "Name": "297. Serialize and Deserialize Binary Tree",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P297_SerializeAndDeserializeBinaryTree",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Amazon",
+      "Google",
+      "Microsoft",
+      "Intuit",
+      "Uber",
+      "Bloomberg",
+      "Apple",
+      "Yahoo"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Tree",
+      "Design"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 605,
+    "Type": "Coding",
+    "Name": "311. Sparse Matrix Multiplication",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P311_SparseMatrixMultiplication",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Google",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 606,
+    "Type": "Coding",
+    "Name": "339. Nested List Weight Sum",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P339_NestedListWeightSum",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Snapchat"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Depth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 607,
+    "Type": "Coding",
+    "Name": "344. Reverse String",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P344_ReverseString",
+    "Companies": [
+      "Microsoft",
+      "Apple",
+      "Bloomberg",
+      "Adobe",
+      "Google",
+      "GoDaddy",
+      "Walmart Labs",
+      "Alibaba",
+      "Goldman Sachs",
+      "Tencent",
+      "eBay",
+      "Amazon",
+      "Facebook",
+      "Baidu",
+      "LinkedIn",
+      "Airbnb",
+      "VMware",
+      "IBM",
+      "Cisco"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String",
+      "Two Pointers"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 608,
+    "Type": "Coding",
+    "Name": "350. Intersection of Two Arrays II",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P350_IntersectionOfTwoArrays2",
+    "Companies": [
+      "Facebook",
+      "Google",
+      "Oracle",
+      "Yelp",
+      "Bloomberg",
+      "Amazon",
+      "Alibaba"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Hash Table",
+      "Two Pointers",
+      "Binary Search",
+      "Sort"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 609,
+    "Type": "Coding",
+    "Name": "364. Nested List Weight Sum II",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P364_NestedListWeightSum2",
+    "Companies": [
+      "LinkedIn"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Depth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 610,
+    "Type": "Coding",
+    "Name": "366. Find Leaves of Binary Tree",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P366_FindLeavesOfBinaryTree",
+    "Companies": [
+      "LinkedIn",
+      "Pocket Gems",
+      "Bloomberg"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Tree",
+      "Depth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 611,
+    "Type": "Coding",
+    "Name": "367. Valid Perfect Square",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P367_ValidPerfectSquare",
+    "Companies": [
+      "LinkedIn",
+      "Facebook",
+      "Microsoft"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Math",
+      "Binary Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 612,
+    "Type": "Coding",
+    "Name": "387. First Unique Character in a String",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P387_FirstUniqueCharacterInAString",
+    "Companies": [
+      "Bloomberg",
+      "Facebook",
+      "Amazon",
+      "Apple",
+      "Zillow",
+      "Goldman Sachs",
+      "Google",
+      "Microsoft",
+      "Yahoo",
+      "Airbnb",
+      "SAP",
+      "Alibaba",
+      "Oracle"
+    ],
+    "Categories": [
+      "Explore -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "String",
+      "Hash Table"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 613,
+    "Type": "Coding",
+    "Name": "464. Can I Win",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P401_P500/P464_CanIWin",
+    "Companies": [
+      "LinkedIn",
+      "Google"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Dynamic Programming",
+      "Minmax"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 614,
+    "Type": "Coding",
+    "Name": "515. Find Largest Value in Each Tree Row",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P501_P600/P515_FindLargestValueInEachTreeRow",
+    "Companies": [
+      "LinkedIn"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Tree",
+      "Depth-first Search",
+      "Breadth-first Search"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 615,
+    "Type": "Coding",
+    "Name": "605. Can Place Flowers",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P601_P700/P605_CanPlaceFlowers",
+    "Companies": [
+      "LinkedIn"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 616,
+    "Type": "Coding",
+    "Name": "633. Sum of Square Numbers",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P601_P700/P633_SumOfSquareNumbers",
+    "Companies": [
+      "LinkedIn",
+      "Facebook"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 617,
+    "Type": "Coding",
+    "Name": "647. Palindromic Substrings",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P601_P700/P647_PalindromicSubstrings",
+    "Companies": [
+      "LinkedIn",
+      "Twitter",
+      "Pure Storage",
+      "Facebook",
+      "Amazon",
+      "Expedia",
+      "Google",
+      "Microsoft",
+      "Apple",
+      "Uber"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "String",
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 618,
+    "Type": "Coding",
+    "Name": "671. Second Minimum Node In a Binary Tree",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P601_P700/P671_SecondMinimumNodeInABinaryTree",
+    "Companies": [
+      "LinkedIn",
+      "Microsoft",
+      "Apple"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Tree"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 619,
+    "Type": "Coding",
+    "Name": "698. Partition to K Equal Sum Subsets",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P601_P700/P698_PartitionToKEqualSumSubsets",
+    "Companies": [
+      "LinkedIn",
+      "Bloomberg"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Dynamic Programming",
+      "Recursion"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 620,
+    "Type": "Coding",
+    "Name": "716. Max Stack",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P701_P800/P716_MaxStack",
+    "Companies": [
+      "LinkedIn",
+      "Lyft",
+      "Google",
+      "Pure Storage"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Design"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 621,
+    "Type": "Coding",
+    "Name": "730. Count Different Palindromic Subsequences",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P701_P800/P730_CountDifferentPalindromicSubsequences",
+    "Companies": [
+      "LinkedIn"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "String",
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 622,
+    "Type": "Coding",
+    "Name": "921. Minimum Add to Make Parentheses Valid",
+    "Origin": "LeetCode",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P901_P1000/P921_MinimumAddToMakeParenthesesValid",
+    "Companies": [
+      "Facebook"
+    ],
+    "Categories": [
+      "Problems -> Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Stack",
+      "Greedy"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 623,
+    "Type": "Coding",
+    "Name": "Binary Tree to Doubly Linked List",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/BinaryTreeToDoublyLinkedList",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [
+      "Binary Tree"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 624,
+    "Type": "Coding",
+    "Name": "Clone a Linked List with Next and Random Pointers",
+    "Origin": "",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/CloneLinkedListWithNextAndRandomPointer",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Linked List",
+      "HashMap"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 625,
+    "Type": "Coding",
+    "Name": "Common Letters in Input Strings",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/CommonLettersInInputStrings",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "HashMap",
+      "Strings"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 626,
+    "Type": "Coding",
+    "Name": "Find if Number is Little or Big Endian",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/FindNumberLittleOrBigEndian",
+    "Companies": [
+      "Aruba Networks"
+    ],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 627,
+    "Type": "Coding",
+    "Name": "Implement Queue using Stack",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/ImplementQueueUsingStack",
+    "Companies": [
+      "Aruba Networks"
+    ],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": []
+  },
+  {
+    "Id": 628,
+    "Type": "Coding",
+    "Name": "In-memory Database with Nested Transaction Support",
+    "Origin": "",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/InMemoryDatabaseWithNestedTransactions",
+    "Companies": [
+      "Xob"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [],
+    "Languages": []
+  },
+  {
+    "Id": 629,
+    "Type": "Coding",
+    "Name": "Index Of Last Occurrence Of Element In Array",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/IndexOfLastOccurrenceOfElementInArray",
+    "Companies": [
+      "Apple"
+    ],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": []
+  },
+  {
+    "Id": 630,
+    "Type": "Coding",
+    "Name": "Kth Largest Element In Bst",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/KthLargestElementInBst",
+    "Companies": [
+      "Aruba Networks"
+    ],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": []
+  },
+  {
+    "Id": 631,
+    "Type": "Coding",
+    "Name": "Level Order Traversal Binary Tree Level By Level",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/LevelOrderTraversalBinaryTreeLevelByLevel",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [
+      "Binary Tree"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 632,
+    "Type": "Coding",
+    "Name": "Level Order Traversal Of Binary Tree in Single Line",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/LevelOrderTraversalBinaryTreeSingleLine",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [
+      "Binary Tree"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 633,
+    "Type": "Coding",
+    "Name": "Map Words List to Grid",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/MapWordsListToGrid",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 634,
+    "Type": "Coding",
+    "Name": "Mapping between Message and Code",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/MappingBetweenMessageAndCode",
+    "Companies": [
+      "GoDaddy"
+    ],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [
+      "HashMap"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 635,
+    "Type": "Coding",
+    "Name": "Find the number of distinct islands",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/NumberOfDistinctIslands",
+    "Companies": [
+      "Qualtrics"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Depth-first Search",
+      "Breadth-first Search",
+      "Union Find"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 636,
+    "Type": "Coding",
+    "Name": "Remove Duplicates and Return List",
+    "Origin": "",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/RemoveDuplicatesAndReturnList",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Array",
+      "HashMap"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 637,
+    "Type": "Coding",
+    "Name": "Remove Duplicates and Return Weighted List",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/RemoveDuplicatesAndReturnWeightedList",
+    "Companies": [
+      "Google"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array",
+      "HashMap"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 638,
+    "Type": "Coding",
+    "Name": "Reverse a String",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/ReverseString",
+    "Companies": [
+      "Aruba Networks"
+    ],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [
+      "Strings"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 639,
+    "Type": "Coding",
+    "Name": "Rotate the Bits of a Number",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/RotateTheBitsOfANumber",
+    "Companies": [
+      "Aruba Networks"
+    ],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [
+      "Math"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 640,
+    "Type": "Coding",
+    "Name": "Seed Records Per Bin",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/SeedRecordsPerBin",
+    "Companies": [
+      "The Climate Corporation"
+    ],
+    "Categories": [
+      "Difficulty -> Easy"
+    ],
+    "Tags": [],
+    "Languages": [
+      "csharp"
+    ]
+  },
+  {
+    "Id": 641,
+    "Type": "Coding",
+    "Name": "Simple Product Sorting",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/SortCommaSeparatedProducts",
+    "Companies": [
+      "Shopify"
+    ],
+    "Categories": [
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Arrays",
+      "Sorting"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 642,
+    "Type": "Coding",
+    "Name": "Swap Two Pointers",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/SwapTwoPointers",
+    "Companies": [
+      "Aruba Networks"
+    ],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [
+      "Pointers"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 643,
+    "Type": "Coding",
+    "Name": "Top Three Sequence Visited",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/TopThreeSequenceVisited",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": []
+  },
+  {
+    "Id": 644,
+    "Type": "Coding",
+    "Name": "Truck Loading Find Total Weight",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/TruckLoadingTotalWeight",
+    "Companies": [
+      "Wayfair"
+    ],
+    "Categories": [
+      "Difficulty -> Easy"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java",
+      "csharp"
+    ]
+  },
+  {
+    "Id": 645,
+    "Type": "Coding",
+    "Name": "Blum-Floyd-Pratt-Rivest-Tarjan Algorithm",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/BlumFloydPrattRivestTarjanAlgorithm",
+    "Companies": [],
+    "Categories": [
+      "Known Algorithms -> Named Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Array"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 646,
+    "Type": "Coding",
+    "Name": "Edmonds\u2013Karp Algorithm",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/EdmondsKarpAlgorithm",
+    "Companies": [],
+    "Categories": [
+      "Known Algorithms -> Named Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [],
+    "Languages": []
+  },
+  {
+    "Id": 647,
+    "Type": "Coding",
+    "Name": "Ford\u2013Fulkerson Algorithm",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/FordFulkersonAlgorithm",
+    "Companies": [],
+    "Categories": [
+      "Known Algorithms -> Named Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [],
+    "Languages": []
+  },
+  {
+    "Id": 648,
+    "Type": "Coding",
+    "Name": "Kadane's Algorithm",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/KadanesAlgorithm",
+    "Companies": [],
+    "Categories": [
+      "Known Algorithms -> Named Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Breadth-first Search"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 649,
+    "Type": "Coding",
+    "Name": "Knuth\u2013Morris\u2013Pratt Algorithm",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/KnuthMorrisPrattAlgorithm",
+    "Companies": [],
+    "Categories": [
+      "Known Algorithms -> Named Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "String",
+      "Array"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 650,
+    "Type": "Coding",
+    "Name": "Krushal's Algorithm",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/KruskalsAlgorithm",
+    "Companies": [],
+    "Categories": [
+      "Known Algorithms -> Named Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "Tree",
+      "Graph"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 651,
+    "Type": "Coding",
+    "Name": "Lee Algorithm",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/LeeAlgorithm",
+    "Companies": [],
+    "Categories": [
+      "Known Algorithms -> Named Algorithms",
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Breadth-first Search"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 652,
+    "Type": "Coding",
+    "Name": "Manacher's Algorithm",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/ManachersAlgorithm",
+    "Companies": [],
+    "Categories": [
+      "Known Algorithms -> Named Algorithms",
+      "Difficulty -> Hard"
+    ],
+    "Tags": [
+      "String"
+    ],
+    "Languages": []
+  },
+  {
+    "Id": 653,
+    "Type": "Systems Design",
+    "Name": "Design an automated parking garage with object models and APIs",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/SystemsDesign/AutomatedParkingGarage",
+    "Companies": [
+      "Wayfair"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Object Oriented Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 654,
+    "Type": "Systems Design",
+    "Name": "Design the Backend for an Online Retailer",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/SystemsDesign/DesignBackendForOnlineRetailer",
+    "Companies": [
+      "Amazon"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 655,
+    "Type": "Systems Design",
+    "Name": "Design a Paywall for a News Portal",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/SystemsDesign/DesignPaywall",
+    "Companies": [
+      "Qualtrics"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 656,
+    "Type": "Systems Design",
+    "Name": "Elevator with Scheduling Algorithm",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/SystemsDesign/Elevator",
+    "Companies": [
+      "Box"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Distributed Systems Design",
+      "Object Oriented Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 657,
+    "Type": "Systems Design",
+    "Name": "Images Deduplicator",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/SystemsDesign/ImagesDedeplicator",
+    "Companies": [
+      "Netflix"
+    ],
+    "Categories": [
+      "Difficulty -> Medium"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 658,
+    "Type": "Systems Design",
+    "Name": "Scaling Read Requests",
+    "Origin": "Miscellaneous",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/SystemsDesign/ScalingReadRequests",
+    "Companies": [],
+    "Categories": [
+      "Difficulty -> Easy"
+    ],
+    "Tags": [
+      "Distributed Systems Design"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 659,
+    "Type": "Coding",
+    "Name": "All K Subsequence Maximums",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Blog/SlidingWindow/AllKSubsequenceMaximums",
+    "Companies": [],
+    "Categories": [],
+    "Tags": [],
+    "Languages": []
+  },
+  {
+    "Id": 660,
+    "Type": "Coding",
+    "Name": "Maximum Sum Subsequence",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Blog/SlidingWindow/MaximumSumSubsequence",
+    "Companies": [],
+    "Categories": [],
+    "Tags": [],
+    "Languages": []
+  },
+  {
+    "Id": 661,
+    "Type": "Coding",
+    "Name": "Moving Average",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Blog/SlidingWindow/MovingAverage",
+    "Companies": [],
+    "Categories": [],
+    "Tags": [],
+    "Languages": []
+  },
+  {
+    "Id": 662,
+    "Type": "Behavioral",
+    "Name": "Behavioral Question Set 10",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/Behavioral/BehavioralQuestionSet10",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": ""
+  },
+  {
+    "Id": 663,
+    "Type": "Behavioral",
+    "Name": "Behavioral Question Set 2",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/Behavioral/BehavioralQuestionSet2",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": ""
+  },
+  {
+    "Id": 664,
+    "Type": "Behavioral",
+    "Name": "Behavioral Question Set 3",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/Behavioral/BehavioralQuestionSet3",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": ""
+  },
+  {
+    "Id": 665,
+    "Type": "Behavioral",
+    "Name": "Behavioral Question Set 4",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/Behavioral/BehavioralQuestionSet4",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": ""
+  },
+  {
+    "Id": 666,
+    "Type": "Coding",
+    "Name": "Array Quadruplet",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/DataStructuresAndAlgorithms/ArrayQuadruplet",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 667,
+    "Type": "Coding",
+    "Name": "Basic Regex Parser",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/DataStructuresAndAlgorithms/BasicRegexParser",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": []
+  },
+  {
+    "Id": 668,
+    "Type": "Coding",
+    "Name": "BST Successor Search",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/DataStructuresAndAlgorithms/BstSuccessorSearch",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 669,
+    "Type": "Coding",
+    "Name": "Decrypt Message",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/DataStructuresAndAlgorithms/DecryptMessage",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 670,
+    "Type": "Coding",
+    "Name": "Number of Paths",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/DataStructuresAndAlgorithms/NumberOfPaths",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [
+      "Dynamic Programming"
+    ],
+    "Languages": [
+      "Java"
+    ]
+  },
+  {
+    "Id": 671,
+    "Type": "Systems Design",
+    "Name": "Key-Value Cache for Search Engine",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/SystemDesign/KeyValueCacheForSearchEngine",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": ""
+  },
+  {
+    "Id": 672,
+    "Type": "Systems Design",
+    "Name": "Sales Rank",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/SystemDesign/SalesRank",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": ""
+  },
+  {
+    "Id": 673,
+    "Type": "Systems Design",
+    "Name": "Scale on the Cloud",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/SystemDesign/ScaleOnTheCloud",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": ""
+  },
+  {
+    "Id": 674,
+    "Type": "Systems Design",
+    "Name": "Social Graph",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/SystemDesign/SocialGraph",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": ""
+  },
+  {
+    "Id": 675,
+    "Type": "Systems Design",
+    "Name": "Twitter",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/SystemDesign/Twitter",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": ""
+  },
+  {
+    "Id": 676,
+    "Type": "Systems Design",
+    "Name": "Web Crawler",
+    "Origin": "Pramp",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/SystemDesign/WebCrawler",
+    "Companies": [],
+    "Categories": [
+      "Difficulty"
+    ],
+    "Tags": [],
+    "Languages": ""
+  },
+  {
+    "Id": 677,
+    "Type": "Course",
+    "Name": "AWS Certified Solutions Architect - Associate",
+    "Origin": "Udemy",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Udemy/src/acloudguru-aws-certified-solutions-architect-associate",
+    "Companies": [],
+    "Categories": [
+      "Courses -> AWS Certified Solutions Architect - Associate",
+      "Instructors -> Ryan Kroonenburg",
+      "Instructors -> Faye Ellis"
+    ],
+    "Tags": [
+      "Distributed Systems",
+      "Cloud Computing",
+      "Amazon Web Services"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 678,
+    "Type": "Course",
+    "Name": "The Ultimate Hands-On Hadoop - Tame your Big Data!",
+    "Origin": "Udemy",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Udemy/src/the-ultimate-handson-hadoop-tame-your-big-data",
+    "Companies": [],
+    "Categories": [
+      "Courses -> The Ultimate Hands-On Hadoop - Tame your Big Data!",
+      "Instructors -> Frank Kane"
+    ],
+    "Tags": [
+      "Distributed Systems",
+      "Big Data"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 679,
+    "Type": "Course",
+    "Name": "Ultimate AWS Certified Solutions Architect Associate",
+    "Origin": "Udemy",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Udemy/src/ultimate-aws-certified-solutions-architect-associate",
+    "Companies": [],
+    "Categories": [
+      "Courses -> Ultimate AWS Certified Solutions Architect Associate",
+      "Instructors -> Stephane Maarek"
+    ],
+    "Tags": [
+      "Distributed Systems",
+      "Cloud Computing",
+      "Amazon Web Services"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 680,
+    "Type": "Reading",
+    "Name": "Building Microservices -  Designing Fine-Grained Systems",
+    "Origin": "Notes - Book",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/_notes/books/building-microservices_designing-fine-grained-systems",
+    "Companies": [],
+    "Categories": [
+      "Books",
+      "Authors -> Sam Neuman"
+    ],
+    "Tags": [
+      "Distributed Systems",
+      "Cloud Computing",
+      "DevOps",
+      "Microservices"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 681,
+    "Type": "Reading",
+    "Name": "Designing Data Intensive Applications",
+    "Origin": "Notes - Book",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/_notes/books/designing-data-intensive-applications",
+    "Companies": [],
+    "Categories": [
+      "Books",
+      "Authors -> Martin Kleppmann"
+    ],
+    "Tags": [
+      "Distributed Systems",
+      "Cloud Computing",
+      "Databases"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 682,
+    "Type": "Reading",
+    "Name": "Distributed systems for fun and profit",
+    "Origin": "Notes - Book",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/_notes/books/distributed-systems-for-fun-and-profit",
+    "Companies": [],
+    "Categories": [
+      "Books",
+      "Authors -> Mikito Takada -> alias -> mixu"
+    ],
+    "Tags": [
+      "Distributed Systems",
+      "Cloud Computing"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 683,
+    "Type": "Reading",
+    "Name": "I Heart Logs: Event Data, Stream Processing, and Data Integration",
+    "Origin": "Notes - Book",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/_notes/books/i-heart-logs_event-data-stream-processing-data-integration",
+    "Companies": [],
+    "Categories": [
+      "Books",
+      "Authors -> Jay Kreps"
+    ],
+    "Tags": [
+      "Distributed Systems",
+      "Event Data",
+      "Data Integration",
+      "Stream Processing"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 684,
+    "Type": "Reading",
+    "Name": "Production-Ready Microservices",
+    "Origin": "Notes - Book",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/_notes/books/production-ready-microservices",
+    "Companies": [],
+    "Categories": [
+      "Books",
+      "Authors -> Susan Fowler"
+    ],
+    "Tags": [
+      "Distributed Systems",
+      "Cloud Computing",
+      "Microservices",
+      "DevOps",
+      "Site Reliability Engineering"
+    ],
+    "Languages": ""
+  },
+  {
+    "Id": 685,
+    "Type": "Reading",
+    "Name": "Scaling Teams: Strategies for Building Successful Teams and Organizations",
+    "Origin": "Notes - Book",
+    "Link": "https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/_notes/books/scaling-teams_strategies-for-building-successful-teams-and-organizations",
+    "Companies": [],
+    "Categories": [
+      "Books",
+      "Authors -> Alexander Grosse",
+      "Authors -> David Loftesness"
+    ],
+    "Tags": [
+      "Engineering Leadership"
+    ],
+    "Languages": ""
+  }
+]
\ No newline at end of file
diff --git a/problems_list.md b/problems_list.md
new file mode 100644
index 0000000..015df9b
--- /dev/null
+++ b/problems_list.md
@@ -0,0 +1,689 @@
+# List of problems
+
+| Id | Type | Name | Origin | Companies | Categories | Tags | Languages |
+|-----------------------|---------------------|---------------------|-----------------------|--------------------------|---------------------------|---------------------|--------------------------|
+| 1 | Coding | [Median of Arrays](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ByteByByte/src/CodingInterviewQuestions/Array/P1_MedianOfArrays) | Byte by Byte |  | Difficulty -> Medium | Array, Searching | Java |
+| 2 | Coding | [0-1 Knapsack](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ByteByByte/src/CodingInterviewQuestions/Array/P2_01Knapsack) | Byte by Byte |  | Difficulty -> Medium | Array, Dynamic Programming | Java |
+| 3 | Coding | [BTree Printer](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/Helper/BTreePrinter) | Cracking the Coding Interview |  | Books |  | Java |
+| 4 | Coding | [Linked List Node](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/Helper/LinkedListNode) | Cracking the Coding Interview |  | Books |  | Java |
+| 5 | Coding | [Tree Node](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/Helper/TreeNode) | Cracking the Coding Interview |  | Books |  | Java |
+| 6 | Coding | [Trie](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/Helper/Trie) | Cracking the Coding Interview |  | Books |  | Java |
+| 7 | Coding | [Trie Node](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/Helper/TrieNode) | Cracking the Coding Interview |  | Books |  | Java |
+| 8 | Coding | [ArrayList](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q0_Introduction/ArrayList) | Cracking the Coding Interview |  | Books, Known Data Structures |  | Java |
+| 9 | Coding | [HashTable](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q0_Introduction/HashTable) | Cracking the Coding Interview |  | Books, Known Data Structures |  | Java |
+| 10 | Coding | [StringBuilder](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q0_Introduction/StringBuilder) | Cracking the Coding Interview |  | Books, Known Data Structures |  | Java |
+| 11 | Coding | [Q1 Is Unique](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q1_IsUnique) | Cracking the Coding Interview |  | Books | Arrays, Strings | Java |
+| 12 | Coding | [Q2 Check Permutation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q2_CheckPermutation) | Cracking the Coding Interview |  | Books | Arrays, Strings | Java |
+| 13 | Coding | [Q3 URLify](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q3_URLify) | Cracking the Coding Interview |  | Books | Arrays, Strings | Java |
+| 14 | Coding | [Q4 Palindrome Permutation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch01_ArraysAndStrings/Q4_PalindromePermutation) | Cracking the Coding Interview |  | Books | Arrays, Strings | Java |
+| 15 | Coding | [Linked List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/CrackingTheCodingInterview/src/Book/IX_InterviewQuestions/DataStructures/Ch02_LinkedLists) | Cracking the Coding Interview |  | Books | Linked Lists | Python |
+| 16 | Coding | [1. Two Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyCodingProblem/src/P1_P100/P1_TwoSum) | Daily Coding Problem | Google | Difficulty -> Easy | Array, Hash Table | Java |
+| 17 | Coding | [2. Product of Array Except Self](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyCodingProblem/src/P1_P100/P2_ProductOfArrayExceptSelf) | Daily Coding Problem | Uber | Difficulty -> Medium | Array | Java |
+| 18 | Coding | [3. Serialize and Deserialize Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyCodingProblem/src/P1_P100/P3_SerializeAndDeserializeBinaryTree) | Daily Coding Problem | Google | Difficulty -> Hard | Tree, Design | Java |
+| 19 | Coding | [4. First Missing Positive](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyCodingProblem/src/P1_P100/P4_FirstMissingPositive) | Daily Coding Problem | Stripe | Difficulty -> Hard | Array | Java |
+| 20 | Coding | [5. First and Last Element of Pair](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyCodingProblem/src/P1_P100/P5_FirstAndLastElementOfPair) | Daily Coding Problem | Jane Street | Difficulty -> Easy |  | Java |
+| 21 | Coding | [205. Next Permutation Of Integer In Absolute Order](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyCodingProblem/src/P201_300/P205_NextPermutationOfIntegerInAbsoluteOrder) | Daily Coding Problem | IBM | Difficulty -> Medium | Array | Java |
+| 22 | Coding | [1. Add two numbers as a linked list](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyInterviewPro/src/P1_P100/P1_AddTwoNumbersAsALinkedList) | Daily Interview Pro | Microsoft | Difficulty -> Medium | Linked List | Java |
+| 23 | Coding | [2. Longest Substring Without Repeating Characters](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyInterviewPro/src/P1_P100/P2_LongestSubstringWithoutRepeatingCharacters) | Daily Interview Pro | Microsoft | Difficulty -> Hard | Arrays, Sliding Window | Java |
+| 24 | Coding | [3. Longest Palindromic Substring](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyInterviewPro/src/P1_P100/P3_LongestPalindromicSubstring) | Daily Interview Pro | Twitter | Difficulty -> Medium | Arrays | Java |
+| 25 | Coding | [4. Validate Balanced Parentheses](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/DailyInterviewPro/src/P1_P100/P4_ValidateBalancedParentheses) | Daily Interview Pro | Uber | Difficulty -> Medium | Arrays | Java |
+| 26 | Course | [Grokking the Coding Interview: Patterns for Coding Questions](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions |  |  |
+| 27 | Coding | [Maximum Sum Subarray of Size K](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P1_MaximumSumSubarrayOfSizeK) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Sliding Window | Arrays | Java, Python |
+| 28 | Coding | [Smallest Subarray with a given sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P2_SmallestSubarrayWithAGivenSum) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Sliding Window | Arrays | Java, Python |
+| 29 | Coding | [Longest Substring with K Distinct Character](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P3_LongestSubstringWithKDistinctCharacters) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Sliding Window | Arrays | Java |
+| 30 | Coding | [Fruits into Baskets](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P4_FruitsIntoBaskets) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Sliding Window | Arrays | Java |
+| 31 | Coding | [No-repeat Substring](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P5_NoRepeatSubstring) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Sliding Window | Arrays | Java |
+| 32 | Coding | [Longest Substring with Same Letters after Replacement](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P6_LongestSubstringWithSameLettersAfterReplacement) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Sliding Window | Arrays | Java |
+| 33 | Coding | [Longest Subarray with Ones after Replacement](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/P7_LongestSubarrayWithOnesAfterReplacement) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Sliding Window | Arrays | Java |
+| 34 | Coding | [Permutation in a String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/PC1_PermutationInAString) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Sliding Window | Arrays | Java |
+| 35 | Coding | [String Anagrams](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/PC2_StringAnagrams) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Sliding Window | Arrays | Java |
+| 36 | Coding | [Smallest Window containing Substring](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/PC3_SmallestWindowContainingSubstring) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Sliding Window | Arrays | Java |
+| 37 | Coding | [Words Concatenation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/PC4_WordsConcatenation) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Sliding Window | Arrays | Java |
+| 38 | Coding | [Average of Subarray of Size K](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch02_Pattern_SlidingWindow/_Introduction_P0_AverageOfSubarrayOfSizeK) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Sliding Window | Arrays | Java, Python |
+| 39 | Coding | [Pair with Target Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P1_PairWithTargetSum) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Two Pointers | Arrays, Hash Table | Java |
+| 40 | Coding | [Remove Duplicates](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P2_RemoveDuplicates) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Two Pointers | Arrays | Java |
+| 41 | Coding | [Remove All Instances of K](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P2_RemoveDuplicates/Variants/P1_RemoveAllInstancesOfK) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Two Pointers | Arrays | Java |
+| 42 | Coding | [Squaring a Sorted Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P3_SquaringASortedArray) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Two Pointers | Arrays | Java |
+| 43 | Coding | [Triplet Sum to Zero](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P4_TripletSumToZero) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Two Pointers | Arrays | Java |
+| 44 | Coding | [Triplet Sum Close to Target](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P5_TripleSumCloseToTarget) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Two Pointers | Arrays | Java |
+| 45 | Coding | [Triplets with Smaller Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P6_TripletsWithSmallerSum) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Two Pointers | Arrays | Java |
+| 46 | Coding | [Return Triplets with Smaller Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P6_TripletsWithSmallerSum/_Variants/P1_ReturnTripletsWithSmallerSum) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Two Pointers | Arrays | Java |
+| 47 | Coding | [Subarrays with Product Less than a Target](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P7_SubarraysWithProductLessThanATarget) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Two Pointers | Arrays | Java |
+| 48 | Coding | [Dutch National Flag Problem](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/P8_DutchNationalFlagProblem) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Two Pointers | Arrays | Java |
+| 49 | Coding | [Quadruple Sum to Target](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/PC1_QuadrupleSumToTarget) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Two Pointers | Arrays | Java |
+| 50 | Coding | [Comparing Strings containing Backspaces](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/PC2_ComparingStringsContainingBackspaces) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Two Pointers | Arrays | Java |
+| 51 | Coding | [Minimum Window Sort](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/PC3_MinimumWindowSort) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Two Pointers | Arrays | Java |
+| 52 | Coding | [Maximum Trapping Water](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch03_TwoPointers/PC4_MaximumTrappingWater) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Two Pointers | Arrays | Java |
+| 53 | Coding | [LinkedList Cycle](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/P1_LinkedListCycle) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Fast and Slow Pointers | Linked List | Java |
+| 54 | Coding | [Length of Linked List Cycle](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/P1_LinkedListCycle/_Variants/P1_LengthOfLinkedListCycle) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Fast and Slow Pointers | Linked List | Java |
+| 55 | Coding | [Start of LinkedList Cycle](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/P2_StartOfLinkedListCycle) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Fast and Slow Pointers | Linked List | Java |
+| 56 | Coding | [Happy Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/P3_HappyNumber) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Fast and Slow Pointers |  | Java |
+| 57 | Coding | [Middle of the LinkedList](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/P4_MiddleOfTheLinkedList) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Fast and Slow Pointers | Linked List | Java |
+| 58 | Coding | [Palindrome LinkedList](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/PC1_PalindromeLinkedList) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Fast and Slow Pointers | Linked List | Java |
+| 59 | Coding | [Rearrange a LinkedList](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/PC2_RearrangeALinkedList) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Fast and Slow Pointers | Linked List | Java |
+| 60 | Coding | [Cycle in a Circular Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch04_FastAndSlowPointers/PC3_CycleInACircularArray) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Fast and Slow Pointers | Arrays | Java |
+| 61 | Coding | [Merge Intervals](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/P1_MergeIntervals) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Merge Intervals | Arrays | Java |
+| 62 | Coding | [Find If Intervals Overlap](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/P1_MergeIntervals/_Variants/FindIfIntervalsOverlap) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Merge Intervals | Arrays | Java |
+| 63 | Coding | [Insert Interval](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/P2_InsertInterval) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Merge Intervals | Arrays | Java |
+| 64 | Coding | [Intervals Intersection](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/P3_IntervalsIntersection) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Merge Intervals | Arrays | Java |
+| 65 | Coding | [Conflicting Appointments](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/P4_ConflictingAppointments) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Merge Intervals | Arrays | Java |
+| 66 | Coding | [Find All Conflicting Appointments](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/P4_ConflictingAppointments/_Variants/P1_FindAllConflictingAppointments) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Merge Intervals | Arrays | Java |
+| 67 | Coding | [Minimum Meeting Rooms](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/PC1_MinimumMeetingRooms) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Merge Intervals | Arrays | Java |
+| 68 | Coding | [Maximum Number Of Intervals Overlap Point](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/PC1_MinimumMeetingRooms/_Variants/P1_MaximumNumberOfIntervalsOverlapPoint) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Merge Intervals | Arrays | Java |
+| 69 | Coding | [Minimum Number of Platforms for Train Station](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/PC1_MinimumMeetingRooms/_Variants/P2_MinimumNumberOfPlatformsForTrainStation) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Merge Intervals | Arrays | Java |
+| 70 | Coding | [Maximum CPU Load](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/PC2_MaximumCpuLoad) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Merge Intervals | Arrays | Java |
+| 71 | Coding | [Employee Free Time](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch05_MergeIntervals/PC3_EmployeeFreeTime) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Merge Intervals | Arrays | Java |
+| 72 | Coding | [Cyclic Sort](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/P1_CyclicSort) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Cyclic Sort | Arrays | Java |
+| 73 | Coding | [Find the Missing Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/P2_FindTheMissingNumber) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Cyclic Sort | Arrays | Java |
+| 74 | Coding | [Find all Missing Numbers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/P3_FindAllMissingNumbers) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Cyclic Sort | Arrays | Java |
+| 75 | Coding | [Find the Duplicate Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/P4_FindTheDuplicateNumber) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Cyclic Sort | Arrays | Java |
+| 76 | Coding | [Find all Duplicate Numbers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/P5_FindAllDuplicateNumbers) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Cyclic Sort | Arrays | Java |
+| 77 | Coding | [Find the Corrupt Pair](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/PC1_FindTheCorruptPair) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Cyclic Sort | Arrays | Java |
+| 78 | Coding | [Find the Smallest Missing Positive Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/PC2_FindTheSmallestMissingPositiveNumber) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Cyclic Sort | Arrays | Java |
+| 79 | Coding | [Find the First K Missing Positive Numbers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch06_CyclicSort/PC3_FindTheFirstKMissingPositiveNumbers) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Cyclic Sort | Arrays | Java |
+| 80 | Coding | [Reverse a LinkedList](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/P1_ReverseALinkedList) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> In-place Reversal of a LinkedList | LinkedList | Java |
+| 81 | Coding | [Reverse a Sub-list](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/P2_ReverseASubList) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> In-place Reversal of a LinkedList | LinkedList | Java |
+| 82 | Coding | [Reverse First K Elements of a LinkedList](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/P2_ReverseASubList/_Variants/P1_ReverseFirstKElementsOfLinkedList) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> In-place Reversal of a LinkedList | LinkedList | Java |
+| 83 | Coding | [Reverse LinkedList based on Even or Odd Size](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/P2_ReverseASubList/_Variants/P2_ReverseLinkedListEvenOddSize) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> In-place Reversal of a LinkedList | LinkedList | Java |
+| 84 | Coding | [Reverse every K-element Sub-list](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/P3_ReverseEveryKElementSubList) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> In-place Reversal of a LinkedList | LinkedList | Java |
+| 85 | Coding | [Reverse alternating K-element Sub-list](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/PC1_ReverseAlternatingKElementSubList) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> In-place Reversal of a LinkedList | LinkedList | Java |
+| 86 | Coding | [Rotate a LinkedList](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch07_InPlaceReversalOfALinkedList/PC2_RotateALinkedList) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> In-place Reversal of a LinkedList | LinkedList | Java |
+| 87 | Coding | [Binary Tree Level Order Traversal](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P1_BinaryTreeLevelOrderTraversal) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Tree Breadth First Search | Binary Tree, Breadth First Search | Java |
+| 88 | Coding | [Reverse Level Order Traversal](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P2_ReverseLevelOrderTraversal) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Tree Breadth First Search | Binary Tree, Breadth First Search | Java |
+| 89 | Coding | [Zigzag Traversal](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P3_ZigzagTraversal) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Tree Breadth First Search | Binary Tree, Breadth First Search | Java |
+| 90 | Coding | [Level Averages in a Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P4_LevelAveragesInABinaryTree) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Tree Breadth First Search | Binary Tree, Breadth First Search | Java |
+| 91 | Coding | [Largest Value on Each Level of a Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P4_LevelAveragesInABinaryTree/_Variants/P1_LargestValueOnEachLevelOfABinaryTree) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Tree Breadth First Search | Binary Tree, Breadth First Search | Java |
+| 92 | Coding | [Minimum Depth of a Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P5_MinimumDepthOfABinaryTree) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Tree Breadth First Search | Binary Tree, Breadth First Search | Java |
+| 93 | Coding | [Maximum Depth of a Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P5_MinimumDepthOfABinaryTree/_Variants/P1_MaximumDepthOfABinaryTree) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Tree Breadth First Search | Binary Tree, Breadth First Search | Java |
+| 94 | Coding | [Level Order Successor](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P6_LevelOrderSuccessor) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Tree Breadth First Search | Binary Tree, Breadth First Search | Java |
+| 95 | Coding | [Connect Level Order Siblings](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/P7_ConnectLevelOrderSiblings) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Tree Breadth First Search | Binary Tree, Breadth First Search | Java |
+| 96 | Coding | [Connect All Level Order Siblings](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/PC1_ConnectAllLevelOrderSiblings) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Tree Breadth First Search | Binary Tree, Breadth First Search | Java |
+| 97 | Coding | [Right View of a Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/PC2_RightViewOfABinaryTree) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Tree Breadth First Search | Binary Tree, Breadth First Search | Java |
+| 98 | Coding | [Left View of a Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch08_TreeBreadthFirstSearch/PC2_RightViewOfABinaryTree/_Variants/P1_LeftViewOfABinaryTree) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Tree Breadth First Search | Binary Tree, Breadth First Search | Java |
+| 99 | Coding | [Binary Tree Path Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P1_BinaryTreePathSum) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Tree Depth First Search | Binary Tree, Depth First Search | Java |
+| 100 | Coding | [All Paths for a Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P2_AllPathsForASum) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Tree Depth First Search | Binary Tree, Depth First Search | Java |
+| 101 | Coding | [All Root to Leaf Paths](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P2_AllPathsForASum/_Variants/P1_AllRootToLeafPaths) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Tree Depth First Search | Binary Tree, Depth First Search | Java |
+| 102 | Coding | [Root to Leaf Path with Maximum Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P2_AllPathsForASum/_Variants/P2_RootToLeafPathMaxSum) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Tree Depth First Search | Binary Tree, Depth First Search | Java |
+| 103 | Coding | [Sum of Path Numbers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P3_SumOfPathNumbers) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Tree Depth First Search | Binary Tree, Depth First Search | Java |
+| 104 | Coding | [Path With Given Sequence](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P4_PathWithGivenSequence) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Tree Depth First Search | Binary Tree, Depth First Search | Java |
+| 105 | Coding | [Count Paths for a Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/P5_CountPathsForASum) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Tree Depth First Search | Binary Tree, Depth First Search | Java |
+| 106 | Coding | [Tree Diameter](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/PC1_TreeDiameter) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Tree Depth First Search | Binary Tree, Depth First Search | Java |
+| 107 | Coding | [Path with Maximum Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch09_TreeDepthFirstSearch/PC2_PathWithMaximumSum) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Tree Depth First Search | Binary Tree, Depth First Search | Java |
+| 108 | Coding | [Find the Median of a Number Stream](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch10_TwoHeaps/P1_FindTheMedianOfANumberStream) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Two Heaps | Two Heaps | Java |
+| 109 | Coding | [Sliding Window Median](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch10_TwoHeaps/P2_SlidingWindowMedian) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Two Heaps | Two Heaps | Java |
+| 110 | Coding | [Maximize Capital](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch10_TwoHeaps/P3_MaximizeCapital) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Two Heaps | Two Heaps | Java |
+| 111 | Coding | [Next Interval](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch10_TwoHeaps/PC1_NextInterval) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Two Heaps | Two Heaps | Java |
+| 112 | Coding | [Subsets](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/P1_Subsets) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Subsets | Subsets | Java |
+| 113 | Coding | [Subsets With Duplicates](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/P2_SubsetsWithDuplicates) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Subsets | Subsets | Java |
+| 114 | Coding | [Permutations](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/P3_Permutations) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Subsets | Subsets | Java |
+| 115 | Coding | [String Permutations by changing case](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/P4_StringPermutationsByChangingCase) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Subsets | Subsets | Java |
+| 116 | Coding | [Balanced Parentheses](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/P5_BalancedParentheses) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Subsets | Subsets | Java |
+| 117 | Coding | [Unique Generalized Abbreviations](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/P6_UniqueGeneralizedAbbreviations) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Subsets | Subsets | Java |
+| 118 | Coding | [Evaluate Expression](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/PC1_EvaluateExpression) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Subsets | Subsets | Java |
+| 119 | Coding | [Structurally Unique Binary Search Trees](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/PC2_StructurallyUniqueBinarySearchTrees) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Subsets | Subsets | Java |
+| 120 | Coding | [Count of Structurally Unique Binary Search Trees](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch11_Subsets/PC3_CountOfStructurallyUniqueBinarySearchTrees) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Subsets | Subsets | Java |
+| 121 | Coding | [Order-agnostic Binary Search](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P1_OrderAgnosticBinarySearch) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 122 | Coding | [Ceiling of a Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P2_CeilingOfANumber) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 123 | Coding | [Floor of a Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P2_CeilingOfANumber/_Variants/P1_FloorOfANumber) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 124 | Coding | [Next Letter](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P3_NextLetter) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 125 | Coding | [Number Range](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P4_NumberRange) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 126 | Coding | [Search in a Sorted Infinite Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P5_SearchInASortedInfiniteArray) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 127 | Coding | [Minimum Difference Element](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P6_MinimumDifferenceElement) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 128 | Coding | [Bitonic Array Maximum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/P7_BitonicArrayMaximum) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 129 | Coding | [Search Bitonic Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/PC1_SearchBitonicArray) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 130 | Coding | [Search in Rotated Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/PC2_SearchInRotatedArray) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 131 | Coding | [Search in Rotated Array with Duplicates](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/PC2_SearchInRotatedArray/_Variants/P1_SearchInRotatedArrayWithDuplicates) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 132 | Coding | [Rotation Count](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/PC3_RotationCount) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 133 | Coding | [Rotation Count with Duplicates](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch12_ModifiedBinarySearch/PC3_RotationCount/_Variants/P1_RotationCountWithDuplicates) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Modified Binary Search | Modified Binary Search | Java |
+| 134 | Coding | [Sum of Elements](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P10_SumOfElements) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Top K Elements | Top K Elements | Java |
+| 135 | Coding | [Rearrange String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P11_RearrangeString) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Top K Elements | Top K Elements | Java |
+| 136 | Coding | [Top 'K' Numbers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P1_TopKNumbers) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Top K Elements | Top K Elements | Java |
+| 137 | Coding | [Kth Smallest Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P2_KthSmallestNumber) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Top K Elements | Top K Elements | Java |
+| 138 | Coding | ['K' Closest Points to the Origin](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P3_KClosestPointsToTheOrigin) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Top K Elements | Top K Elements | Java |
+| 139 | Coding | [Connect Ropes](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P4_ConnectRopes) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Easy, Pattern -> Top K Elements | Top K Elements | Java |
+| 140 | Coding | [Top 'K' Frequent Numbers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P5_TopKFrequentNumbers) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Top K Elements | Top K Elements | Java |
+| 141 | Coding | [Frequency Sort](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P6_FrequencySort) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Top K Elements | Top K Elements | Java |
+| 142 | Coding | [Kth Largest Number in a Stream](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P7_KthLargestNumberInAStream) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Top K Elements | Top K Elements | Java |
+| 143 | Coding | ['K' Closest Numbers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P8_KClosestNumbers) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Top K Elements | Top K Elements | Java |
+| 144 | Coding | [Maximum Distinct Elements](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/P9_MaximumDistinctEKements) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> Top K Elements | Top K Elements | Java |
+| 145 | Coding | [Rearrange String K Distance Apart](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/PC1_RearrangeStringKDistanceApart) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Top K Elements | Top K Elements | Java |
+| 146 | Coding | [Scheduling Tasks](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/PC2_SchedulingTasks) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Top K Elements | Top K Elements | Java |
+| 147 | Coding | [Frequency Stack](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch14_TopKElements/PC3_FrequencyStack) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> Top K Elements | Top K Elements | Java |
+| 148 | Coding | [Merge K Sorted Lists](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/P1_MergeKSortedLists) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> K Way Merge | K Way Merge | Java |
+| 149 | Coding | [Kth Smallest Number in M Sorted Lists](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/P2_KthSmallestNumberInMSortedLists) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> K Way Merge | K Way Merge | Java |
+| 150 | Coding | [Median Among M Sorted Arrays](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/P2_KthSmallestNumberInMSortedLists/_Variants/P1_MedianAmongMSortedArrays) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> K Way Merge | K Way Merge | Java |
+| 151 | Coding | [Merge K Sorted Arrays](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/P2_KthSmallestNumberInMSortedLists/_Variants/P2_MergeKSortedArrays) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> K Way Merge | K Way Merge | Java |
+| 152 | Coding | [Kth Smallest Number in a Sorted Matrix](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/P3_KthSmallestNumberInASortedMatrix) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> K Way Merge | K Way Merge | Java |
+| 153 | Coding | [Smallest Number Range](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/P4_SmallestNumberRange) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> K Way Merge | K Way Merge | Java |
+| 154 | Coding | [K Pairs with Largest Sums](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch15_KWayMerge/PC1_KPairsWithLargestSums) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Hard, Pattern -> K Way Merge | K Way Merge | Java |
+| 155 | Coding | [0/1 Knapsack](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch16_01Knapsack_DynamicProgramming/P1_01Knapsack) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> 0/1 Knapsack (Dynamic Programming) | 0/1 Knapsack, Dynamic Programming | Java |
+| 156 | Coding | [Equal Subset Sum Partition](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheCodingInterview/Ch16_01Knapsack_DynamicProgramming/P2_EqualSubsetSumPartition) | Educative |  | Courses -> Grokking the Coding Interview: Patterns for Coding Questions, Difficulty -> Medium, Pattern -> 0/1 Knapsack (Dynamic Programming) | Dynamic Programming | Java |
+| 157 | Course | [Grokking the System Design Interview](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview) | Educative |  | Courses -> Grokking the System Design Interview | Distributed Systems Design |  |
+| 158 | Systems Design | [Designing an API Rate Limiter](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/ApiRateLimiter) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Medium | Distributed Systems Design |  |
+| 159 | Systems Design | [Designing Dropbox](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/Dropbox) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Medium | Distributed Systems Design |  |
+| 160 | Systems Design | [Designing Facebook Messenger](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/FacebookMessenger) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Medium | Distributed Systems Design |  |
+| 161 | Systems Design | [Designing Facebook's Newsfeed](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/FacebookNewsfeed) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Hard | Distributed Systems Design |  |
+| 162 | Systems Design | [Designing Instagram](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/Instagram) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Medium | Distributed Systems Design |  |
+| 163 | Systems Design | [Designing Pastebin](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/Pastebin) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Easy | Distributed Systems Design |  |
+| 164 | Systems Design | [Design Ticketmaster](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/Ticketmaster) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Hard | Distributed Systems Design |  |
+| 165 | Systems Design | [Designing Twitter](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/Twitter) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Medium | Distributed Systems Design |  |
+| 166 | Systems Design | [Designing Twitter Search](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/TwitterSearch) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Medium | Distributed Systems Design |  |
+| 167 | Systems Design | [Designing Typeahead Suggestion](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/TypeaheadSuggestion) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Medium | Distributed Systems Design |  |
+| 168 | Systems Design | [Designing a URL Shortening service like TinyURL](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/URLShorteningServiceLikeTinyURL) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Easy | Distributed Systems Design |  |
+| 169 | Systems Design | [Designing Uber backend](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/UberBackend) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Hard | Distributed Systems Design |  |
+| 170 | Systems Design | [Designing a Web Crawler](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/WebCrawler) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Hard | Distributed Systems Design |  |
+| 171 | Systems Design | [Designing Yelp or Nearby Friends](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/YelpOrNearlyFriends) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Hard | Distributed Systems Design |  |
+| 172 | Systems Design | [Designing Youtube or Netflix](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/EducativeIo/Courses/GrokkingTheSystemDesignInterview/02-SystemDesignProblems/YoutubeOrNetflix) | Educative |  | Courses -> Grokking the System Design Interview, Difficulty -> Medium | Distributed Systems Design |  |
+| 173 | Coding | [Q0 Boot Camp](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q0_BootCamp) | Elements of Programming Interviews |  | Books | Primitive Types | Java |
+| 174 | Coding | [Q1 Compute Parity Of Word](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q1_ComputeParityOfWord) | Elements of Programming Interviews |  | Books | Primitive Types | Java |
+| 175 | Coding | [Q2 Swap Bits](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q2_SwapBits) | Elements of Programming Interviews |  | Books | Primitive Types | Java |
+| 176 | Coding | [Q3 Reverse Bits](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q3_ReverseBits) | Elements of Programming Interviews |  | Books | Primitive Types | Java |
+| 177 | Coding | [Q4 Find Closest Int With Same Weight](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q4_FindClosestIntWithSameWeight) | Elements of Programming Interviews |  | Books | Primitive Types | Java |
+| 178 | Coding | [Q5 Multiply Without Arithmetical Operators](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q5_MultiplyWithoutArithmeticalOperators) | Elements of Programming Interviews |  | Books | Primitive Types | Java |
+| 179 | Coding | [Q6 Compute Division](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q6_ComputeDivision) | Elements of Programming Interviews |  | Books | Primitive Types | Java |
+| 180 | Coding | [Q7 Compute Power](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q7_ComputePower) | Elements of Programming Interviews |  | Books | Primitive Types | Java |
+| 181 | Coding | [Q8 Reverse Digits](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q8_ReverseDigits) | Elements of Programming Interviews |  | Books | Primitive Types | Java |
+| 182 | Coding | [Q9 Decimal Integer Palindrome Check](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C5_PrimitiveTypes/Q9_DecimalIntegerPalindromeCheck) | Elements of Programming Interviews |  | Books | Primitive Types | Java |
+| 183 | Coding | [Computing An Alternation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/ComputingAnAlternation) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 184 | Coding | [Q0 Boot Camp](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q0_BootCamp) | Elements of Programming Interviews |  | Books | Arrays | Java, Python |
+| 185 | Coding | [Q10 Compute The Next Permutation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q10_ComputeTheNextPermutation) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 186 | Coding | [Previous Permutation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q10_ComputeTheNextPermutation/Variants/PreviousPermutation) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 187 | Coding | [kth Permutation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q10_ComputeTheNextPermutation/Variants/kthPermutation) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 188 | Coding | [Q11 Sample Offline Data](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q11_SampleOfflineData) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 189 | Coding | [Q12 Sample Online Data](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q12_SampleOnlineData) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 190 | Coding | [Q13 Compute Random Permutation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q13_ComputeRandomPermutation) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 191 | Coding | [Q14 Compute Random Subset](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q14_ComputeRandomSubset) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 192 | Coding | [Q1 Dutch National Flag](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q1_DutchNationalFlag) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 193 | Coding | [Q2 Increment An Arbitrary Precision Integer](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q2_IncrementAnArbitraryPrecisionInteger) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 194 | Coding | [Q3 Multiply Two Arbitrary Precision Integers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q3_MultiplyTwoArbitraryPrecisionIntegers) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 195 | Coding | [Q4 Advancing Through An Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q4_AdvancingThroughAnArray) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 196 | Coding | [Min Number Of Steps](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q4_AdvancingThroughAnArray/Variants/MinNumberOfSteps) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 197 | Coding | [Q5 Delete Duplicates From Sorted Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q5_DeleteDuplicatesFromSortedArray) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 198 | Coding | [Limit Duplicates](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q5_DeleteDuplicatesFromSortedArray/Variants/LimitDuplicates) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 199 | Coding | [Q6 Buy And Sell Stock Once](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q6_BuyAndSellStockOnce) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 200 | Coding | [Q7 Buy And Sell Stock Twice](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q7_BuyAndSellStockTwice) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 201 | Coding | [Q8 Enumerate All Primes To N](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q8_EnumerateAllPrimesToN) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 202 | Coding | [Q9 Permute Elements Of Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/ElementsOfProgrammingInterviews/src/Book/C6_Arrays/Q9_PermuteElementsOfArray) | Elements of Programming Interviews |  | Books | Arrays | Java |
+| 203 | Coding | [Binary Search On Array Of Integers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Firecode/src/Problems/Level1/BinarySearchOnArrayOfIntegers) | Firecode | Oracle | Level1 | Strings, Arrays | Java |
+| 204 | Coding | [Find the First Non Duplicate Character in a String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Firecode/src/Problems/Level1/FindFirstNonDuplicateCharacterInAString) | Firecode | Oracle | Level1 | Strings, Hash Tables | Java |
+| 205 | Coding | [Flip It](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Firecode/src/Problems/Level1/FlipIt) | Firecode | Infosys | Level1 | Arrays, Multi Dimensional Arrays | Java |
+| 206 | Coding | [Palindrome Tester](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Firecode/src/Problems/Level1/PalindromeTester) | Firecode |  | Level1 | Strings, Arrays | Java |
+| 207 | Coding | [Repeated Elements In An Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Firecode/src/Problems/Level1/RepeatedElementsInAnArray) | Firecode | Bloomberg | Level1 | Arrays | Java |
+| 208 | Coding | [Reverse A String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Firecode/src/Problems/Level1/ReverseAString) | Firecode | Microsoft | Level1 | Strings | Java |
+| 209 | Coding | [Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/BillRyan/src/AlgorithmExercise/Part1_Basics/BasicDataStructure/BinaryTree) | GitHub Repository |  | GitHub -> billryan - yuanbin -> Algorithm Exercise | Binary Tree | Java |
+| 210 | Coding | [Linked List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/BillRyan/src/AlgorithmExercise/Part1_Basics/BasicDataStructure/LinkedList) | GitHub Repository |  | GitHub -> billryan - yuanbin -> Algorithm Exercise | Linked List | Java |
+| 211 | Reading | [System Design Interview](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview) | GitHub Repository |  | GitHub -> checkcheckzz -> System Design Interview | Distributed Systems Design, Object Oriented Design |  |
+| 212 | Reading | [Fallacies of Distributed Systems](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/FallaciesOfDistributedSystems) | Notes - Article |  | GitHub -> checkcheckzz -> System Design Interview, Articles, Authors -> Arnon Rotem-Gal-Oz | Distributed Systems Design |  |
+| 213 | Reading | [How to Ace a Systems Design Interview](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/HowToRockASystemsDesignInterview) | Notes - Blog Post |  | GitHub -> checkcheckzz -> System Design Interview, Blogs -> Palantir Blog |  |  |
+| 214 | Reading | [Introduction to architecting systems for scale](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/IntroductionToArchitectingSystemsForScale) | Notes - Blog Post |  | GitHub -> checkcheckzz -> System Design Interview, Blogs -> Irrational Exuberance!, Authors -> Will Larson | Distributed Systems Design |  |
+| 215 | Reading | [Numbers Everyone Should Know](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/NumbersEveryoneShouldKnow) | Notes - Blog Post |  | GitHub -> checkcheckzz -> System Design Interview, Blogs -> Everything is Data, Authors -> Neil Conway | Distributed Systems Design |  |
+| 216 | Reading | [Scalability for Dummies](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/ScalabilityForDummies) | Notes - Blog Post |  | GitHub -> checkcheckzz -> System Design Interview, Blogs -> Le Cloud Blog, Authors -> Sebastian Kreutzberger | Distributed Systems Design |  |
+| 217 | Reading | [Scalable System Design Patterns](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/ScalableSystemDesignPatterns) | Notes - Blog Post |  | GitHub -> checkcheckzz -> System Design Interview, Blogs -> Pragmatic Programming Techniques, Authors -> Ricky Ho | Distributed Systems Design |  |
+| 218 | Reading | [Scalable Web Architecture and Distributed Systems](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/GitHubRepository/checkcheckzz/system-design-interview/02_BasicKnowledgeAboutSystemDesign/ScalableWebArchitectureAndDistributedSystems) | Notes - Book Chapter |  | GitHub -> checkcheckzz -> System Design Interview, Books -> The Architecture of Open Source Applications, Volume II, Authors -> Kate Matsudaira | Distributed Systems Design |  |
+| 219 | Coding | [Number Of Strings From Encoded Alphabet](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Glassdoor/src/Facebook/NumberOfStringsFromEncodedAlphabet) | Glassdoor | Facebook |  | Strings | Python |
+| 220 | Coding | [HackerRank In A String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Contests/RookieRank2/HackerRankInAString) | HackerRank |  | Contests -> RookieRank 2 |  | Java |
+| 221 | Coding | [KnightL On A Chessboard](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Contests/RookieRank2/KnightLOnAChessboard) | HackerRank |  | Contests -> RookieRank 2 |  | Java |
+| 222 | Coding | [Migratory Birds](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Contests/RookieRank2/MigratoryBirds) | HackerRank |  | Contests -> RookieRank 2 |  | Java |
+| 223 | Coding | [Minimum Absolute Difference In An Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Contests/RookieRank2/MinimumAbsoluteDifferenceInAnArray) | HackerRank |  | Contests -> RookieRank 2 |  | Java |
+| 224 | Coding | [Dam Design](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Miscellaneous/DamDesign) | HackerRank |  | Difficulty -> Easy | Arrays | Python |
+| 225 | Coding | [Divisible Sum Pairs](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Implementation/DivisibleSumPairs) | HackerRank |  | Tracks -> Problem Solving -> Algorithms -> Implementation, Difficulty -> Easy |  | Java |
+| 226 | Coding | [A Very Big Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/AVeryBigSum) | HackerRank |  | Tracks -> Problem Solving -> Algorithms -> Warmup |  | Java |
+| 227 | Coding | [Circular Array Rotation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/CircularArrayRotation) | HackerRank |  | Tracks -> Problem Solving -> Algorithms -> Warmup |  | Java |
+| 228 | Coding | [Compare The Triplets](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/CompareTheTriplets) | HackerRank |  | Tracks -> Problem Solving -> Algorithms -> Warmup |  | Java |
+| 229 | Coding | [Diagonal Difference](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/DiagonalDifference) | HackerRank |  | Tracks -> Problem Solving -> Algorithms -> Warmup |  | Java |
+| 230 | Coding | [Plus Minus](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/PlusMinus) | HackerRank |  | Tracks -> Problem Solving -> Algorithms -> Warmup |  | Java |
+| 231 | Coding | [Simple Array Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/SimpleArraySum) | HackerRank |  | Tracks -> Problem Solving -> Algorithms -> Warmup |  | Java |
+| 232 | Coding | [Solve Me First](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/SolveMeFirst) | HackerRank |  | Tracks -> Problem Solving -> Algorithms -> Warmup |  | Java |
+| 233 | Coding | [Staircase](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/Staircase) | HackerRank |  | Tracks -> Problem Solving -> Algorithms -> Warmup |  | Java |
+| 234 | Coding | [Time Conversion](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/Algorithms/Warmup/TimeConversion) | HackerRank |  | Tracks -> Problem Solving -> Algorithms -> Warmup |  | Java |
+| 235 | Coding | [Arrays_DS](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/DataStructures/Arrays/Arrays_DS) | HackerRank |  | Tracks -> Problem Solving -> Data Structures | Arrays | Java |
+| 236 | Coding | [2DArray_DS](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/DataStructures/Arrays/TwoDArray_DS) | HackerRank |  | Tracks -> Problem Solving -> Data Structures | Arrays | Java |
+| 237 | Coding | [Reverse A Linked List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/ProblemSolving/DataStructures/LinkedLists/ReverseALinkedList) | HackerRank |  | Tracks -> Problem Solving -> Data Structures | Linked Lists | Java |
+| 238 | Coding | [D0 Hello World](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D0_HelloWorld) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 239 | Coding | [D10 Binary Numbers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D10_BinaryNumbers) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 240 | Coding | [D11 2D Arrays](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D11_2DArrays) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 241 | Coding | [D12 Inheritance](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D12_Inheritance) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 242 | Coding | [D13 Abstract Classes](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D13_AbstractClasses) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 243 | Coding | [D14 Scope](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D14_Scope) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 244 | Coding | [D15 Linked List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D15_LinkedList) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 245 | Coding | [D16 Exceptions String To Integer](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D16_Exceptions_StringToInteger) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 246 | Coding | [D17 More Exceptions](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D17_MoreExceptions) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 247 | Coding | [D18 Queues And Stacks](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D18_QueuesAndStacks) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 248 | Coding | [D19 Interfaces](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D19_Interfaces) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 249 | Coding | [D1 Data Types](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D1_DataTypes) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 250 | Coding | [D20 Sorting](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D20_Sorting) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 251 | Coding | [D21 Generics](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D21_Generics) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 252 | Coding | [D22 Binary Search Trees](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D22_BinarySearchTrees) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 253 | Coding | [D23 BST Level Order Traversal](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D23_BSTLevelOrderTraversal) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 254 | Coding | [D24 More Linked Lists](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D24_MoreLinkedLists) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 255 | Coding | [D25 Running Time And Complexity](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D25_RunningTimeAndComplexity) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 256 | Coding | [D26 Nested Logic](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D26_NestedLogic) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 257 | Coding | [D27 Testing](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D27_Testing) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 258 | Coding | [D28 RegEx Patterns And Intro To Databases](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D28_RegExPatternsAndIntroToDatabases) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 259 | Coding | [D29 Bitwise AND](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D29_BitwiseAND) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 260 | Coding | [D2 Operators](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D2_Operators) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 261 | Coding | [D3 Intro To Conditional Statements](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D3_IntroToConditionalStatements) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 262 | Coding | [D4 Class Vs Instance](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D4_ClassVsInstance) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 263 | Coding | [D5 Loops](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D5_Loops) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 264 | Coding | [D6 Lets Review](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D6_LetsReview) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 265 | Coding | [D7 Arrays](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D7_Arrays) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 266 | Coding | [D8 Dictionaries And Maps](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D8_DictionariesAndMaps) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 267 | Coding | [D9 Recursion](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/HackerRank/src/Tracks/Tutorials/ThirtyDaysOfCode/D9_Recursion) | HackerRank |  | Tracks -> Tutorials -> Thirty Days of Code |  | Java |
+| 268 | Coding | [amortized1](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/AmortizedComplexity/amortized1) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 269 | Coding | [choose4](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/BasicPrimer/choose4) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 270 | Coding | [loop_cmpl](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/BasicPrimer/loop_cmpl) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 271 | Coding | [nested_cmpl](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/BasicPrimer/nested_cmpl) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 272 | Coding | [nested_cmpl2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/BasicPrimer/nested_cmpl2) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 273 | Coding | [choose1](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/CompareFunctions/choose1) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 274 | Coding | [choose2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/CompareFunctions/choose2) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 275 | Coding | [choose3](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/CompareFunctions/choose3) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 276 | Coding | [rec_cmpl1](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/FunctionCallingItself/rec_cmpl1) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 277 | Coding | [rec_cmpl2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/FunctionCallingItself/rec_cmpl2) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 278 | Coding | [rec_cmpl3](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/FunctionCallingItself/rec_cmpl3) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 279 | Coding | [gcd_cmpl](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/Math/gcd_cmpl) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 280 | Coding | [loop_cmpl2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/Math/loop_cmpl2) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 281 | Coding | [nested_cmpl3](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/Math/nested_cmpl3) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 282 | Coding | [while_cmpl](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level1_TimeComplexity/Problems/Math/while_cmpl) | InterviewBit |  | Courses -> Programming | Time Complexity |  |
+| 283 | Coding | [Spiral Order Matrix 1](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Examples/SpiralOrderMatrix1) | InterviewBit | Microsoft, JPMorgan, Amazon, Flipkart | Courses -> Programming | Arrays | Java |
+| 284 | Coding | [Array Bug](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Primers/ArrayBug) | InterviewBit |  | Courses -> Programming | Arrays | Java |
+| 285 | Coding | [Array 2D](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Primers/Array_2D) | InterviewBit |  | Courses -> Programming | Arrays | Java |
+| 286 | Coding | [Array Impl 1](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Primers/Array_impl1) | InterviewBit |  | Courses -> Programming | Arrays | Java |
+| 287 | Coding | [Largest Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/Arrangement/LargestNumber) | InterviewBit | Amazon | Courses -> Programming | Arrays | Java |
+| 288 | Coding | [Rotate Matrix](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/Arrangement/RotateMatrix) | InterviewBit | Google, Facebook, Amazon | Courses -> Programming | Arrays | Java |
+| 289 | Coding | [Add One To Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/ArrayMath/AddOneToNumber) | InterviewBit | Google | Courses -> Programming | Arrays | Java |
+| 290 | Coding | [Min Steps In Infinite Grid](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/ArrayMath/MinStepsInInfiniteGrid) | InterviewBit | Directi | Courses -> Programming | Arrays | Java |
+| 291 | Coding | [Noble Integer](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/Bucketing/NobleInteger) | InterviewBit |  | Courses -> Programming | Arrays | Java |
+| 292 | Coding | [Wave Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/BucketingOrSorting/WaveArray) | InterviewBit | Google, Adobe | Courses -> Programming | Arrays | Java |
+| 293 | Coding | [First Missing Integer](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/MissingOrRepeatedNumber/FirstMissingInteger) | InterviewBit | Model N, InMobi | Courses -> Programming | Arrays | Java |
+| 294 | Coding | [Max Non Negative SubArray](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/SimulationArray/MaxNonNegativeSubArray) | InterviewBit | Google | Courses -> Programming | Arrays | Java |
+| 295 | Coding | [Spiral Order Matrix 2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/SimulationArray/SpiralOrderMatrix2) | InterviewBit | Microsoft, JPMorgan, Amazon | Courses -> Programming | Arrays | Java |
+| 296 | Coding | [Set Matrix Zeros](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/SpaceRecycle/SetMatrixZeros) | InterviewBit | Oracle, Amazon | Courses -> Programming | Arrays | Java |
+| 297 | Coding | [Merge Intervals](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/Problems/ValueRanges/MergeIntervals) | InterviewBit | Google | Courses -> Programming | Arrays | Java |
+| 298 | Coding | [Bubble Sort](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/SortingAlgorithms/BubbleSort) | InterviewBit |  | Courses -> Programming, Known Algorithms | Arrays, Sorting | Java |
+| 299 | Coding | [Insertion Sort](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/SortingAlgorithms/InsertionSort) | InterviewBit |  | Courses -> Programming, Known Algorithms | Arrays, Sorting | Java |
+| 300 | Coding | [Merge Sort](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/SortingAlgorithms/MergeSort) | InterviewBit |  | Courses -> Programming, Known Algorithms | Arrays, Sorting | Java |
+| 301 | Coding | [Quick Sort](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/SortingAlgorithms/QuickSort) | InterviewBit |  | Courses -> Programming, Known Algorithms | Arrays, Sorting | Java |
+| 302 | Coding | [Selection Sort](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Arrays/SortingAlgorithms/SelectionSort) | InterviewBit |  | Courses -> Programming, Known Algorithms | Arrays, Sorting | Java |
+| 303 | Coding | [All Factors](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Examples/AllFactors) | InterviewBit |  | Courses -> Programming | Math | Java |
+| 304 | Coding | [Binary Representation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Examples/BinaryRepresentation) | InterviewBit |  | Courses -> Programming | Math | Java |
+| 305 | Coding | [Prime Numbers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Examples/PrimeNumbers) | InterviewBit |  | Courses -> Programming | Math | Java |
+| 306 | Coding | [Verify Prime](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Examples/VerifyPrime) | InterviewBit |  | Courses -> Programming | Math | Java |
+| 307 | Coding | [Math Bug01](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Primers/Math_Bug01) | InterviewBit |  | Courses -> Programming | Math | Java |
+| 308 | Coding | [Math Bug02](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Primers/Math_Bug02) | InterviewBit |  | Courses -> Programming | Math | Java |
+| 309 | Coding | [Prime Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/AdHoc/PrimeSum) | InterviewBit | Epic Systems | Courses -> Programming | Math | Java |
+| 310 | Coding | [Sum Of Pairwise Hamming Distance](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/AdHoc/SumOfPairwiseHammingDistance) | InterviewBit | Google | Courses -> Programming | Math | Java |
+| 311 | Coding | [Numbers Of Length N And Values Less Than K](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/ArrayDp/NumbersOfLengthNAndValuesLessThanK) | InterviewBit | Google | Courses -> Programming | Math | Java |
+| 312 | Coding | [Excel Column Title](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/BaseConversion/ExcelColumnTitle) | InterviewBit | Amazon | Courses -> Programming | Math | Java |
+| 313 | Coding | [Grid Unique Paths](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/Combinatorics/GridUniquePaths) | InterviewBit | Google, Amazon, Microsoft, Adobe | Courses -> Programming | Math | Java |
+| 314 | Coding | [Palindrome Integer](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/DigitOp/PalindromeInteger) | InterviewBit | HCL | Courses -> Programming | Math | Java |
+| 315 | Coding | [Reverse Integer](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/DigitOp/ReverseInteger) | InterviewBit | HCL, Bloomberg | Courses -> Programming | Math | Java |
+| 316 | Coding | [Rearrange Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/NumberEncoding/RearrangeArray) | InterviewBit | Facebook | Courses -> Programming | Math | Java |
+| 317 | Coding | [Greatest Common Divisor](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/NumberTheory/GreatestCommonDivisor) | InterviewBit | Google, NetApp | Courses -> Programming | Math | Java |
+| 318 | Coding | [Sorted Permutation Rank With Repeats](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/NumberTheory/SortedPermutationRankWithRepeats) | InterviewBit | Housing, Zenefits | Courses -> Programming | Math | Java |
+| 319 | Coding | [Trailing Zeros In Factorial](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level2_Math/Problems/NumberTheory/TrailingZerosInFactorial) | InterviewBit | Microsoft, Jabong, Zillow | Courses -> Programming | Math | Java |
+| 320 | Coding | [Find Element Occurrence](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Examples/FindElementOccurrence) | InterviewBit |  | Courses -> Programming | Binary Search | Java |
+| 321 | Coding | [Rotated Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Examples/RotatedArray) | InterviewBit | Facebook | Courses -> Programming | Binary Search | Java |
+| 322 | Coding | [Square Root Of Integer](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Problems/SearchAnswer/SquareRootOfInteger) | InterviewBit | Facebook, Amazon, Microsoft | Courses -> Programming | Binary Search | Java |
+| 323 | Coding | [Implement Power Function](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Problems/SearchStepSimulation/ImplementPowerFunction) | InterviewBit | Google, LinkedIn | Courses -> Programming | Binary Search | Java |
+| 324 | Coding | [Search For A Range](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Problems/SimpleBinarySearch/SearchForARange) | InterviewBit | Google, Microsoft | Courses -> Programming | Binary Search | Java |
+| 325 | Coding | [Median Of Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Problems/SortModification/MedianOfArray) | InterviewBit | Amazon, VMware, Google, Microsoft | Courses -> Programming | Binary Search | Java |
+| 326 | Coding | [Rotated Sorted Array Search](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BinarySearch/Problems/SortModification/RotatedSortedArraySearch) | InterviewBit | Facebook, Google, Microsoft | Courses -> Programming | Binary Search | Java |
+| 327 | Coding | [Single Number 2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BitManipulation/Problems/BitArray/SingleNumber2) | InterviewBit | Google, Amazon | Courses -> Programming | Bit Manipulation | Java |
+| 328 | Coding | [Different Bits Sum Pairwise](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BitManipulation/Problems/BitPlay/DifferentBitsSumPairwise) | InterviewBit | Google | Courses -> Programming | Bit Manipulation | Java |
+| 329 | Coding | [Min XOR Value](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_BitManipulation/Problems/Bucketing/MinXorValue) | InterviewBit | Booking.com | Courses -> Programming | Bit Manipulation | Java |
+| 330 | Coding | [Justified Text](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/PrettyPrint/JustifiedText) | InterviewBit | LinkedIn, Google | Courses -> Programming | Strings | Java |
+| 331 | Coding | [Add Binary Strings](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringMath/AddBinaryStrings) | InterviewBit | Facebook | Courses -> Programming | Strings | Java |
+| 332 | Coding | [Integer To Roman](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringMath/IntegerToRoman) | InterviewBit | Amazon, Facebook, Microsoft, Twitter | Courses -> Programming | Strings | Java |
+| 333 | Coding | [Multiply Strings](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringMath/MultiplyStrings) | InterviewBit | Microsoft, Google | Courses -> Programming | Strings | Java |
+| 334 | Coding | [Roman To Integer](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringMath/RomanToInteger) | InterviewBit | Amazon, Facebook, Microsoft, Twitter | Courses -> Programming | Strings | Java |
+| 335 | Coding | [Atoi](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringParsing/Atoi) | InterviewBit | Adobe, Nvidia, Agilent Systems, Bloomberg, Amazon, Apple, Microsoft, Groupon | Courses -> Programming | Strings | Java |
+| 336 | Coding | [Implement StrStr](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringSearch/ImplementStrStr) | InterviewBit | Facebook, Amazon, Qualcomm, Wipro, Microsoft | Courses -> Programming | Strings | Java |
+| 337 | Coding | [Count And Say](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringSimulation/CountAndSay) | InterviewBit | Facebook | Courses -> Programming | Strings | Java |
+| 338 | Coding | [Longest Common Prefix](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringSimulation/LongestCommonPrefix) | InterviewBit | Google | Courses -> Programming | Strings | Java |
+| 339 | Coding | [Palindrome String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringSimulation/PalindromeString) | InterviewBit | Google | Courses -> Programming | Strings | Java |
+| 340 | Coding | [Longest Palindromic Substring](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/StringTricks/LongestPalindromicSubstring) | InterviewBit | Amazon, Microsoft, Groupon | Courses -> Programming | Strings | Java |
+| 341 | Coding | [Reverse The String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_Strings/Problems/Words/ReverseTheString) | InterviewBit | Qualcomm, Amazon, Microsoft, Cisco, Facebook | Courses -> Programming | Strings | Java |
+| 342 | Coding | [Remove Duplicates From Sorted Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_TwoPointers/Problems/InplaceUpdate/RemoveDuplicatesFromSortedArray) | InterviewBit | United Healthgroup, Amazon, Google, Microsoft, Expedia | Courses -> Programming | Two Pointers | Java |
+| 343 | Coding | [Intersection Of Sorted Arrays](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_TwoPointers/Problems/MultipleArrays/IntersectionOfSortedArrays) | InterviewBit | Facebook, Google | Courses -> Programming | Two Pointers | Java |
+| 344 | Coding | [Three Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_TwoPointers/Problems/Sorting/ThreeSum) | InterviewBit | Facebook, Amazon, Microsoft | Courses -> Programming | Two Pointers | Java |
+| 345 | Coding | [Container With Most Water](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_TwoPointers/Problems/Tricks/ContainerWithMostWater) | InterviewBit | Facebook, Google | Courses -> Programming | Two Pointers | Java |
+| 346 | Coding | [Minimize The Absolute Difference](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level3_TwoPointers/Problems/TwoPointer/MinimizeAbsoluteDifference) | InterviewBit |  | Courses -> Programming | Two Pointers | Java |
+| 347 | Coding | [Intersection of Linked Lists](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Examples/IntersectionOfLinkedLists) | InterviewBit | Amazon, Microsoft, NetApp, Apache Design | Courses -> Programming | Linked Lists | Java |
+| 348 | Coding | [Reverse Linked List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Examples/ReverseLinkedList) | InterviewBit |  | Courses -> Programming | Linked Lists | Java |
+| 349 | Coding | [Reverse Link List 2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Problems/List2Pointer/ReverseLinkList2) | InterviewBit | Facebook, Microsoft, Amazon | Courses -> Programming | Linked Lists | Java |
+| 350 | Coding | [List Cycle](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Problems/ListCycle/ListCycle) | InterviewBit | Amazon, Microsoft, NetApp | Courses -> Programming | Linked Lists | Java |
+| 351 | Coding | [Add Two Numbers As Lists](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Problems/ListMath/AddTwoNumbersAsLists) | InterviewBit | Amazon, Qualcomm, Microsoft, Facebook | Courses -> Programming | Linked Lists | Java |
+| 352 | Coding | [Insertion Sort List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Problems/ListSort/InsertionSortList) | InterviewBit | Microsoft, Google | Courses -> Programming | Linked Lists | Java |
+| 353 | Coding | [Reorder List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_LinkedLists/Problems/PointerMove/ReorderList) | InterviewBit | Amazon | Courses -> Programming | Linked Lists | Java |
+| 354 | Coding | [Generate All Parentheses](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_StacksAndQueues/Examples/GenerateAllParentheses) | InterviewBit | Amazon | Courses -> Programming | Stacks, Queues | Java |
+| 355 | Coding | [Reverse String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_StacksAndQueues/Examples/ReverseString) | InterviewBit |  | Courses -> Programming | Stacks, Queues | Java |
+| 356 | Coding | [Largest Rectangle In Histogram](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_StacksAndQueues/Problems/CleverStack/LargestRectangleInHistogram) | InterviewBit | Google, Facebook | Courses -> Programming | Stacks, Queues | Java |
+| 357 | Coding | [Min Stack](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_StacksAndQueues/Problems/MultipleStack/MinStack) | InterviewBit | Yahoo, Amazon, Adobe | Courses -> Programming | Stacks, Queues | Java |
+| 358 | Coding | [Evaluate Expression](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_StacksAndQueues/Problems/StackMath/EvaluateExpression) | InterviewBit | Yahoo, Google, Facebook | Courses -> Programming | Stacks, Queues | Java |
+| 359 | Coding | [Redundant Braces](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level4_StacksAndQueues/Problems/StackSimple/RedundantBraces) | InterviewBit | Amazon | Courses -> Programming | Stacks, Queues | Java |
+| 360 | Coding | [Modular Expression](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Examples/ModularExpression) | InterviewBit |  | Courses -> Programming | Backtracking | Java |
+| 361 | Coding | [Reverse Linked List Recursion](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Examples/ReverseLinkedListRecursion) | InterviewBit |  | Courses -> Programming | Backtracking | Java |
+| 362 | Coding | [Palindrome Partitioning](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Problems/BruteForceBuilder/PalindromePartitioning) | InterviewBit | Amazon, Google | Courses -> Programming | Backtracking | Java |
+| 363 | Coding | [NQueens](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Problems/GameSolving/NQueens) | InterviewBit | Qualcomm, Google, Amazon, Splunk | Courses -> Programming | Backtracking | Java |
+| 364 | Coding | [Kth Permutation Sequence](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Problems/MathsAndBacktracking/KthPermutationSequence) | InterviewBit | Amazon | Courses -> Programming | Backtracking | Java |
+| 365 | Coding | [Permutations](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Problems/Permutations/Permutations) | InterviewBit | Microsoft, Adobe, Google | Courses -> Programming | Backtracking | Java |
+| 366 | Coding | [Generated All Parentheses 2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Problems/PrunedBuilder/GenerateAllParentheses2) | InterviewBit | Facebook, Microsoft | Courses -> Programming | Backtracking | Java |
+| 367 | Coding | [Combination Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Backtracking/Problems/Subsets/CombinationSum) | InterviewBit | Facebook, Amazon, Adobe | Courses -> Programming | Backtracking | Java |
+| 368 | Coding | [Four Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Hashing/Problems/HashSearch/FourSum) | InterviewBit | Amazon, Google | Courses -> Programming | Hashing | Java |
+| 369 | Coding | [Two Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Hashing/Problems/HashSearch/TwoSum) | InterviewBit | Facebook, Amazon, Google | Courses -> Programming | Hashing | Java |
+| 370 | Coding | [Window String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Hashing/Problems/HashingTwoPointer/WindowString) | InterviewBit | Google, Directi | Courses -> Programming | Hashing | Java, Python |
+| 371 | Coding | [Substring Concatenation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Hashing/Problems/IncrementalHash/SubstringConcatenation) | InterviewBit | Facebook | Courses -> Programming | Hashing | Java |
+| 372 | Coding | [Equal](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Hashing/Problems/KeyFormation/Equal) | InterviewBit | Facebook | Courses -> Programming | Hashing | Java, Python |
+| 373 | Coding | [Points On The Straight Line](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level5_Hashing/Problems/MathsAndHashing/PointsOnTheStraightLine) | InterviewBit | Google, Amazon, InMobi | Courses -> Programming | Hashing | Java |
+| 374 | Coding | [Merge K Sorted Lists](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_HeapsAndMaps/Problems/Heap/MergeKSortedLists) | InterviewBit | Flipkart, Amazon, Google | Courses -> Programming | Heaps, Maps | Java |
+| 375 | Coding | [LRU Cache](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_HeapsAndMaps/Problems/Heapmap/LruCache) | InterviewBit | Adobe, Citigroup, Amazon | Courses -> Programming | Heaps, Maps | Java |
+| 376 | Coding | [Ways To Form Max Heap](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_HeapsAndMaps/Problems/Math/WaysToFormMaxHeap) | InterviewBit | Directi | Courses -> Programming | Heaps, Maps | Java |
+| 377 | Coding | [Next Greater Number Bst](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Examples/NextGreaterNumberBst) | InterviewBit |  | Courses -> Programming | Trees | Java |
+| 378 | Coding | [Valid Binary Search Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Examples/ValidBinarySearchTree) | InterviewBit | Amazon, Facebook | Courses -> Programming | Trees | Java |
+| 379 | Coding | [BST Iterator](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/BstTraversal/BstIterator) | InterviewBit | Apple, Amazon, Facebook | Courses -> Programming | Trees | Java |
+| 380 | Coding | [Kth Smallest Element In Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/BstTraversal/KthSmallestElementInTree) | InterviewBit | Amazon | Courses -> Programming | Trees | Java |
+| 381 | Coding | [Recover Binary Search Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/BstTraversal/RecoverBinarySearchTree) | InterviewBit | Microsoft | Courses -> Programming | Trees | Java |
+| 382 | Coding | [Two Sum Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/BstTraversal/TwoSumBinaryTree) | InterviewBit | Amazon | Courses -> Programming | Trees | Java |
+| 383 | Coding | [Invert The Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/InPlaceChange/InvertTheBinaryTree) | InterviewBit | Google | Courses -> Programming | Trees | Java |
+| 384 | Coding | [Order of People Heights](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/IntervalTree/OrderOfPeopleHeights) | InterviewBit | Google | Courses -> Programming | Trees | Java |
+| 385 | Coding | [ZigZag Level Order Traversal BT](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/LevelOrder/ZigZagLevelOrderTraversalBt) | InterviewBit | Amazon | Courses -> Programming | Trees | Java |
+| 386 | Coding | [Flatten Binary Tree To LinkedList](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/LinkedListTree/FlattenBinaryTreeToLinkedList) | InterviewBit | Adobe, Amazon, Microsoft | Courses -> Programming | Trees | Java |
+| 387 | Coding | [Root to Leaf Paths With Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/RootToLeaf/RootToLeafPathsWithSum) | InterviewBit | Microsoft, Yahoo, Amazon | Courses -> Programming | Trees | Java |
+| 388 | Coding | [Balanced Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/SimpleTreeOps/BalancedBinaryTree) | InterviewBit | Amazon | Courses -> Programming | Trees | Java |
+| 389 | Coding | [InOrder Traversal](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/Traversal/InOrderTraversal) | InterviewBit | Amazon, Microsoft | Courses -> Programming | Trees | Java |
+| 390 | Coding | [PostOrder Traversal](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/Traversal/PostOrderTraversal) | InterviewBit | Amazon, Microsoft | Courses -> Programming | Trees | Java |
+| 391 | Coding | [PreOrder Traversal](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/Traversal/PreOrderTraversal) | InterviewBit | Amazon, Microsoft | Courses -> Programming | Trees | Java |
+| 392 | Coding | [Vertical Order Traversal Of Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/Traversal/VerticalOrderTraversalOfBinaryTree) | InterviewBit | Amazon | Courses -> Programming | Trees | Java |
+| 393 | Coding | [Binary Tree From InOrder And PostOrder](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/TreeConstruction/BinaryTreeFromInorderAndPostorder) | InterviewBit | Amazon, Microsoft | Courses -> Programming | Trees | Java |
+| 394 | Coding | [Construct Binary Tree From InOrder And PreOrder](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/TreeConstruction/ConstructBinaryTreeFromInorderAndPreorder) | InterviewBit | Amazon, Microsoft | Courses -> Programming | Trees | Java |
+| 395 | Coding | [Sorted Array To Balanced Bst](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/TreeConstruction/SortedArrayToBalancedBst) | InterviewBit | VMware, Amazon | Courses -> Programming | Trees | Java |
+| 396 | Coding | [Least Common Ancestor](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/TreeSearch/LeastCommonAncestor) | InterviewBit | Facebook, Adobe, Microsoft, Amazon, Google | Courses -> Programming | Trees | Java |
+| 397 | Coding | [Shortest Unique Prefix](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/Trie/ShortestUniquePrefix) | InterviewBit | Google | Courses -> Programming | Trees | Java |
+| 398 | Coding | [Hotel Reviews](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/Tries/HotelReviews) | InterviewBit | Booking.com | Courses -> Programming | Trees | Java |
+| 399 | Coding | [Identical Binary Trees](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/TwoTrees/IdenticalBinaryTrees) | InterviewBit | Amazon | Courses -> Programming | Trees | Java |
+| 400 | Coding | [Symmetric Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level6_Trees/Problems/TwoTrees/SymmetricBinaryTree) | InterviewBit | Amazon | Courses -> Programming | Trees | Java |
+| 401 | Coding | [Best Time to Buy and Sell Stock 2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/AdHoc/BestTimeToBuyAndSellStock2) | InterviewBit | Amazon, Facebook | Courses -> Programming | Dynamic Programming | Java |
+| 402 | Coding | [Palindrome Partitioning 2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/BreakingWords/PalindromePartitioning2) | InterviewBit | Amazon, Google | Courses -> Programming | Dynamic Programming | Java |
+| 403 | Coding | [Max Sum Without Adjacent Elements](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/DerivedDp/MaxSumWithoutAdjacentElements) | InterviewBit | Epic Systems | Courses -> Programming | Dynamic Programming | Java |
+| 404 | Coding | [Word Break 2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/DpOptimizedBacktrack/WordBreak2) | InterviewBit | IBM, Google | Courses -> Programming | Dynamic Programming | Java |
+| 405 | Coding | [Best Time to Buy and Sell Stocks 3](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/DpTricky/BestTimeToBuyAndSellStocks3) | InterviewBit | Amazon, Facebook | Courses -> Programming | Dynamic Programming | Java |
+| 406 | Coding | [Shortest Common SuperString](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/DpTricky/ShortestCommonSuperString) | InterviewBit | Google | Courses -> Programming | Dynamic Programming | Java |
+| 407 | Coding | [Min Jumps Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/GreedyOrDp/MinJumpsArray) | InterviewBit | Amazon, eBay, Google | Courses -> Programming | Dynamic Programming | Java |
+| 408 | Coding | [Equal Average Partition](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/Knapsack/EqualAveragePartition) | InterviewBit | Amazon | Courses -> Programming | Dynamic Programming | Java |
+| 409 | Coding | [Unique Paths in a Grid](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/MatrixDp/UniquePathsInAGrid) | InterviewBit | Facebook | Courses -> Programming | Dynamic Programming | Java |
+| 410 | Coding | [Unique Binary Search Trees 2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/MultiplyDp/UniqueBinarySearchTrees2) | InterviewBit | Amazon, Twitter, Samsung | Courses -> Programming | Dynamic Programming | Java |
+| 411 | Coding | [Max Rectangle In Binary Matrix](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/PreProcessDp/MaxRectangleInBinaryMatrix) | InterviewBit | Google, Microsoft | Courses -> Programming | Dynamic Programming | Java |
+| 412 | Coding | [Length Of Longest Subsequence](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/SimpleArrayDp/LengthOfLongestSubsequence) | InterviewBit | Microsoft | Courses -> Programming | Dynamic Programming | Java |
+| 413 | Coding | [Ways to Decode](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/SimpleArrayDp/WaysToDecode) | InterviewBit | Facebook, Amazon | Courses -> Programming | Dynamic Programming | Java |
+| 414 | Coding | [Best Time to Buy and Sell Stocks 1](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/SuffixPrefixDp/BestTimeToBuyAndSellStocks1) | InterviewBit | Amazon, Facebook | Courses -> Programming | Dynamic Programming | Java |
+| 415 | Coding | [Max Sum Path In Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/TreeDp/MaxSumPathInBinaryTree) | InterviewBit | Directi, Amazon | Courses -> Programming | Dynamic Programming | Java |
+| 416 | Coding | [Edit Distance](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_DynamicProgramming/TwoDStringDp/EditDistance) | InterviewBit | Google, LinkedIn, Microsoft | Courses -> Programming | Dynamic Programming | Java |
+| 417 | Coding | [Assign Mice To Holes](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket1/AssignMiceToHoles) | InterviewBit | Amazon | Courses -> Programming | Greedy | Java |
+| 418 | Coding | [Distribute Candy](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket1/DistributeCandy) | InterviewBit | Microsoft | Courses -> Programming | Greedy | Java |
+| 419 | Coding | [Gas Station](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket2/GasStation) | InterviewBit | Bloomberg, Google, DE Shaw, Amazon | Courses -> Programming | Greedy | Java |
+| 420 | Coding | [Majority Element](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket3/MajorityElement) | InterviewBit | Microsoft, Yahoo, Google | Courses -> Programming | Greedy | Java |
+| 421 | Coding | [Seats](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket4/Seats) | InterviewBit | Walmart Labs | Courses -> Programming | Greedy | Java |
+| 422 | Coding | [Highest Product](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket5/HighestProduct) | InterviewBit | Coursera, Amazon | Courses -> Programming | Greedy | Java |
+| 423 | Coding | [Bulbs](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level7_Greedy/Problems/Bucket6/Bulbs) | InterviewBit |  | Courses -> Programming | Greedy | Java |
+| 424 | Coding | [Level   Order](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/Bfs/LevelOrder) | InterviewBit | Facebook, Groupon | Courses -> Programming | Graphs | Java |
+| 425 | Coding | [Largest Distance Between Nodes of a Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/DepthFirstSearch/LargestDistanceBetweenNodesOfATree) | InterviewBit | Facebook, Google | Courses -> Programming | Graphs | Java |
+| 426 | Coding | [Convert Sorted List to Binary Search Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/GraphAdHoc/ConvertSortedListToBinarySearchTree) | InterviewBit | Google | Courses -> Programming | Graphs | Java |
+| 427 | Coding | [Capture Regions On Board](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/GraphConnectivity/CaptureRegionsOnBoard) | InterviewBit | Google | Courses -> Programming | Graphs | Java |
+| 428 | Coding | [Clone Graph](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/GraphHashing/CloneGraph) | InterviewBit | Google, Facebook, Amazon | Courses -> Programming | Graphs | Java |
+| 429 | Coding | [Word Search Board](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/GraphTraversal/WordSearchBoard) | InterviewBit | Epic Systems, Amazon | Courses -> Programming | Graphs | Java |
+| 430 | Coding | [Word Ladder 1](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/ShortestPath/WordLadder1) | InterviewBit | Google, Microsoft, eBay | Courses -> Programming | Graphs | Java |
+| 431 | Coding | [Word Ladder 2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewBit/src/Courses/Programming/Level8_Graphs/Problems/ShortestPath/WordLadder2) | InterviewBit | Google, Microsoft, eBay | Courses -> Programming | Graphs | Java |
+| 432 | Coding | [29. Bracket Validator](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewCake/src/Questions/BracketValidator) | InterviewCake |  | Questions | Stacks | Java |
+| 433 | Coding | [25. Kth to Last Node in a Singly-Linked List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewCake/src/Questions/KthToLastNodeInSinglyLinkedList) | InterviewCake |  | Questions | Linked List | Java |
+| 434 | Coding | [43. Merge Sorted Arrays](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewCake/src/Questions/MergeSortedArrays) | InterviewCake |  | Questions | Arrays | Java |
+| 435 | Coding | [10. Second Largest Item In Bst](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewCake/src/Questions/SecondLargestItemInBst) | InterviewCake |  | Questions | Binary Search Tree | Java |
+| 436 | Systems Design | [Google Maps](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/InterviewingIo/src/SystemsDesign/GoogleMaps) | interviewing.io |  | Difficulty -> Hard | Distributed Systems Design |  |
+| 437 | Coding | [Add Bold Tag in String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/AddBoldTagInString) | LeetCode | Google | Explore -> Interview -> Google Interview, Difficulty -> Medium | String | Java |
+| 438 | Coding | [First Missing Positive](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/FirstMissingPositive) | LeetCode | Databricks, Google, Amazon, Adobe, Airbnb, Bloomberg, VMware, Pocket Gems, Alibaba, Facebook, Microsoft, Uber, Apple, Baidu | Explore -> Interview -> Google Interview, Difficulty -> Hard | Array | Java |
+| 439 | Coding | [First Unique Character in a String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/FirstUniqueCharacterInAString) | LeetCode | Amazon, Bloomberg, Facebook, Apple, Zillow, Goldman Sachs, Microsoft, Google, Yahoo, Airbnb, SAP, Alibaba, Oracle | Explore -> Interview -> Google Interview, Difficulty -> Easy | String, Hash Table | Java |
+| 440 | Coding | [Game of Life](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/GameOfLife) | LeetCode | Dropbox, Uber, Amazon, Google, Square, Microsoft, Bloomberg, Booking.com, Baidu, Apple, Snapchat, Two Sigma | Explore -> Interview -> Google Interview, Difficulty -> Medium | Array | Java |
+| 441 | Coding | [Image Smoother](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ImageSmoother) | LeetCode | Amazon | Explore -> Interview -> Google Interview, Difficulty -> Easy | Array | Java |
+| 442 | Coding | [Intersection of Two Arrays](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/IntersectionOfTwoArrays) | LeetCode | Facebook, Lyft, Amazon, LinkedIn, Yelp, Indeed, Oracle, Google, Microsoft, Apple, Bloomberg, Adobe, Tencent, Two Sigma | Explore -> Interview -> Google Interview, Difficulty -> Easy | Hash Table, Two Pointers, Binary Search, Sort | Java |
+| 443 | Coding | [Longest Substring with At Most K Distinct Characters](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/LongestSubstringWithAtMostKDistinctCharacters) | LeetCode | Google, Facebook, Amazon, Quora, AppDynamics, Coupang | Explore -> Interview -> Google Interview, Difficulty -> Hard | Hash Table, String | Java |
+| 444 | Coding | [Max Consecutive Ones](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/MaxConsecutiveOnes) | LeetCode | Google, Amazon | Explore -> Interview -> Google Interview, Difficulty -> Easy | Array | Java |
+| 445 | Coding | [Max Consecutive Ones II](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/MaxConsecutiveOnes2) | LeetCode | Google | Explore -> Interview -> Google Interview, Difficulty -> Medium | Two Pointers | Java |
+| 446 | Coding | [Move Zeroes](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/MoveZeroes) | LeetCode | Facebook, Google, SAP, Walmart Labs, Bloomberg, Microsoft, Apple, Uber, Paypal, Lyft, Yahoo, Oracle, eBay, Baidu | Explore -> Interview -> Google Interview, Difficulty -> Easy | Array, Two Pointers | Java |
+| 447 | Coding | [One Edit Distance](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/OneEditDistance) | LeetCode | Facebook, Uber, Microsoft, Yelp, Google, Twitter, Snapchat | Explore -> Interview -> Google Interview, Difficulty -> Medium | String | Java |
+| 448 | Coding | [Plus One](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/PlusOne) | LeetCode | Google, Facebook, Uber, Microsoft, Bloomberg, eBay, Adobe, Amazon, Airbnb | Explore -> Interview -> Google Interview, Difficulty -> Easy | Array, Math | Java |
+| 449 | Coding | [Read N Characters Given Read4](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ReadNCharactersGivenRead4) | LeetCode | Facebook, Google, Uber, Apple, Amazon | Explore -> Interview -> Google Interview, Difficulty -> Easy | String | Java |
+| 450 | Coding | [Read N Characters Given Read4 II - Call multiple times](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ReadNCharactersGivenRead4_2_CallMultipleTimes) | LeetCode | Facebook, Google, Lyft, Rubric, Uber, Pinterest, Microsoft, Bloomberg | Explore -> Interview -> Google Interview, Difficulty -> Hard | String | Java |
+| 451 | Coding | [Remove Duplicates from Sorted Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/RemoveDuplicatesFromSortedArray) | LeetCode | Facebook, Google, Microsoft, Uber, Amazon, Bloomberg, Cisco, Adobe, Yahoo, VMware, Walmart Labs, Tencent, Apple, Alibaba, Baidu, NetEase | Explore -> Interview -> Google Interview, Difficulty -> Easy | Array, Two Pointers | Java |
+| 452 | Coding | [Shortest Palindrome](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ShortestPalindrome) | LeetCode | Bloomberg, Two Sigma, Walmart Labs, Facebook, Adobe, Alibaba, Microsoft, Google, Pocket Gems | Explore -> Interview -> Google Interview, Difficulty -> Hard | String | Java |
+| 453 | Coding | [Spiral Matrix](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/SpiralMatrix) | LeetCode | Microsoft, Google, Bloomberg, Apple, Zillow, Amazon, Uber, Hulu, Paypal, Epic Systems, Yelp, eBay, Baidu, Adobe, Dataminr, JPMorgan, Facebook, Tencent, Walmart Labs, Yahoo, Redfin, ServiceNow, Oracle | Explore -> Interview -> Google Interview, Difficulty -> Medium | Array | Java |
+| 454 | Coding | [Trapping Rain Water](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/TrappingRainWater) | LeetCode | Goldman Sachs, Facebook, Lyft, Amazon, Bloomberg, Google, Microsoft, Airbnb, Uber, Apple, Adobe, Dataminr, Grab, Qualtrics, Intuit, Snapchat, Wish, Alibaba, Twitter, eBay, Baidu, Zenefits, Intel, Palantir Technologies, TripAdvisor, Huawei | Explore -> Interview -> Google Interview, Difficulty -> Hard | Array, Two Pointers, Stack | Java |
+| 455 | Coding | [Valid Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ValidNumber) | LeetCode | Facebook, LinkedIn, Apple, Zillow, Adobe, Google | Explore -> Interview -> Google Interview, Difficulty -> Hard | Math, String | Java |
+| 456 | Coding | [Valid Palindrome](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ValidPalindrome) | LeetCode | Facebook, Apple, Microsoft, Amazon, Google, Adobe, Yandex, TripAdvisor, Airbnb, Snapchat, Uber, Zenefits | Explore -> Interview -> Google Interview, Difficulty -> Easy | Two Pointers, String | Java |
+| 457 | Coding | [Valid Parentheses](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/ArraysAndStrings/ValidParentheses) | LeetCode | Facebook, LinkedIn, Amazon, Bloomberg, Google, Microsoft, Twitter, Expedia, Uber, Akuna Capital, Apple, VMware, Paypal, Twilio, Mathworks, Samsung, Riot Games, Yandex, Lyft, Zillow, Alibaba, Cloudera, Adobe, Tencent, Blizzard, eBay, Baidu, Visa, Pure Storage, Indeed, TripleByte, ServiceNow, Yahoo, Capital One, Oracle, Huawei, Yelp, Zappos, Qualcomm, Gilt Groupe, Aetion, Yatra, Rubrik, Zynga, TripAdvisor, Booking.com, Lending Club, Zenefits | Explore -> Interview -> Google Interview, Difficulty -> Easy | String, Stack | Java |
+| 458 | Coding | [Binary Search Tree Iterator](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Design/BinarySearchTreeIterator) | LeetCode | Facebook, Amazon, Microsoft, Bloomberg, Qualtrics, Cloudera, Uber, Google, Oracle, LinkedIn, Cisco, AppDynamics, Apple | Explore -> Interview -> Google Interview, Difficulty -> Medium | Stack, Tree, Design | Java |
+| 459 | Coding | [Design Tic-Tac-Toe](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Design/DesignTicTacToe) | LeetCode | Microsoft, Amazon, Google, Facebook, Apple, TripleByte, Twitter | Explore -> Interview -> Google Interview, Difficulty -> Medium | Design | Java |
+| 460 | Coding | [Moving Average from Data Stream](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Design/MovingAverageFromDataStream) | LeetCode | Facebook, Google, Bloomberg, Uber, Twitter, Amazon, Microsoft, Indeed | Explore -> Interview -> Google Interview, Difficulty -> Easy | Design, Queue | Java |
+| 461 | Coding | [Peeking Iterator](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Design/PeekingIterator) | LeetCode | Apple, Amazon, Paypal, Google, Square, Microsoft, Morgan Stanley, Yahoo | Explore -> Interview -> Google Interview, Difficulty -> Medium | Design | Java |
+| 462 | Coding | [Range Sum Query 2D - Mutable](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Design/RangeSumQuery2DMutable) | LeetCode | Facebook, Google, Microsoft, Houzz, Baidu | Explore -> Interview -> Google Interview, Difficulty -> Medium | Dynamic Programming | Java |
+| 463 | Coding | [Zigzag Iterator](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Design/ZigzagIterator) | LeetCode | Facebook, Google, Apple, Groupon | Explore -> Interview -> Google Interview, Difficulty -> Medium | Design | Java |
+| 464 | Coding | [Decode Ways](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/DecodeWays) | LeetCode | Facebook, Google, Microsoft, Uber, Amazon, Bloomberg, Yahoo, LiveRamp, Expedia, Salesforce, Twitter, Databricks, Square, Pinterest, Apple, Goldman Sachs | Explore -> Interview -> Google Interview, Difficulty -> Medium | String, Dynamic Programming | Java |
+| 465 | Coding | [Edit Distance](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/EditDistance) | LeetCode | Google, LinkedIn, Microsoft, Amazon, Bloomberg, Baidu, Yahoo, Apple, Alibaba, NetEase, Square, TripleByte, Cisco, Facebook, Snapchat, Adobe, Huawei, VMware | Explore -> Interview -> Google Interview, Difficulty -> Hard | String, Dynamic Programming | Java |
+| 466 | Coding | [House Robber II](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/HouseRobber2) | LeetCode | Google, Salesforce, Baidu, Adobe, Microsoft | Explore -> Interview -> Google Interview, Difficulty -> Medium | Dynamic Programming | Java |
+| 467 | Coding | [Maximum Vacation Days](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/MaximumVacationDays) | LeetCode | Google, Facebook, Uber | Explore -> Interview -> Google Interview, Difficulty -> Hard | Dynamic Programming | Java |
+| 468 | Coding | [Minimum Path Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/MinimumPathSum) | LeetCode | Microsoft, Google, Amazon, Goldman Sachs, Bloomberg, Alibaba, Yelp | Explore -> Interview -> Google Interview, Difficulty -> Medium | Array, Dynamic Programming | Java |
+| 469 | Coding | [Sentence Screen Fitting](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/SentenceScreenFitting) | LeetCode | Google, Yelp | Explore -> Interview -> Google Interview, Difficulty -> Medium | Dynamic Programming | Java |
+| 470 | Coding | [Word Break](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/DynamicProgramming/WordBreak) | LeetCode | Facebook, Amazon, Google, Uber, Bloomberg, Yelp, Apple, Snapchat, Microsoft, Qualtrics, VMWare, Zillow, Oracle, Alibaba, Paypal, Yahoo, Twitter, Lyft, Adobe, Zenefits, Pinterest, eBay, Indeed, Pocket Gems, Square, Coupang | Explore -> Interview -> Google Interview, Difficulty -> Medium | Dynamic Programming | Java |
+| 471 | Coding | [K Empty Slots](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/InterviewProcess/KEmptySlots) | LeetCode | Google, Microsoft | Explore -> Interview -> Google Interview, Difficulty -> Hard | Array, Binary Search Tree | Java |
+| 472 | Coding | [License Key Formatting](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/InterviewProcess/LicenseKeyFormatting) | LeetCode | Google, Amazon | Explore -> Interview -> Google Interview, Difficulty -> Easy |  | Java |
+| 473 | Coding | [Longest Univalue Path](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/InterviewProcess/LongestUnivaluePath) | LeetCode | Google, Alibaba, Amazon | Explore -> Interview -> Google Interview, Difficulty -> Easy | Tree, Recursion | Java |
+| 474 | Coding | [Next Closest Time](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/InterviewProcess/NextClosestTime) | LeetCode | Google, Facebook | Explore -> Interview -> Google Interview, Difficulty -> Medium | String | Java |
+| 475 | Coding | [Repeated String Match](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/InterviewProcess/RepeatedStringMatch) | LeetCode | Google | Explore -> Interview -> Google Interview, Difficulty -> Easy | String | Java |
+| 476 | Coding | [Insert into a Cyclic Sorted List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/LinkedList/InsertIntoACyclicSortedList) | LeetCode | Facebook, Google, Microsoft | Explore -> Interview -> Google Interview, Difficulty -> Medium | Linked List | Java |
+| 477 | Coding | [Merge k Sorted Lists](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/LinkedList/MergeKSortedLists) | LeetCode | Microsoft, Amazon, LinkedIn, Google, Facebook, Uber, Twitter, Airbnb, IXL | Explore -> Interview -> Google Interview, Difficulty -> Hard | Linked List, Divide and Conquer, Heap | Java |
+| 478 | Coding | [Maximum Product of Word Lengths](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Others/MaximumProductOfWordLengths) | LeetCode | Works Applications, Google | Explore -> Interview -> Google Interview, Difficulty -> Medium | Bit Manipulation | Java |
+| 479 | Coding | [UTF-8 Validation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Others/UTF8Validation) | LeetCode | Palantir Technologies, Google, Facebook, Apple, Uber, Nvidia | Explore -> Interview -> Google Interview, Difficulty -> Medium | Bit Manipulation | Java |
+| 480 | Coding | [Android Unlock Patterns](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Recursion/AndroidUnlockPatterns) | LeetCode | Google, Snapchat, Microsoft, Apple | Explore -> Interview -> Google Interview, Difficulty -> Medium | Dynamic Programming, Backtracking | Java |
+| 481 | Coding | [Strobogrammatic Number II](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Recursion/StrobogrammaticNumber2) | LeetCode | Google, Facebook | Explore -> Interview -> Google Interview, Difficulty -> Medium | Math, Recursion | Java |
+| 482 | Coding | [Word Search II](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Recursion/WordSearch2) | LeetCode | Amazon, Facebook, Google, Microsoft, Airbnb, Uber, Houzz, Snapchat, Yelp, Apple, Pocket Gems, Yahoo, Lyft | Explore -> Interview -> Google Interview, Difficulty -> Hard | Backtracking, Trie | Java |
+| 483 | Coding | [Word Squares](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/Recursion/WordSquares) | LeetCode | Oracle, Google | Explore -> Interview -> Google Interview, Difficulty -> Hard | Backtracking, Trie | Java |
+| 484 | Coding | [Diagonal Traverse](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/DiagonalTraverse) | LeetCode | Google, Facebook, Bloomberg, Adobe, Amazon | Explore -> Interview -> Google Interview, Difficulty -> Medium |  | Java |
+| 485 | Coding | [Evaluate Reverse Polish Notation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/EvaluateReversePolishNotation) | LeetCode | LinkedIn, Microsoft, Two Sigma, Google, Uber, Amazon, Pure Storage, Adobe, Yelp | Explore -> Interview -> Google Interview, Difficulty -> Medium | Stack | Java |
+| 486 | Coding | [Find K Pairs with Smallest Sums](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/FindKPairsWithSmallestSums) | LeetCode | Amazon, Google, LinkedIn, Microsoft, Uber | Explore -> Interview -> Google Interview, Difficulty -> Medium | Heap | Java |
+| 487 | Coding | [Find K-th Smallest Pair Distance](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/FindKthSmallestPairDistance) | LeetCode | Google | Explore -> Interview -> Google Interview, Difficulty -> Hard | Array, Binary Search, Heap | Java |
+| 488 | Coding | [Insert Interval](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/InsertInterval) | LeetCode | LinkedIn, Facebook, Uber, Google, Microsoft, Amazon, Twitter, Tableau, Square, Lyft, Dropbox | Explore -> Interview -> Google Interview, Difficulty -> Hard | Array, Sort | Java |
+| 489 | Coding | [Kth Largest Element in an Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/KthLargestElementInAnArray) | LeetCode | Facebook, Amazon, Google, Microsoft, Goldman Sachs, Apple, Baidu, Tencent, Nvidia, LinkedIn, Alibaba, Bloomberg, Airbnb, eBay, Twitter, IXL, Snapchat, Yelp, Yahoo, Pocket Gems | Explore -> Interview -> Google Interview, Difficulty -> Medium | Divide and Conquer, Heap | Java |
+| 490 | Coding | [Longest Palindromic Substring](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/LongestPalindromicSubstring) | LeetCode | Amazon, Microsoft, Facebook, Google, Adobe, Apple, Yahoo, Alibaba, Airbnb, GoDaddy, Roblox, Baidu, Cisco, NetEase, IBM, JPMorgan, Yelp, eBay, Tencent, Uber, Bloomberg, Huawei, Twitter, Works Applications, Expedia, Lyft, Pure Storage, Sumologic, Zenefits, VMWare, VMWare, Goo, Qualtrics, Dropbox, Walmart Labs, Yandex, Paypal, Oracle, Salesforce | Explore -> Interview -> Google Interview, Difficulty -> Medium | String, Dynamic Programming | Java |
+| 491 | Coding | [Merge Intervals](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/MergeIntervals) | LeetCode | Palantir Technologies, Facebook, Google, Bloomberg, Uber, Microsoft, LinkedIn, Amazon, Apple, Oracle, Cisco, Yelp, Goldman Sachs, Twitter, Salesforce, Yahoo, Nvidia, Dataminr, Paypal, Intuit, Zenefits, Snapchat, GoDaddy, Dropbox, Pinterest, Walmart Labs, SAP | Explore -> Interview -> Google Interview, Difficulty -> Medium | Array, Sort | Java |
+| 492 | Coding | [Minimum Window Substring](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/MinimumWindowSubstring) | LeetCode | Facebook, Google, LinkedIn, Amazon, Microsoft, Airbnb, Apple, Uber, Bloomberg, Walmart Labs, VMware, Alibaba, LiveRamp, Netsuite, Yahoo, Adobe, Snapchat | Explore -> Interview -> Google Interview, Difficulty -> Hard | Hash Table, Two Pointers, String | Java |
+| 493 | Coding | [Next Greater Element I](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/NextGreaterElement1) | LeetCode | Amazon, Bloomberg, Google, Mathworks, Adobe | Explore -> Interview -> Google Interview, Difficulty -> Easy | Stack | Java |
+| 494 | Coding | [Pacific Atlantic Water Flow](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/PacificAtlanticWaterFlow) | LeetCode | Microsoft, Amazon, Oracle, Google, Uber, Expedia | Explore -> Interview -> Google Interview, Difficulty -> Medium | Depth-first Search, Breadth-first Search | Java |
+| 495 | Coding | [Range Module](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/RangeModule) | LeetCode | Google, Machine Zone, Coupang | Explore -> Interview -> Google Interview, Difficulty -> Hard | Array, Segment Tree, Binary Search Tree | Java |
+| 496 | Coding | [Shortest Distance from All Buildings](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/ShortestDistanceFromAllBuildings) | LeetCode | Facebook, Google, Amazon, Zenefits | Explore -> Interview -> Google Interview, Difficulty -> Hard | Breadth-first search | Java |
+| 497 | Coding | [Sort Transformed Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/SortTransformedArray) | LeetCode | Google, Facebook | Explore -> Interview -> Google Interview, Difficulty -> Medium | Math, Two Pointers | Java |
+| 498 | Coding | [Sqrt(x)](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/SortingAndSearching/SqrtOfX) | LeetCode | Google, LinkedIn, Microsoft, Bloomberg, Apple, Amazon, Facebook, Uber, Alibaba, Yahoo, Salesforce | Explore -> Interview -> Google Interview, Difficulty -> Easy | Math, Binary Search | Java |
+| 499 | Coding | [Closest Binary Search Tree Value](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/ClosestBinarySearchTreeValue) | LeetCode | Facebook, Google, Microsoft, Amazon, LinkedIn, eBay, Snapchat | Explore -> Interview -> Google Interview, Difficulty -> Easy | Binary Search, Tree | Java |
+| 500 | Coding | [Course Schedule](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/CourseSchedule) | LeetCode | Amazon, Facebook, Google, Goldman Sachs, Yelp, Intuit, Paypal, Microsoft, Uber, Oracle, LinkedIn, Apple, Zenefits | Explore -> Interview -> Google Interview, Difficulty -> Medium | Depth-first Search, Breadth-first Search, Graph, Topological Sort | Java |
+| 501 | Coding | [Evaluate Division](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/EvaluateDivision) | LeetCode | Google, Facebook, Uber | Explore -> Interview -> Google Interview, Difficulty -> Medium | Union Find, Graph | Java |
+| 502 | Coding | [Inorder Successor in BST](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/InorderSuccessorInBst) | LeetCode | Google, Microsoft, Amazon, Facebook, Palantir Technologies, Arista Networks, Pocket Gems, Baidu | Explore -> Interview -> Google Interview, Difficulty -> Medium | Tree | Java |
+| 503 | Coding | [Redundant Connection II](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/RedundantConnection2) | LeetCode | Google | Explore -> Interview -> Google Interview, Difficulty -> Hard | Tree, Depth-first Search, Union Find, Graph | Java |
+| 504 | Coding | [Robot Room Cleaner](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/RobotRoomCleaner) | LeetCode | Google, Facebook, Amazon | Explore -> Interview -> Google Interview, Difficulty -> Hard | Depth-first Search | Java |
+| 505 | Coding | [Validate Binary Search Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/GoogleInterview/TreesAndGraphs/ValidateBinarySearchTree) | LeetCode | Facebook, Bloomberg, Microsoft, Amazon, Google, Uber, Capital One, TripAdvisor, LinkedIn, Apple, Walmart Labs, Nvidia, Nutanix, Qualtrics, VMware, Square, Snapchat, Baidu | Explore -> Interview -> Google Interview, Difficulty -> Medium | Tree, Depth-first Search | Java |
+| 506 | Coding | [Best Time to Buy and Sell Stock II](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/BestTimeToBuySellStock2) | LeetCode | Amazon, Facebook, Alibaba, Goldman Sachs, Adobe, Bloomberg, Microsoft, Intuit, Zappos, Google, Zenefits, Citadel, VMware, Baidu, Airbnb, Tencent, JPMorgan, Morgan Stanley, Oracle, Apple, LinkedIn, Palantir Technologies, Grab, Uber, Yahoo | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Array, Greedy | Java |
+| 507 | Coding | [Contains Duplicate](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/ContainsDuplicate) | LeetCode | Adobe, Microsoft, Google, Bloomberg, Amazon, Yahoo, Facebook, Baidu, Yelp, Airbnb, Palantir Technologies | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Array, Hash Table | Java |
+| 508 | Coding | [Intersection of Two Arrays II](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/IntersectionOfTwoArrays2) | LeetCode | Facebook, Google, Oracle, Yelp, Bloomberg, Amazon, Alibaba | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Array, Hash Table, Two Pointers, Binary Search, Sort | Java |
+| 509 | Coding | [Move Zeroes](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/MoveZeroes) | LeetCode | Facebook, Google, SAP, Walmart Labs, Bloomberg, Microsoft, Apple, eBay, Uber, Paypal, Baidu, Lyft, Amazon, Yahoo, Oracle | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Array, Two Pointers | Java |
+| 510 | Coding | [Plus One](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/PlusOne) | LeetCode | Google, Facebook, Uber, Microsoft, Bloomberg, eBay, Adobe, Amazon, Airbnb | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Array, Math | Java |
+| 511 | Coding | [Remove Duplicates from Sorted Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/RemoveDuplicatesFromSortedArray) | LeetCode | Facebook, Google, Microsoft, Amazon, Uber, Bloomberg, Cisco, Adobe, Yahoo, VMware, Walmart Labs, Apple, Alibaba, NetEase | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Array, Two Pointers | Java |
+| 512 | Coding | [Rotate Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/RotateArray) | LeetCode | Uber, Facebook, Amazon, Microsoft, Google, Oracle, Adobe, Bloomberg | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Array | Java |
+| 513 | Coding | [Rotate Image](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/RotateImage) | LeetCode | Microsoft, Amazon, Apple, Google, Nvidia, Facebook, Akuna Capital, Houzz, ServiceNow, Baidu, Wish, Adobe, Bloomberg, Epic Systems, Salesforce, Paypal | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Medium | Array | Java |
+| 514 | Coding | [Single Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/SingleNumber) | LeetCode | Facebook, Google, Adobe, SAP, Alibaba, Amazon, Microsoft, Oracle, Twitter, Zillow, Expedia, Airbnb, Baidu, Riot Games, Zappos, VMware, Palantir Technologies | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Array, Hash Table, Bit Manipulation | Java |
+| 515 | Coding | [Two Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/TwoSum) | LeetCode | Google, Adobe, Amazon, Apple, Microsoft, Facebook, Uber, Yahoo, Alibaba, Bloomberg, LinkedIn, Baidu, Morgan Stanley, SAP, Airbnb, Yandex, Goldman Sachs, Aetion, Paypal, Visa, Indeed, GoDaddy, Affirm, Box, eBay, Cisco, Oracle, Works Applications, Radius, Snapchat, Tencent, Zenefits, Samsung, Valve, BlackRock, Lyft, IBM, Citrix, NetEase, Expedia, Twitter, Huawei, Mathworks, Two Sigma, Intuit, Hulu, Coursera, Yelp, MAQ Software, Helix, Walmart Labs, Grab, Zappos, Nvidia, Fallible, Zillow, Pinterest, TripAdvisor, Symantec, IXL, Zynga, Intel, HTC, Riot Games, AppDynamics, Quora, Alation, Gilt Groupe, JPMorgan, Epic Systems, Dropbox, VMware, Jump Trading, Sina, Lending Club, Salesforce, Wish, LiveRamp, Pocket Gems, Groupon, Tableau, Deutsche Bank, Capital One, ServiceNow, Jane Street, Akuna Capital, Redfin, Drawbridge, Booking.com, Blizzard | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Array, Hash Table | Java |
+| 516 | Coding | [Valid Sudoku](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Array/ValidSudoku) | LeetCode | Uber, Microsoft, Facebook, Pinterest, Apple, Amazon, Google, Bloomberg, Snapchat | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Medium | Array, Hash Table | Java |
+| 517 | Coding | [Best Time to Buy and Sell Stock](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/DynamicProgramming/BestTimeToBuyAndSellStock) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Array, Dynamic Programming | Java |
+| 518 | Coding | [Climbing Stairs](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/DynamicProgramming/ClimbingStairs) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Dynamic Programming | Java |
+| 519 | Coding | [Maximum Subarray](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/DynamicProgramming/MaximumSubarray) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Array, Divide and Conquer, Dynamic Programming | Java |
+| 520 | Coding | [Delete Node in a Linked List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/LinkedList/DeleteNodeInALinkedList) | LeetCode | Microsoft, Paypal, Apple, Amazon, VMware, Google, Adobe, Bloomberg, Capital One, NetEase, Tencent, Baidu | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Linked List | Java |
+| 521 | Coding | [Linked List Cycle](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/LinkedList/LinkedListCycle) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Linked List, Two Pointers | Java |
+| 522 | Coding | [Merge Two Sorted Lists](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/LinkedList/MergeTwoSortedLists) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Linked List | Java |
+| 523 | Coding | [Palindrome Linked List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/LinkedList/PalindromeLinkedList) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Linked List, Two Pointers | Java |
+| 524 | Coding | [Remove Nth Node From End of List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/LinkedList/RemoveNthNodeFromEndOfList) | LeetCode | Microsoft, Google, Adobe, Bloomberg, Apple, Cisco, Uber, Facebook, Aetion, Amazon, Baidu, Expedia, Zenefits, eBay, Alibaba, ServiceNow | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Medium | Linked List, Two Pointers | Java |
+| 525 | Coding | [Reverse Linked List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/LinkedList/ReverseLinkedList) | LeetCode | Microsoft, Apple, Amazon, Facebook, Bloomberg, Yandex, Adobe, Mathworks, Google, Goldman Sachs, Cisco, Nvidia, VMware, Alibaba, Oracle, Baidu, Intuit, Intel, Paypal, Two Sigma, Tencent, Expedia, Yahoo, Walmart Labs, TripAdvisor, Qualcomm, Zynga, Zappos, Citrix, SAP, Nutanix, eBay, EMC, Snapchat, Zenefits, Yelp, Uber, Twitter | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Linked List | Java |
+| 526 | Coding | [First Bad Version](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/SortingAndSearching/FirstBadVersion) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Binary Search | Java |
+| 527 | Coding | [Merge Sorted Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/SortingAndSearching/MergeSortedArray) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Array, Two Pointers | Java |
+| 528 | Coding | [Count and Say](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/CountAndSay) | LeetCode | Google, Microsoft, Amazon, Adobe, Bloomberg, Facebook, Apple, Intuit, eBay, Epic Systems, Airbnb, VMware, Salesforce | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | String | Java |
+| 529 | Coding | [First Unique Character in a String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/FirstUniqueCharacterInAString) | LeetCode | Bloomberg, Facebook, Amazon, Apple, Zillow, Goldman Sachs, Google, Microsoft, Yahoo, Airbnb, SAP, Alibaba, Oracle | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | String, Hash Table | Java |
+| 530 | Coding | [Implement strStr()](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/ImplementStrStr) | LeetCode | Microsoft, Amazon, Facebook, Apple, Bloomberg, Adobe, Pocket Gems, Tencent, Alibaba, Yahoo, Google, Baidu, Salesforce, Zillow | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | String, Two Pointers | Java |
+| 531 | Coding | [Longest Common Prefix](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/LongestCommonPrefix) | LeetCode | Adobe, Facebook, Apple, Google, Quora, Yahoo, Oracle, Pinterest, Microsoft, IXL, Airbnb, Yelp, Citrix, Amazon, Aetion, Alibaba, Baidu, Tencent, Expedia, Samsung, Deutsche Bank, VMware, Huawei | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | String | Java |
+| 532 | Coding | [Reverse Integer](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/ReverseInteger) | LeetCode | Adobe, Bloomberg, Google, Amazon, Microsoft, Apple, JPMorgan, Facebook, Yahoo, Lyft, NetEase, Alibaba, Aetion, Airbnb, Symantec, Baidu, Huawei, Oracle, Tencent, Twitter, LinkedIn, GoDaddy, eBay, VMware, Epic Systems, Pocket Gems, Quora, Works Applications, Zillow, HTC | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | String, Math | Java |
+| 533 | Coding | [Reverse String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/ReverseString) | LeetCode | Microsoft, Apple, Bloomberg, Adobe, Google, GoDaddy, Walmart Labs, Alibaba, Goldman Sachs, Tencent, eBay, Amazon, Facebook, Baidu, LinkedIn, Airbnb, VMware, IBM, Cisco | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | String, Two Pointers | Java |
+| 534 | Coding | [String to Integer (atoi)](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/StringToIntegerAtoi) | LeetCode | Microsoft, Facebook, Goldman Sachs, Google, Amazon, Apple, Adobe, Cisco, Redfin, Zillow, LinkedIn, Bloomberg, Yahoo, Baidu, Alibaba, VMware, Citrix, eBay, Airbnb, Tencent, Huawei, Uber | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Medium | String, Math | Java |
+| 535 | Coding | [Valid Anagram](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/ValidAnagram) | LeetCode | Bloomberg, Google, Microsoft, Apple, Yahoo, Uber, Facebook, Amazon, Goldman Sachs, Paypal, VMware, Snapchat, Samsung, Oracle, Cisco, Yelp, LeetCode | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | String, Hash Table, Sort | Java |
+| 536 | Coding | [Valid Palindrome](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Strings/ValidPalindrome) | LeetCode | Facebook, Microsoft, Amazon, Apple, Google, Adobe, Yandex, Airbnb, Snapchat, TripAdvisor, Uber, Zenefits | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | String, Two Pointers | Java |
+| 537 | Coding | [Binary Tree Level Order Traversal](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Trees/BinaryTreeLevelOrderTraversal) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Medium | Tree, Breadth-first Search | Java |
+| 538 | Coding | [Convert Sorted Array to Binary Search Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Trees/ConvertSortedArrayToBinarySearchTree) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Tree, Depth-first Search | Java |
+| 539 | Coding | [Maximum Depth of Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Trees/MaximumDepthOfBinaryTree) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Tree, Depth-first Search | Java |
+| 540 | Coding | [Symmetric Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Trees/SymmetricTree) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Tree, Depth-first Search, Breadth-first Search | Java |
+| 541 | Coding | [Validate Binary Search Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Explore/Interview/TopInterviewQuestions_Easy/Trees/ValidateBinarySearchTree) | LeetCode |  | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Medium | Tree, Depth-first Search | Java |
+| 542 | Coding | [103. Binary Tree Zigzag Level Order Traversal](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P103_BinaryTreeZigzagLevelOrderTraversal) | LeetCode | LinkedIn, Facebook, Amazon, Google, Microsoft, Apple, Uber, Bloomberg, Apple, Tencent, eBay, Alibaba | Problems -> Algorithms, Difficulty -> Medium | Stack, Tree, Breadth-first Search | Java |
+| 543 | Coding | [122. Best Time to Buy and Sell Stock II](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P122_BestTimeToBuySellStock2) | LeetCode | Amazon, Facebook, Alibaba, Goldman Sachs, Adobe, Bloomberg, Microsoft, Intuit, Zappos, Google, Zenefits, Citadel, VMware, Baidu, Airbnb, Tencent, JPMorgan, Morgan Stanley, Oracle, Apple, LinkedIn, Palantir Technologies, Grab, Uber, Yahoo | Explore -> Algorithms, Difficulty -> Easy | Array, Greedy | Java |
+| 544 | Coding | [125. Valid Palindrome](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P125_ValidPalindrome) | LeetCode | Facebook, Microsoft, Amazon, Apple, Google, Adobe, Yandex, Airbnb, Snapchat, TripAdvisor, Uber, Zenefits | Explore -> Algorithms, Difficulty -> Easy | String, Two Pointers | Java |
+| 545 | Coding | [127. Word Ladder](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P127_WordLadder) | LeetCode | LinkedIn, Facebook, Amazon, Google, Microsoft, Twitter, Bloomberg, Lyft, Yelp, eBay, Hulu, Snapchat | Problems -> Algorithms, Difficulty -> Medium | Breadth-first Search | Java |
+| 546 | Coding | [131. Palindrome Partitioning](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P131_PalindromePartitioning) | LeetCode |  | Problems -> Algorithms, Difficulty -> Medium | Backtracking | Java |
+| 547 | Coding | [136. Single Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P136_SingleNumber) | LeetCode | Facebook, Google, Adobe, SAP, Alibaba, Amazon, Microsoft, Oracle, Twitter, Zillow, Expedia, Airbnb, Baidu, Riot Games, Zappos, VMware, Palantir Technologies | Explore -> Algorithms, Difficulty -> Easy | Hash Table, Bit Manipulation | Java |
+| 548 | Coding | [149. Max Points on a Line](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P149_MaxPointsOnALine) | LeetCode | LinkedIn, Microsoft, Google, Amazon, Adobe, Alibaba, Twitter, Apple | Problems -> Algorithms, Difficulty -> Hard | Hash Table, Math | Java |
+| 549 | Coding | [150. Evaluate Reverse Polish Notation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P150_EvaluateReversePolishNotation) | LeetCode | LinkedIn, Microsoft, Two Sigma, Google, Uber | Problems -> Algorithms, Difficulty -> Medium | Stack | Java |
+| 550 | Coding | [152. Maximum Product Subarray](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P152_MaximumProductSubarray) | LeetCode | LinkedIn, Microsoft, Yelp, Amazon, Google, Pocket Gems | Problems -> Algorithms, Difficulty -> Medium | Array, Dynamic Programming | Java |
+| 551 | Coding | [156. Binary Tree Upside Down](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P156_BinaryTreeUpsideDown) | LeetCode | LinkedIn, Microsoft | Problems -> Algorithms, Difficulty -> Medium | Tree | Java |
+| 552 | Coding | [170. Two Sum III - Data structure design](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P170_TwoSum3_DataStructureDesign) | LeetCode | LinkedIn, Uber | Problems -> Algorithms, Difficulty -> Easy | Hash Table, Design | Java |
+| 553 | Coding | [173. Binary Search Tree Iterator](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P173_BinarySearchTreeIterator) | LeetCode | Facebook, Amazon, Microsoft, Bloomberg, Qualtrics, Cloudera, Uber, Google, Oracle, LinkedIn, Cisco, AppDynamics, Apple | Problems -> Algorithms, Difficulty -> Medium | Stack, Tree, Design | Java |
+| 554 | Coding | [187. Repeated DNA Sequences](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P187_RepeatedDnaSequences) | LeetCode | LinkedIn, Amazon | Problems -> Algorithms, Difficulty -> Medium | Hash Table, Bit Manipulation | Java |
+| 555 | Coding | [189. Rotate Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P189_RotateArray) | LeetCode | Uber, Facebook, Amazon, Microsoft, Google, Oracle, Adobe, Bloomberg | Problems -> Algorithms, Difficulty -> Easy | Array | Java |
+| 556 | Coding | [198. House Robber](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P198_HouseRobber) | LeetCode | LinkedIn, Airbnb, Tencent, Alibaba, Samsung, Baidu, Pocket Gems, Amazon, Google | Problems -> Algorithms, Difficulty -> Easy | Dynamic Programming | Java |
+| 557 | Coding | [200. Number of Islands](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P101_P200/P200_NumberOfIslands) | LeetCode | Amazon, Lyft, Google, Facebook, Bloomberg, Uber, LinkedIn, Microsoft, Apple, Qualtrics, Yahoo, Twitter, Alibaba, AppDynamics, Yelp, Oracle, eBay, Expedia, Goldman Sachs, Affirm | Problems -> Algorithms, Difficulty -> Medium | Depth-first Search, Breadth-first Search, Union Find | Java |
+| 558 | Coding | [10. Regular Expression Matching](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P10_RegularExpressionMatching) | LeetCode | Facebook, Microsoft, Google, Coursera, Bloomberg, Apple | Difficulty -> Hard | String, Dynamic Programming, Backtracking | Java |
+| 559 | Coding | [14. Longest Common Prefix](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P14_LongestCommonPrefix) | LeetCode | Adobe, Facebook, Apple, Google, Quora, Yahoo, Oracle, Pinterest, Microsoft, IXL, Airbnb, Yelp, Citrix, Amazon, Aetion, Alibaba, Baidu, Tencent, Expedia, Samsung, Deutsche Bank, VMware, Huawei | Explore -> Algorithms, Difficulty -> Easy | String | Java |
+| 560 | Coding | [15. 3Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P15_ThreeSum) | LeetCode |  | Difficulty -> Medium |  | Java |
+| 561 | Coding | [18. 4Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P18_FourSum) | LeetCode | Facebook | Problems -> Algorithms, Difficulty -> Medium | Array, Hash Table, Two Pointers | Java |
+| 562 | Coding | [19. Remove Nth Node From End of List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P19_RemoveNthNodeFromEndOfList) | LeetCode | Microsoft, Google, Adobe, Bloomberg, Apple, Cisco, Uber, Facebook, Aetion, Amazon, Baidu, Expedia, Zenefits, eBay, Alibaba, ServiceNow | Explore -> Algorithms, Difficulty -> Medium | Linked List, Two Pointers | Java |
+| 563 | Coding | [1. Two Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P1_TwoSum) | LeetCode | Google, Adobe, Amazon, Apple, Microsoft, Facebook, Uber, Yahoo, Alibaba, Bloomberg, LinkedIn, Baidu, Morgan Stanley, SAP, Airbnb, Yandex, Goldman Sachs, Aetion, Paypal, Visa, Indeed, GoDaddy, Affirm, Box, eBay, Cisco, Oracle, Works Applications, Radius, Snapchat, Tencent, Zenefits, Samsung, Valve, BlackRock, Lyft, IBM, Citrix, NetEase, Expedia, Twitter, Huawei, Mathworks, Two Sigma, Intuit, Hulu, Coursera, Yelp, MAQ Software, Helix, Walmart Labs, Grab, Zappos, Nvidia, Fallible, Zillow, Pinterest, TripAdvisor, Symantec, IXL, Zynga, Intel, HTC, Riot Games, AppDynamics, Quora, Alation, Gilt Groupe, JPMorgan, Epic Systems, Dropbox, VMware, Jump Trading, Sina, Lending Club, Salesforce, Wish, LiveRamp, Pocket Gems, Groupon, Tableau, Deutsche Bank, Capital One, ServiceNow, Jane Street, Akuna Capital, Redfin, Drawbridge, Booking.com, Blizzard | Problems -> Algorithms, Difficulty -> Easy | Array, Hash Table | Java |
+| 564 | Coding | [21. Merge Two Sorted Lists](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P21_MergeTwoSortedLists) | LeetCode | Microsoft, Amazon, LinkedIn, Apple | Problems -> Algorithms, Difficulty -> Easy | Linked List | Java |
+| 565 | Coding | [23. Merge k Sorted Lists](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P23_MergeKSortedLists) | LeetCode | Microsoft, Amazon, LinkedIn, Google, Facebook, Uber, Twitter, Airbnb, IXL | Problems -> Algorithms, Difficulty -> Hard | Linked List, Divide and Conquer, Heap | Java |
+| 566 | Coding | [26. Remove Duplicates from Sorted Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P26_RemoveDuplicatesFromSortedArray) | LeetCode | Facebook, Google, Microsoft, Amazon, Uber, Bloomberg, Cisco, Adobe, Yahoo, VMware, Walmart Labs, Apple, Alibaba, NetEase | Explore -> Algorithms, Difficulty -> Easy | Array, Two Pointers | Java |
+| 567 | Coding | [28. Implement strStr()](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P28_ImplementStrStr) | LeetCode | Microsoft, Amazon, Facebook, Apple, Bloomberg, Adobe, Pocket Gems, Tencent, Alibaba, Yahoo, Google, Baidu, Salesforce, Zillow | Explore -> Algorithms, Difficulty -> Easy | String, Two Pointers | Java |
+| 568 | Coding | [31. Next Permutation](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P31_NextPermutation) | LeetCode | Facebook, Google, Microsoft, Amazon, Sumologic, Uber, Quora, Houzz, Samsung, Apple, Adobe, Rubrik, LinkedIn, Airbnb, Matlab | Problems -> Algorithms, Difficulty -> Medium | Array | Java |
+| 569 | Coding | [33. Search in Rotated Sorted Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P33_SearchInRotatedSortedArray) | LeetCode | Microsoft, LinkedIn, Facebook, Uber, Bloomberg | Problems -> Algorithms, Difficulty -> Medium | Array, Binary Search | Java |
+| 570 | Coding | [34. Find First and Last Position of Element in Sorted Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P34_FindFirstAndLastPositionOfElementInSortedArray) | LeetCode | LinkedIn | Problems -> Algorithms, Difficulty -> Medium | Array, Binary Search | Java |
+| 571 | Coding | [35. Search Insert Position](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P35_SearchInsertPosition) | LeetCode | Google | Problems -> Algorithms, Difficulty -> Easy | Array, Binary Search | Java |
+| 572 | Coding | [36. Valid Sudoku](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P36_ValidSudoku) | LeetCode | Uber, Microsoft, Facebook, Pinterest, Apple, Amazon, Google, Bloomberg, Snapchat | Explore -> Algorithms, Difficulty -> Medium | Hash Table | Java |
+| 573 | Coding | [38. Count and Say](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P38_CountAndSay) | LeetCode | Google, Microsoft, Amazon, Adobe, Bloomberg, Facebook, Apple, Intuit, eBay, Epic Systems, Airbnb, VMware, Salesforce | Explore -> Algorithms, Difficulty -> Easy | String | Java |
+| 574 | Coding | [46. Permutations](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P46_Permutations) | LeetCode | LinkedIn, Facebook, Google, Amazon, Microsoft, Bloomberg, Yahoo | Problems -> Algorithms, Difficulty -> Medium | Backtracking | Java |
+| 575 | Coding | [47. Permutations II](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P47_Permutations2) | LeetCode | LinkedIn, Facebook, Tencent, Houzz, Google, Microsoft | Problems -> Algorithms, Difficulty -> Medium | Backtracking | Java |
+| 576 | Coding | [48. Rotate Image](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P48_RotateImage) | LeetCode | Microsoft, Amazon, Apple, Google, Nvidia, Facebook, Akuna Capital, Houzz, ServiceNow, Baidu, Wish, Adobe, Bloomberg, Epic Systems, Salesforce, Paypal | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Medium | Array | Java |
+| 577 | Coding | [4. Median of Two Sorted Arrays](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P4_MedianOfTwoSortedArrays) | LeetCode | Google, Amazon, Adobe, Microsoft, Apple, Goldman Sachs, Uber, Bloomberg, Walmart Labs, Facebook, Rubrik, Tencent, Alibaba, VMWare, Airbnb, Two Sigma, Baidu, NetEase, Twitter, Snapchat, Zillow, Pocket Gems, Aetion, Yahoo, Hulu, eBay, Lyft, Cloudera, Zappos, LinkedIn, Pinterest, Nutanix, Zenefits, Dropbox | Problems -> Algorithms, Difficulty -> Hard | Array, Binary Search, Divide and Conquer | Java |
+| 578 | Coding | [50. Pow(x, n)](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P50_Pow_x_n) | LeetCode | LinkedIn, Facebook, Amazon, Google, Microsoft, Bloomberg, Alibaba | Problems -> Algorithms, Difficulty -> Medium | Math, Binary Search | Java |
+| 579 | Coding | [53. Maximum Subarray](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P53_MaximumSubarray) | LeetCode | Facebook, Microsoft, Amazon, eBay, Uber, LinkedIn, Apple, NetEase, Tencent, Adobe, Google, Alibaba, Hulu, Bloomberg | Problems -> Algorithms, Difficulty -> Easy | Array, Divide and Conquer, Dynamic Programming | Java |
+| 580 | Coding | [56. Merge Intervals](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P56_MergeIntervals) | LeetCode | Facebook, Palantir Technologies, Google, Amazon, Uber, LinkedIn, Apple, Microsoft, Bloomberg, Yelp, Zenefits, Twitter | Problems -> Algorithms, Difficulty -> Medium | Array, Sort | Java |
+| 581 | Coding | [57. Insert Interval](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P57_InsertInterval) | LeetCode | LinkedIn, Facebook, Uber, Google, Microsoft, Amazon, Twitter | Problems -> Algorithms, Difficulty -> Hard | Array, Sort | Java |
+| 582 | Coding | [65. Valid Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P65_ValidNumber) | LeetCode | LinkedIn, Facebook, Adobe, Google | Problems -> Algorithms, Difficulty -> Hard | Math, String | Java |
+| 583 | Coding | [66. Plus One](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P66_PlusOne) | LeetCode | Google, Facebook, Uber, Microsoft, Bloomberg, eBay, Adobe, Amazon, Airbnb | Explore -> Algorithms, Difficulty -> Easy | Array, Math | Java |
+| 584 | Coding | [68. Text Justification](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P68_TextJustification) | LeetCode | Apple, Microsoft, Uber, Google, Facebook, Snapchat, Amazon, LinkedIn, Airbnb | Problems -> Algorithms, Difficulty -> Hard | String | Java |
+| 585 | Coding | [76. Minimum Window Substring](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P76_MinimumWindowSubstring) | LeetCode | Facebook, Google, LinkedIn, Amazon, Microsoft, Airbnb, Apple, Uber, Bloomberg, Walmart Labs, VMware, Alibaba, LiveRamp, Netsuite, Yahoo, Adobe, Snapchat | Problems -> Algorithms, Difficulty -> Hard | Hash Table, Two Pointers, String | Java |
+| 586 | Coding | [7. Reverse Integer](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P7_ReverseInteger) | LeetCode | Adobe, Bloomberg, Google, Amazon, Microsoft, Apple, JPMorgan, Facebook, Yahoo, Lyft, NetEase, Alibaba, Aetion, Airbnb, Symantec, Baidu, Huawei, Oracle, Tencent, Twitter, LinkedIn, GoDaddy, eBay, VMware, Epic Systems, Pocket Gems, Quora, Works Applications, Zillow, HTC | Explore -> Algorithms, Difficulty -> Easy | Math | Java |
+| 587 | Coding | [8. String to Integer (atoi)](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P1_P100/P8_StringToIntegerAtoi) | LeetCode | Microsoft, Facebook, Goldman Sachs, Google, Amazon, Apple, Adobe, Cisco, Redfin, Zillow, LinkedIn, Bloomberg, Yahoo, Baidu, Alibaba, VMware, Citrix, eBay, Airbnb, Tencent, Huawei, Uber | Explore -> Algorithms, Difficulty -> Medium | String, Math | Java |
+| 588 | Coding | [205. Isomorphic Strings](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P205_IsomorphicStrings) | LeetCode | LinkedIn, Google, Bloomberg, Yahoo, eBay | Problems -> Algorithms, Difficulty -> Easy | Hash Table | Java |
+| 589 | Coding | [206. Reverse Linked List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P206_ReverseLinkedList) | LeetCode | Microsoft, Apple, Amazon, Facebook, Bloomberg, Yandex, Adobe, Mathworks, Google, Goldman Sachs, Cisco, Nvidia, VMware, Alibaba, Oracle, Baidu, Intuit, Intel, Paypal, Two Sigma, Tencent, Expedia, Yahoo, Walmart Labs, TripAdvisor, Qualcomm, Zynga, Zappos, Citrix, SAP, Nutanix, eBay, EMC, Snapchat, Zenefits, Yelp, Uber, Twitter | Explore -> Interview -> Top Interview Questions - Easy, Difficulty -> Easy | Linked List | Java |
+| 590 | Coding | [211. Add and Search Word - Data structure design](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P211_AddAndSearchWord_DataStructureDesign) | LeetCode | Facebook, Amazon | Problems -> Algorithms, Difficulty -> Medium | Backtracking, Design, Trie | Java |
+| 591 | Coding | [217. Contains Duplicate](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P217_ContainsDuplicate) | LeetCode | Adobe, Microsoft, Google, Bloomberg, Amazon, Yahoo, Facebook, Baidu, Yelp, Airbnb, Palantir Technologies | Problems -> Algorithms, Difficulty -> Easy | Array, Hash Table | Java |
+| 592 | Coding | [236. Lowest Common Ancestor of a Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P236_LowestCommonAncestorOfABinaryTree) | LeetCode | LinkedIn, Microsoft, Tencent, Bloomberg, Uber, Amazon, Facebook, Apple | Problems -> Algorithms, Difficulty -> Medium | Tree | Java |
+| 593 | Coding | [237. Delete Node in a Linked List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P237_DeleteNodeInALinkedList) | LeetCode | Microsoft, Paypal, Apple, Amazon, VMware, Google, Adobe, Bloomberg, Capital One, NetEase, Tencent, Baidu | Explore -> Algorithms, Difficulty -> Easy | Linked List | Java |
+| 594 | Coding | [238. Product of Array Except Self](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P238_ProductOfArrayExceptSelf) | LeetCode | LinkedIn, Microsoft, Yelp, Expedia, Zenefits, Google, Hulu, Apple, Amazon, Facebook, Lyft | Problems -> Algorithms, Difficulty -> Medium | Array | Java |
+| 595 | Coding | [242. Valid Anagram](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P242_ValidAnagram) | LeetCode | Bloomberg, Google, Microsoft, Apple, Yahoo, Uber, Facebook, Amazon, Goldman Sachs, Paypal, VMware, Snapchat, Samsung, Oracle, Cisco, Yelp, LeetCode | Explore -> Algorithms, Difficulty -> Easy | Hash Table, Sort | Java |
+| 596 | Coding | [243. Shortest Word Distance](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P243_ShortestWordDistance) | LeetCode | LinkedIn, Microsoft, Indeed | Problems -> Algorithms, Difficulty -> Easy | Array | Java |
+| 597 | Coding | [244. Shortest Word Distance 2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P244_ShortedWordDistance2) | LeetCode | LinkedIn, Uber, Indeed, Bloomberg | Problems -> Algorithms, Difficulty -> Medium | Hash Table, Design | Java |
+| 598 | Coding | [245. Shortest Word Distance 3](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P245_ShortestWordDistance3) | LeetCode | LinkedIn | Problems -> Algorithms, Difficulty -> Medium | Array | Java |
+| 599 | Coding | [254. Factor Combinations](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P254_FactorCombinations) | LeetCode | LinkedIn, Bloomberg, Uber | Problems -> Algorithms, Difficulty -> Medium | Backtracking | Java |
+| 600 | Coding | [256. Paint House](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P256_PaintHouse) | LeetCode | LinkedIn | Problems -> Algorithms, Difficulty -> Easy | Dynamic Programming | Java |
+| 601 | Coding | [272. Closest Binary Search Tree Value II](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P272_ClosestBinarySearchTreeValue2) | LeetCode | LinkedIn, ForUsAll | Problems -> Algorithms, Difficulty -> Hard | Stack, Tree |  |
+| 602 | Coding | [277. Find the Celebrity](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P277_FindTheCelebrity) | LeetCode | LinkedIn, Facebook, Microsoft, Pinterest, Apple, Yahoo | Problems -> Algorithms, Difficulty -> Medium | Array | Java |
+| 603 | Coding | [283. Move Zeroes](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P283_MoveZeroes) | LeetCode | Facebook, Google, SAP, Walmart Labs, Bloomberg, Microsoft, Apple, eBay, Uber, Paypal, Baidu, Lyft, Amazon, Yahoo, Oracle | Problems -> Algorithms, Difficulty -> Easy | Array, Two Pointers | Java |
+| 604 | Coding | [297. Serialize and Deserialize Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P201_P300/P297_SerializeAndDeserializeBinaryTree) | LeetCode | LinkedIn, Facebook, Amazon, Google, Microsoft, Intuit, Uber, Bloomberg, Apple, Yahoo | Problems -> Algorithms, Difficulty -> Hard | Tree, Design | Java |
+| 605 | Coding | [311. Sparse Matrix Multiplication](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P311_SparseMatrixMultiplication) | LeetCode | LinkedIn, Facebook, Google, Microsoft | Problems -> Algorithms, Difficulty -> Medium | Hash Table | Java |
+| 606 | Coding | [339. Nested List Weight Sum](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P339_NestedListWeightSum) | LeetCode | LinkedIn, Facebook, Snapchat | Problems -> Algorithms, Difficulty -> Easy | Depth-first Search | Java |
+| 607 | Coding | [344. Reverse String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P344_ReverseString) | LeetCode | Microsoft, Apple, Bloomberg, Adobe, Google, GoDaddy, Walmart Labs, Alibaba, Goldman Sachs, Tencent, eBay, Amazon, Facebook, Baidu, LinkedIn, Airbnb, VMware, IBM, Cisco | Explore -> Algorithms, Difficulty -> Easy | String, Two Pointers | Java |
+| 608 | Coding | [350. Intersection of Two Arrays II](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P350_IntersectionOfTwoArrays2) | LeetCode | Facebook, Google, Oracle, Yelp, Bloomberg, Amazon, Alibaba | Problems -> Algorithms, Difficulty -> Easy | Hash Table, Two Pointers, Binary Search, Sort | Java |
+| 609 | Coding | [364. Nested List Weight Sum II](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P364_NestedListWeightSum2) | LeetCode | LinkedIn | Problems -> Algorithms, Difficulty -> Medium | Depth-first Search | Java |
+| 610 | Coding | [366. Find Leaves of Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P366_FindLeavesOfBinaryTree) | LeetCode | LinkedIn, Pocket Gems, Bloomberg | Problems -> Algorithms, Difficulty -> Medium | Tree, Depth-first Search | Java |
+| 611 | Coding | [367. Valid Perfect Square](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P367_ValidPerfectSquare) | LeetCode | LinkedIn, Facebook, Microsoft | Problems -> Algorithms, Difficulty -> Easy | Math, Binary Search | Java |
+| 612 | Coding | [387. First Unique Character in a String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P301_P400/P387_FirstUniqueCharacterInAString) | LeetCode | Bloomberg, Facebook, Amazon, Apple, Zillow, Goldman Sachs, Google, Microsoft, Yahoo, Airbnb, SAP, Alibaba, Oracle | Explore -> Algorithms, Difficulty -> Easy | String, Hash Table | Java |
+| 613 | Coding | [464. Can I Win](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P401_P500/P464_CanIWin) | LeetCode | LinkedIn, Google | Problems -> Algorithms, Difficulty -> Medium | Dynamic Programming, Minmax | Java |
+| 614 | Coding | [515. Find Largest Value in Each Tree Row](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P501_P600/P515_FindLargestValueInEachTreeRow) | LeetCode | LinkedIn | Problems -> Algorithms, Difficulty -> Medium | Tree, Depth-first Search, Breadth-first Search | Java |
+| 615 | Coding | [605. Can Place Flowers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P601_P700/P605_CanPlaceFlowers) | LeetCode | LinkedIn | Problems -> Algorithms, Difficulty -> Easy | Array | Java |
+| 616 | Coding | [633. Sum of Square Numbers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P601_P700/P633_SumOfSquareNumbers) | LeetCode | LinkedIn, Facebook | Problems -> Algorithms, Difficulty -> Easy | Math | Java |
+| 617 | Coding | [647. Palindromic Substrings](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P601_P700/P647_PalindromicSubstrings) | LeetCode | LinkedIn, Twitter, Pure Storage, Facebook, Amazon, Expedia, Google, Microsoft, Apple, Uber | Problems -> Algorithms, Difficulty -> Medium | String, Dynamic Programming | Java |
+| 618 | Coding | [671. Second Minimum Node In a Binary Tree](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P601_P700/P671_SecondMinimumNodeInABinaryTree) | LeetCode | LinkedIn, Microsoft, Apple | Problems -> Algorithms, Difficulty -> Easy | Tree | Java |
+| 619 | Coding | [698. Partition to K Equal Sum Subsets](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P601_P700/P698_PartitionToKEqualSumSubsets) | LeetCode | LinkedIn, Bloomberg | Problems -> Algorithms, Difficulty -> Medium | Dynamic Programming, Recursion | Java |
+| 620 | Coding | [716. Max Stack](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P701_P800/P716_MaxStack) | LeetCode | LinkedIn, Lyft, Google, Pure Storage | Problems -> Algorithms, Difficulty -> Hard | Design | Java |
+| 621 | Coding | [730. Count Different Palindromic Subsequences](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P701_P800/P730_CountDifferentPalindromicSubsequences) | LeetCode | LinkedIn | Problems -> Algorithms, Difficulty -> Hard | String, Dynamic Programming | Java |
+| 622 | Coding | [921. Minimum Add to Make Parentheses Valid](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/LeetCode/src/Problems/P901_P1000/P921_MinimumAddToMakeParenthesesValid) | LeetCode | Facebook | Problems -> Algorithms, Difficulty -> Medium | Stack, Greedy | Java |
+| 623 | Coding | [Binary Tree to Doubly Linked List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/BinaryTreeToDoublyLinkedList) | Miscellaneous |  | Difficulty | Binary Tree |  |
+| 624 | Coding | [Clone a Linked List with Next and Random Pointers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/CloneLinkedListWithNextAndRandomPointer) |  | Amazon | Difficulty -> Medium | Linked List, HashMap | Java |
+| 625 | Coding | [Common Letters in Input Strings](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/CommonLettersInInputStrings) | Miscellaneous | Google | Difficulty -> Easy | HashMap, Strings | Java |
+| 626 | Coding | [Find if Number is Little or Big Endian](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/FindNumberLittleOrBigEndian) | Miscellaneous | Aruba Networks | Difficulty | Math |  |
+| 627 | Coding | [Implement Queue using Stack](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/ImplementQueueUsingStack) | Miscellaneous | Aruba Networks | Difficulty |  |  |
+| 628 | Coding | [In-memory Database with Nested Transaction Support](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/InMemoryDatabaseWithNestedTransactions) |  | Xob | Difficulty -> Medium |  |  |
+| 629 | Coding | [Index Of Last Occurrence Of Element In Array](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/IndexOfLastOccurrenceOfElementInArray) | Miscellaneous | Apple | Difficulty |  |  |
+| 630 | Coding | [Kth Largest Element In Bst](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/KthLargestElementInBst) | Miscellaneous | Aruba Networks | Difficulty |  |  |
+| 631 | Coding | [Level Order Traversal Binary Tree Level By Level](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/LevelOrderTraversalBinaryTreeLevelByLevel) | Miscellaneous |  | Difficulty | Binary Tree | Java |
+| 632 | Coding | [Level Order Traversal Of Binary Tree in Single Line](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/LevelOrderTraversalBinaryTreeSingleLine) | Miscellaneous |  | Difficulty | Binary Tree | Java |
+| 633 | Coding | [Map Words List to Grid](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/MapWordsListToGrid) | Miscellaneous |  | Difficulty |  | Java |
+| 634 | Coding | [Mapping between Message and Code](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/MappingBetweenMessageAndCode) | Miscellaneous | GoDaddy | Difficulty | HashMap | Java |
+| 635 | Coding | [Find the number of distinct islands](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/NumberOfDistinctIslands) | Miscellaneous | Qualtrics | Difficulty -> Medium | Depth-first Search, Breadth-first Search, Union Find | Java |
+| 636 | Coding | [Remove Duplicates and Return List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/RemoveDuplicatesAndReturnList) |  | Google | Difficulty -> Easy | Array, HashMap | Java |
+| 637 | Coding | [Remove Duplicates and Return Weighted List](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/RemoveDuplicatesAndReturnWeightedList) | Miscellaneous | Google | Difficulty -> Medium | Array, HashMap | Java |
+| 638 | Coding | [Reverse a String](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/ReverseString) | Miscellaneous | Aruba Networks | Difficulty | Strings |  |
+| 639 | Coding | [Rotate the Bits of a Number](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/RotateTheBitsOfANumber) | Miscellaneous | Aruba Networks | Difficulty | Math |  |
+| 640 | Coding | [Seed Records Per Bin](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/SeedRecordsPerBin) | Miscellaneous | The Climate Corporation | Difficulty -> Easy |  | csharp |
+| 641 | Coding | [Simple Product Sorting](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/SortCommaSeparatedProducts) | Miscellaneous | Shopify | Difficulty -> Easy | Arrays, Sorting | Java |
+| 642 | Coding | [Swap Two Pointers](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/SwapTwoPointers) | Miscellaneous | Aruba Networks | Difficulty | Pointers |  |
+| 643 | Coding | [Top Three Sequence Visited](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/TopThreeSequenceVisited) | Miscellaneous | Amazon | Difficulty |  |  |
+| 644 | Coding | [Truck Loading Find Total Weight](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/Coding/TruckLoadingTotalWeight) | Miscellaneous | Wayfair | Difficulty -> Easy |  | Java, csharp |
+| 645 | Coding | [Blum-Floyd-Pratt-Rivest-Tarjan Algorithm](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/BlumFloydPrattRivestTarjanAlgorithm) | Miscellaneous |  | Known Algorithms -> Named Algorithms, Difficulty -> Medium | Array |  |
+| 646 | Coding | [Edmonds–Karp Algorithm](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/EdmondsKarpAlgorithm) | Miscellaneous |  | Known Algorithms -> Named Algorithms, Difficulty -> Medium |  |  |
+| 647 | Coding | [Ford–Fulkerson Algorithm](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/FordFulkersonAlgorithm) | Miscellaneous |  | Known Algorithms -> Named Algorithms, Difficulty -> Medium |  |  |
+| 648 | Coding | [Kadane's Algorithm](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/KadanesAlgorithm) | Miscellaneous |  | Known Algorithms -> Named Algorithms, Difficulty -> Medium | Breadth-first Search |  |
+| 649 | Coding | [Knuth–Morris–Pratt Algorithm](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/KnuthMorrisPrattAlgorithm) | Miscellaneous |  | Known Algorithms -> Named Algorithms, Difficulty -> Hard | String, Array |  |
+| 650 | Coding | [Krushal's Algorithm](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/KruskalsAlgorithm) | Miscellaneous |  | Known Algorithms -> Named Algorithms, Difficulty -> Hard | Tree, Graph |  |
+| 651 | Coding | [Lee Algorithm](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/LeeAlgorithm) | Miscellaneous |  | Known Algorithms -> Named Algorithms, Difficulty -> Medium | Breadth-first Search |  |
+| 652 | Coding | [Manacher's Algorithm](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/KnownAlgorithms/_NamedAlgorithms/ManachersAlgorithm) | Miscellaneous |  | Known Algorithms -> Named Algorithms, Difficulty -> Hard | String |  |
+| 653 | Systems Design | [Design an automated parking garage with object models and APIs](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/SystemsDesign/AutomatedParkingGarage) | Miscellaneous | Wayfair | Difficulty -> Medium | Object Oriented Design |  |
+| 654 | Systems Design | [Design the Backend for an Online Retailer](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/SystemsDesign/DesignBackendForOnlineRetailer) | Miscellaneous | Amazon | Difficulty -> Medium | Distributed Systems Design |  |
+| 655 | Systems Design | [Design a Paywall for a News Portal](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/SystemsDesign/DesignPaywall) | Miscellaneous | Qualtrics | Difficulty -> Medium | Distributed Systems Design |  |
+| 656 | Systems Design | [Elevator with Scheduling Algorithm](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/SystemsDesign/Elevator) | Miscellaneous | Box | Difficulty -> Medium | Distributed Systems Design, Object Oriented Design |  |
+| 657 | Systems Design | [Images Deduplicator](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/SystemsDesign/ImagesDedeplicator) | Miscellaneous | Netflix | Difficulty -> Medium | Distributed Systems Design |  |
+| 658 | Systems Design | [Scaling Read Requests](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Miscellaneous/src/Problems/SystemsDesign/ScalingReadRequests) | Miscellaneous |  | Difficulty -> Easy | Distributed Systems Design |  |
+| 659 | Coding | [All K Subsequence Maximums](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Blog/SlidingWindow/AllKSubsequenceMaximums) | Pramp |  |  |  |  |
+| 660 | Coding | [Maximum Sum Subsequence](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Blog/SlidingWindow/MaximumSumSubsequence) | Pramp |  |  |  |  |
+| 661 | Coding | [Moving Average](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Blog/SlidingWindow/MovingAverage) | Pramp |  |  |  |  |
+| 662 | Behavioral | [Behavioral Question Set 10](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/Behavioral/BehavioralQuestionSet10) | Pramp |  | Difficulty |  |  |
+| 663 | Behavioral | [Behavioral Question Set 2](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/Behavioral/BehavioralQuestionSet2) | Pramp |  | Difficulty |  |  |
+| 664 | Behavioral | [Behavioral Question Set 3](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/Behavioral/BehavioralQuestionSet3) | Pramp |  | Difficulty |  |  |
+| 665 | Behavioral | [Behavioral Question Set 4](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/Behavioral/BehavioralQuestionSet4) | Pramp |  | Difficulty |  |  |
+| 666 | Coding | [Array Quadruplet](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/DataStructuresAndAlgorithms/ArrayQuadruplet) | Pramp |  | Difficulty |  | Java |
+| 667 | Coding | [Basic Regex Parser](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/DataStructuresAndAlgorithms/BasicRegexParser) | Pramp |  | Difficulty |  |  |
+| 668 | Coding | [BST Successor Search](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/DataStructuresAndAlgorithms/BstSuccessorSearch) | Pramp |  | Difficulty |  | Java |
+| 669 | Coding | [Decrypt Message](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/DataStructuresAndAlgorithms/DecryptMessage) | Pramp |  | Difficulty |  | Java |
+| 670 | Coding | [Number of Paths](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/DataStructuresAndAlgorithms/NumberOfPaths) | Pramp |  | Difficulty | Dynamic Programming | Java |
+| 671 | Systems Design | [Key-Value Cache for Search Engine](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/SystemDesign/KeyValueCacheForSearchEngine) | Pramp |  | Difficulty |  |  |
+| 672 | Systems Design | [Sales Rank](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/SystemDesign/SalesRank) | Pramp |  | Difficulty |  |  |
+| 673 | Systems Design | [Scale on the Cloud](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/SystemDesign/ScaleOnTheCloud) | Pramp |  | Difficulty |  |  |
+| 674 | Systems Design | [Social Graph](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/SystemDesign/SocialGraph) | Pramp |  | Difficulty |  |  |
+| 675 | Systems Design | [Twitter](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/SystemDesign/Twitter) | Pramp |  | Difficulty |  |  |
+| 676 | Systems Design | [Web Crawler](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Pramp/src/Problems/SystemDesign/WebCrawler) | Pramp |  | Difficulty |  |  |
+| 677 | Course | [AWS Certified Solutions Architect - Associate](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Udemy/src/acloudguru-aws-certified-solutions-architect-associate) | Udemy |  | Courses -> AWS Certified Solutions Architect - Associate, Instructors -> Ryan Kroonenburg, Instructors -> Faye Ellis | Distributed Systems, Cloud Computing, Amazon Web Services |  |
+| 678 | Course | [The Ultimate Hands-On Hadoop - Tame your Big Data!](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Udemy/src/the-ultimate-handson-hadoop-tame-your-big-data) | Udemy |  | Courses -> The Ultimate Hands-On Hadoop - Tame your Big Data!, Instructors -> Frank Kane | Distributed Systems, Big Data |  |
+| 679 | Course | [Ultimate AWS Certified Solutions Architect Associate](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/Udemy/src/ultimate-aws-certified-solutions-architect-associate) | Udemy |  | Courses -> Ultimate AWS Certified Solutions Architect Associate, Instructors -> Stephane Maarek | Distributed Systems, Cloud Computing, Amazon Web Services |  |
+| 680 | Reading | [Building Microservices -  Designing Fine-Grained Systems](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/_notes/books/building-microservices_designing-fine-grained-systems) | Notes - Book |  | Books, Authors -> Sam Neuman | Distributed Systems, Cloud Computing, DevOps, Microservices |  |
+| 681 | Reading | [Designing Data Intensive Applications](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/_notes/books/designing-data-intensive-applications) | Notes - Book |  | Books, Authors -> Martin Kleppmann | Distributed Systems, Cloud Computing, Databases |  |
+| 682 | Reading | [Distributed systems for fun and profit](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/_notes/books/distributed-systems-for-fun-and-profit) | Notes - Book |  | Books, Authors -> Mikito Takada -> alias -> mixu | Distributed Systems, Cloud Computing |  |
+| 683 | Reading | [I Heart Logs: Event Data, Stream Processing, and Data Integration](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/_notes/books/i-heart-logs_event-data-stream-processing-data-integration) | Notes - Book |  | Books, Authors -> Jay Kreps | Distributed Systems, Event Data, Data Integration, Stream Processing |  |
+| 684 | Reading | [Production-Ready Microservices](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/_notes/books/production-ready-microservices) | Notes - Book |  | Books, Authors -> Susan Fowler | Distributed Systems, Cloud Computing, Microservices, DevOps, Site Reliability Engineering |  |
+| 685 | Reading | [Scaling Teams: Strategies for Building Successful Teams and Organizations](https://github.com/computer-science-engineering/learning-computer-science/tree/master/src/_notes/books/scaling-teams_strategies-for-building-successful-teams-and-organizations) | Notes - Book |  | Books, Authors -> Alexander Grosse, Authors -> David Loftesness | Engineering Leadership |  |
\ No newline at end of file
diff --git a/src/react-next-website/.gitkeep b/src/react-next-website/.gitkeep
deleted file mode 100644
index e69de29..0000000
