| grl_1_c | GRL_1_C All Pairs Shortest Paths | Problem | Solution |
| grl_4_b | GRL_4_B Topological sort | Problem | Solution |
| grl_3_a | GRL_3_A Articulation Points | Problem | Solution |
| grl_3_b | GRL_3_B Bridges | Problem | Solution |
| grl_5_a | GRL_5_a Diameter of a Tree | Problem | Solution |
| grl_2_a | GRL_2_A Minimum Spanning Tree (Kruskal) | Problem | Solution |
| dpl_1_a | DPL_1_A Coin Changing Problem | Problem | Solution |
| dpl_1_b | DPL_1_B 0-1 Knapsack problem | Problem | Solution |
| dpl_1_d | DPL_1_D Longest Increasing Subsequences | Problem | Solution |
| dpl_3_a | DPL_3_A Largest Square | Problem | Solution |
| dpl_3_b | DPL_3_B Largest Rectangle | Problem | Solution |
| dpl_1_c | DPL_1_C Knapsack Problem | Problem | Solution |
| dpl_1_e | DPL_1_E Levenshtein Distance | Problem | Solution |
| ALDS1_13_A | ALDS_1_13_A 8 Queens | Problem | Solution |
| alds1_13_b | ALDS1_13_B 8 Puzzle | Problem | Solution |
| alds1_13_c | ALDS1_13_C 15 Puzzle | Problem | Solution |
| cgl_2_a | CGL_2_A Parallel/Orthogonal | Problem | Solution |
| cgl_1_a | CGL_1_A Projection | Problem | Solution |
| cgl_1_b | CGL_1_B Reflection | Problem | Solution |
| cgl_2_d | CGL_2_D Distance | Problem | Solution |
| cgl_1_c | CGL_1_C Counter-Clockwise | Problem | Solution |
| cgl_2_b | CGL_2_B Intersection | Problem | Solution |
| cgl_2_c | CGL_2_C Cross Point | Problem | Solution |
| cgl_7_d | CGL_7_D Cross points of a line and a circle | Problem | Solution |
| cgl_7_e | CGL_7_E Cross points of circles | Problem | Solution |
| cgl_3_c | CGL_3_C Polygon-Point Containment | Problem | Solution |
| cgl_6_a | CGL_6_A | Segment intersections (Manhattan Geometry) | Problem | Solution |
| alds1_1_c | ALDS1_1_C | Prime Numbers | Problem | Solution |
| alds1_1_b | ALDS1_1_B | Greatest Common Divisor | Problem | Solution |
| ntl_1_b | NTL_1_B | Power | Problem | Solution |