tech-interview-handbook/website/sidebars.js

module.exports = {
  docs: {
    Preface: ['introduction', 'landscape'],
    'Job Application': [
      'resume',
      'resume-case-study',
      'resume-sample',
      'cover-letter',
    ],
    'Interview Process': [
      'interview-formats',
      'self-introduction',
      {
        type: 'category',
        label: 'Coding Round',
        items: [
          'coding-round-overview',
          'picking-a-language',
          'study-and-practice',
          'best-practice-questions',
          'during-coding-interview',
          'cheatsheet',
          'coding-signals',
          'mock-interviews',
          'interviewer-cheatsheet',
        ],
      },
      {
        type: 'category',
        label: 'Behavioral Round',
        items: [
          'behavioral-round-overview',
          'star-format',
          'behavioral-questions',
          'psychological-tricks',
        ],
      },
      'questions-to-ask',
    ],
    'Post Interview': ['understanding-compensation', 'negotiation'],
    Algorithms: [
      'algorithms/algorithms-introduction',
      'algorithms/array',
      'algorithms/binary',
      'algorithms/dynamic-programming',
      'algorithms/geometry',
      'algorithms/graph',
      'algorithms/hash-table',
      'algorithms/heap',
      'algorithms/interval',
      'algorithms/linked-list',
      'algorithms/math',
      'algorithms/matrix',
      'algorithms/oop',
      'algorithms/permutation',
      'algorithms/queue',
      'algorithms/recursion',
      'algorithms/sorting-searching',
      'algorithms/stack',
      'algorithms/string',
      'algorithms/tree',
      'algorithms/trie',
    ],
  },
};