kdn251 /interviews

Everything you need to know to get the job.

★ 65,554⑂ 12,918👁 2,556⑃ 195● 60▤ 0
-5
日增长
-4
周增长
65,554
stars
12,918
forks
2,556
watchers
195
prs
60
issues
0
releases

README

Interviews
 Pass your coding interviews with The Daily Byte  
 30,000+ Software Engineers have trusted us with their interview prep.


 Maintainer - Kevin Naughton Jr.

 Translations

- 简体中文

 Table of Contents
- YouTube
- The Daily Byte
- Instagram
- Articles
- Online Judges
- Live Coding Practice
- Data Structures
- Algorithms
- Greedy Algorithms
- Bitmasks
- Runtime Analysis
- Video Lectures
- Interview Books
- Computer Science News
- Directory Tree

 YouTube
 Kevin Naughton Jr.

 The Daily Byte
 FAANG Interview Prep

 Instagram 
 Kevin Naughton Jr.

 Online Judges
 LeetCode
 Virtual Judge
 CareerCup
 HackerRank
 CodeFights
 Kattis
 HackerEarth
 Codility
 Code Forces
 Code Chef
 Sphere Online Judge - SPOJ
 InterviewBit

 Live Mock Interviews
 The Daily Byte

 Live Coding Practice
 The Daily Byte
 Pramp
 Gainlo
 Refdash
 Interviewing.io

 Data Structures
 Linked List
  A Linked List is a linear collection of data elements, called nodes, each
   pointing to the next node by means of a pointer. It is a data structure
   consisting of a group of nodes which together represent a sequence.
  Singly-linked list: linked list in which each node points to the next node and the last node points to null
  Doubly-linked list: linked list in which each node has two pointers, p and n, such that p points to the previous node and n points to the next node; the last node's n pointer points to null
  Circular-linked list: linked list in which each node points to the next node and the last node points back to the first node
  Time Complexity:
    Access: O(n)
    Search: O(n)
    Insert: O(1)
    Remove: O(1)

 Stack
  A Stack is a collection of elements, with two principle operations: push, which adds to the collection, and
   pop, which removes the most recently added element
  Last in, first out data structure (LIFO): the most recently added object is the first to be removed
  Time Complexity:
    Access: O(n)
    Search: O(n)
    Insert: O(1)
    Remove: O(1)

 Queue
  A Queue is a collection of elements, supporting two principle operations: enqueue, which inserts an element
   into the queue, and dequeue, which removes an element from the queue
  First in, first out data structure (FIFO): the oldest added object is the first to be removed
  Time Complexity:
    Access: O(n)
    Search: O(n)
    Insert: O(1)
    Remove: O(1)

 Tree
  A Tree is an undirected, connected, acyclic graph

 Binary Tree
  A Binary Tree is a tree data structure in which each node has at most two children, which are referred to as
   the left child and right child
  Full Tree: a tree in which every node has either 0 or 2 children
  Perfect Binary Tree: a binary tree in which all interior nodes have two children and all leave have the same depth
  Complete Tree: a binary tree in which every level except possibly the last is full and all nodes in the last
   level are as far left as possible

 Binary Search Tree
  A binary search tree, sometimes called BST, is a type of binary tree whic

Top issues

Snapshot: 2026-11-16T09:23:14Z · Data license Apache-2.0 · JSON