33 lines
1 KiB
Text
33 lines
1 KiB
Text
---
|
|
id: ds
|
|
title: Data Structures
|
|
author: Nathan Wang, Darren Yao, Benjamin Qi
|
|
description: Introductory problems using sets and maps.
|
|
prerequisites:
|
|
- Bronze - "Built-In C++ Containers" or "Built-In Java Collections"
|
|
---
|
|
|
|
## Standard
|
|
|
|
- [yosupo - Associative Array](https://judge.yosupo.jp/problem/associative_array)
|
|
- CSES
|
|
- Do roughly the first half of the Sorting and Searching section in the [CSES Problem Set](https://cses.fi/problemset/)
|
|
- [Distinct Numbers](https://cses.fi/problemset/task/1621)
|
|
- [Concert Tickets](https://cses.fi/problemset/task/1091)
|
|
- Uses iterators
|
|
- [Sum of Two Values](https://cses.fi/problemset/task/1640)
|
|
- Uses iterators
|
|
- Can be solved without sets
|
|
|
|
<problems-list>
|
|
<problem
|
|
name="CSES Towers"
|
|
cses="1073"
|
|
difficulty="Easy" />
|
|
</problems-list>
|
|
|
|
## Other Problems
|
|
|
|
- [Polycarp's Phone Book](http://codeforces.com/contest/860/problem/B) [](56)
|
|
- String processing, maps, brute force
|
|
- Slightly hard for bronze, perhaps (very) easy silver?
|