Computer Science

Chapters

Technical Interviewing
Data Structures
Algorithms

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

Updated over 1 year ago | View on GitHub

DSA for TIP Unit 10 Problem Set 1

Part of DSA for TIP Unit 10

🔗 Problem Statements

Problem Set Version 1 (Solutions Only)

Why is it Always You Three
Target Practice
Mirror, Mirror
Magic Loop
The Sorting Hat’s Decision
The Pensieve’s Memories

Jump to Section

🔗 Problem Statements
Problem Set Version 1 (Solutions Only)