Skip to content

learn-co-curriculum/careers-technical-interviewing-resources

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Checklist

Here's a checklist of things that you should probably be prepared to know in a technical interview:

Data types

Basic Bitwise Operations

String Operations

Arrays

Linked Lists

  • Singly Linked
  • Doubly Linked
  • Circular Linked

Queues

Stacks

Heaps

Trees

  • Binary Trees
  • Binary Search Trees
  • Tries
  • Self Balancing Trees

Traversing Trees

  • Breadth First Search - BFS
  • Depth First Search - DFS
  • Preorder, Inorder, Postorder

Graphs

  • Dijkstra's Algorithm / A* Search

Hash Maps

  • Handling Collisions

Sorting algorithms

  • Insertion
  • Selection
  • Merge
  • Quick

Time Complexities

General Guides

Problem Sets

Online Judging Systems

Mock Interviews

Actual Interview Questions

Books

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 4

  •  
  •  
  •  
  •