Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/presidentsam100/cs104c-solutions

Accepted solutions to UT Austin's Competitive Programming (CS104C) Class. (P.S. Don't copy these unless you want to get in trouble)
https://github.com/presidentsam100/cs104c-solutions

Last synced: about 1 month ago
JSON representation

Accepted solutions to UT Austin's Competitive Programming (CS104C) Class. (P.S. Don't copy these unless you want to get in trouble)

Awesome Lists containing this project

README 

        
# CS104C Solutions



Accepted solutions to UT Austin's [Competitive Programming (CS104C) Class](https://www.cs.utexas.edu/users/downing/cs104c/Schedule.html) with solutions primarily written in C++ and Java (with a few Python solutions).



# Course Description



The CS 104C Competitive Programming Course explores numerous algorithms needed to solve problems similar to those found in technical interviews (LeetCode), programming contests (ICPC), and especially other algorithm-focused courses (CS 331). Oftentimes, this involves thinking about corner cases, coming up with creative usage of algorithms, and writing correct implementations under time pressure.



# Table of Contents



## Introduction



1. Gravity Flip

1. Weird Algorithm



## Prefix Sums



1. Greg and Array

1. Number of Ways

1. Ternary Strings

1. Subarray Sums II

1. Subarray Divisibility

1. Playlist



## Graphs and Search Algorithms + Shortest Path I



1. Two Buttons

1. Ostap and Grasshopper

1. Dijkstra?

1. Grid Paths

1. Labyrinth

1. Shortest Routes I



## Shortest Path II



1. Ping-Pong

1. Fight Against Traffic

1. Greg and Graph

1. Cycle Finding

1. High Score

1. Shortest Routes II



## Binary Search



1. Burning Midnight Oil

1. Interesting Drink

1. Multiplication Table

1. Apartments

1. Factory Machines

1. Array Division



## Greedy Algorithms



1. Before an Exam

1. Maximum of Maximum of Minimums

1. Bus

1. Stick Lengths

1. Restaurant Customers

1. Reading Books



## Depth-First Search



1. Maze

1. Protect Sheep

1. Divide by three, multiply by two

1. Chessboard and Queens

1. Apple Division

1. Gray Code



## Number Theory



1. Design Tutorial: Learn from Math

1. Subtractions

1. Primes on Interval

1. Exponentiation II

1. Counting Divisors

1. Binomial Coefficients



## Dynamic Programming I



1. Cut Ribbon

1. The Least Round Way

1. Tetrahedron

1. Dice Combinations

1. Minimizing Coins

1. Coin Combinations I



## Union Find



1. Learning Languages

1. Mike and Feet

1. Edgy Trees

1. Road Construction

1. Building Roads

1. Road Reparation



## Dynamic Programming II



1. Mysterious Present

1. Chain Reaction

1. Python Indentation

1. Coin Combinations II

1. Rectangle Cutting

1. Edit Distance



## String Algorithms



1. Good Substrings

1. Vasiliy's Multiset

1. Common Divisors

1. Word Combinations

1. String Matching

1. Finding Borders



## Segment Trees



1. Xenia and Bit Operations

1. Complicated Computations

1. Dynamic Range Minimum Queries

1. Range Update Queries

1. Salary Queries



## Max Flow



1. Soldier and Traveling

1. Petya and Pipes

1. Flawed Flow

1. Download Speed

1. Police Chase

1. School Dance



## Geometry



1. Han Solo and Lazer Gun

1. View Angle

1. Constellation

1. Point Location Test

1. Polygon Area

1. Line Segment Intersection