Welcome to the fundamental CodePath Computer Science guides on data structures, algorithms and technical interviewing!

Technical Interviewing

• Big O Complexity Analysis
• UMPIRE Interview Strategy
• UMPIRE Cheat Sheets
• UMPIRE Problem Solutions
• TIP101 Breakout Problem Solutions
• TIP102 Breakout Problem Solutions
• TIP103 Breakout Problem Solutions
• DSA for TIP Breakout Problem Solutions

Data Structures

• Linked Lists
  • Temp Head
  • Multiple Pass
  • Linked List Two Pointer
• Hash Tables
• Stacks and Queues
• Heaps
• Strings and Arrays
  • Binary search
  • Two pointer (also known as ‘Sliding Window’)
• Binary Trees
  • Binary Trees Iterative Traversal
  • Binary Trees 2nd Largest Node
  • Delete Node From Binary Search Tree
• Graphs
  • Graph Traversals
  • Topological Sort

Algorithms

• Backtracking
• Dynamic Programming
• Greedy Algorithms
  • Scheduling Meeting Rooms
• Sorting Algorithms
  • Sorting colors