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 6 days ago | View on GitHub

TIP103 Unit 8 Session 2

Part of TIP103 Unit 8

🔗 Problem Statements

Problem Set Version 1 (Solutions Only)

Subsets
Permutations
Combination Sum
Generate Parentheses
Letter Combinations of a Phone Number

Problem Set Version 2 (Solutions Only)

Subsets II
Permutations II
Combinations
Palindrome Partitioning
Word Search

Jump to Section

🔗 Problem Statements
Problem Set Version 1 (Solutions Only)
Problem Set Version 2 (Solutions Only)