UNSW COMP2521

60 problem(s)

Practice coding problems for free with online autotest. Sign in to run and submit.

Arrays: Longest Strictly-Increasing RunEasy
c-dcc
Arrays: Reverse In PlaceEasy
c-dcc
AVL Tree: Self-balancing InsertMedium
c-dcc
AVL Tree: Height After InsertsHard
c-dcc
Complexity: Count a Triangular Double LoopEasy
c-dcc
Complexity: Multiplications in Matrix MultiplyEasy
c-dcc
BST: Insert & SearchMedium
c-dcc
BST: k-th SmallestMedium
c-dcc
Binary Tree: HeightEasy
c-dcc
Binary Tree: Count LeavesEasy
c-dcc
Euler: Count Odd-Degree VerticesEasy
c-dcc
Euler: Circuit / Path / NoneEasy
c-dcc
BFS: Number of Reachable VerticesMedium
c-dcc
BFS: Shortest Unweighted DistanceMedium
c-dcc
BFS: Bipartite CheckHard
c-dcc
DFS: Count Connected ComponentsMedium
c-dcc
DFS: Does a Path ExistEasy
c-dcc
DFS: Detect Cycle (Directed)Hard
c-dcc
Graph: Build the Adjacency MatrixEasy
c-dcc
Graph: Maximum In/Out Degree DifferenceMedium
c-dcc
Hash Table: Bucket SizesEasy
c-dcc
Hash Table: Longest ChainEasy
c-dcc
Heap: Insert (sift-up)Medium
c-dcc
Heap: Delete-max (sift-down)Medium
c-dcc
Heap: k-th LargestHard
c-dcc
Linked List: Build and PrintEasy
c-dcc
Linked List: Recursive SumEasy
c-dcc
MST: Total WeightMedium
c-dcc
MST: Largest Edge in the MSTMedium
c-dcc
Queue: Simulate Dequeue OrderMedium
c-dcc
Queue: Final ContentsMedium
c-dcc
Recursion: FactorialEasy
c-dcc
Recursion: Tower of HanoiMedium
c-dcc
Recursion: Subset SumHard
c-dcc
Sorting: Ascending OrderEasy
c-dcc
Sorting: Stable Sort by KeyMedium
c-dcc
Sorting: Count InversionsHard
c-dcc
Stack: Balanced BracketsMedium
c-dcc
Stack: Decimal to BinaryEasy
c-dcc
Tree Traversal: Pre / In / Post-orderMedium
c-dcc
Tree Traversal: Level Order (BFS)Medium
c-dcc
Trie: count stored wordsEasy
c-dcc
Trie: is it a stored wordMedium
c-dcc
2-3-4 Node: which childEasy
c-dcc
2-3-4 Tree: root after insertionsMedium
c-dcc
Binary Search: Index of TargetEasy
c-gcc
Stack ADT: PUSH / POPEasy
c-gcc
Stable Sort by ScoreEasy
python3
Priority Queue: insert / extract-maxMedium
python3
Dijkstra: Shortest Distances from 0Medium
python3
Topological Order (lexicographically smallest)Medium
python3
21T3 Q6 — Stable sort of studentsHard
c-gcc
21T3 Q7 — Is the digraph a binary tree?Hard
c-gcc
21T3 Q8 — Sum of odd values (rebuild tree)Hard
c-gcc
24T2 Q8 — Append two listsMedium
c-gcc
21T3 Q9 — Number of reachable verticesHard
c-gcc
24T2 Q9 — Longest increasing runHard
c-gcc
24T2 Q10 — Max |in-deg − out-deg|Medium
c-gcc
24T2 Q11 — Day tripHard
c-gcc
24T2 Q12 — Min difference on a BST levelHard
c-gcc