| Hash Max Bucket |
★ |
d62_q4a_hash_max_bucket.pdf |
Solution |
testcase แรกในโจทย์ผิด ต้องเป็น 1 1 1 2 3 |
| Hash Longest Find |
★★ |
d66_f1_longest_find.pdf |
not done |
|
| Hash to Vector |
★☆ |
ds04_hash_tov.pdf |
not done |
|
| BST Split |
★★★☆ |
d59_q3_bst_split.pdf |
not done |
|
| Optimal Binary Search Tree |
★★☆ |
ds04_best_bst.pdf |
Solution |
|
| Left Child Right Sibling |
★☆ |
d66_f1_lcrs.pdf |
not done |
|
| BST Trim |
★★ |
d66_q4a_bst_trim.pdf |
Solution |
|
| Imbalance |
★★ |
d61_q2_imbalance.pdf |
Solution |
เลขใน main.cpp เหมือนใน PDF แต่จริงๆคนละ tree, ถ้า test ใน main.cpp ต้องได้ 76 |
| Shallowest Leaf |
★★ |
d63_q4b_shallowest.pdf |
not done |
|
| Tree Leaves Depth |
★☆ |
da66_m1_tree_leaves_depth.pdf |
not done |
|
| Count Unary |
★☆ |
d58_q3_unary.pdf |
not done |
|
| ต้นไม้เหมือน |
★☆ |
d60_q3_same_tree.pdf |
not done |
|
| Subtree Extract |
★★ |
d64_q4a_subtree.pdf |
not done |
|
| Leaves Count |
★☆ |
d63_q4a_leaves_count.pdf |
not done |
|
| BST at level |
★☆ |
d65_q4a_bst_at_level.pdf |
Solution |
|
| Map Key in Range |
★★ |
d66_f1_map_k_range.pdf |
Solution |
|
| List Block Swap |
★★★ |
d66_q4a_list_block_swap.pdf |
not done |
|
| List Split |
★★ |
d59_q3_list_split.pdf |
Solution |
|
| List check |
★★☆ |
d65_q4a_list_check.pdf |
Solution |
|
| Split List |
★★ |
d61_q2_splitlist.pdf |
not done |
|
| List Extract |
★★ |
d63_q4b_list_extract.pdf |
not done |
|
| Playlist Management |
★★ |
ds04_playlist.pdf |
Solution |
|
| Shift |
★☆ |
d57_q3_shift.pdf |
Solution |
|
| List Remove All |
★☆ |
d60_q3_lremove_all.pdf |
Solution |
|
| List Merge |
★☆ |
d64_q4a_list_merge.pdf |
Solution |
|
| Zuma |
★★★ |
d57_q3_zuma.pdf |
Solution |
|
| List Replace |
★★ |
d58_q3_list_replace.pdf |
Solution |
|
| List Reverse |
★★ |
d63_q4a_list_reverse.pdf |
Solution |
|
| Heap Ordering 2 |
★☆ |
d57_q2_heap_order2.pdf |
Solution |
tf ทำไมมันดูเหมือน ds03_heap_order เดะๆเลย |
| Heap Equality |
★☆ |
d58_q2_hequal.pdf |
not done |
|
| Heap Node Relation 2 |
★★ |
d65_q3a_heap_relation_2.pdf |
Solution |
|
| K-Ary Heap |
★☆ |
d57_q2_kheap.pdf |
not done |
|
| K-ary Heap Height |
★☆ |
d62_q3b_kheap_height.pdf |
not done |
|
| Heap K-th |
★☆ |
d64_q3a_heap_kth.pdf |
not done |
|
| K-ary Heap Check |
★★ |
d66_q3a_kheap_check.pdf |
Solution |
|
| Heap Descendant |
★★ |
d62_q3a_heap_descendant.pdf |
not done |
|
| Heap Level |
★★ |
d64_q3b_heap_level.pdf |
Solution |
|
| Car Brake |
★★ |
d66_q1b_car_brake.pdf |
Solution |
|
| Heap Change Value |
★☆ |
d63_q3b_heap_change.pdf |
Solution |
|
| Heap Check |
★☆ |
d65_q3b_heap_check.pdf |
Solution |
|
| Heap Ordering |
★☆ |
ds03_heap_order.pdf |
Solution |
|
| Heap Find |
★☆ |
d59_q2_heap_find.pdf |
Solution |
|
| Heap Node Relation |
★☆ |
d62_q3a_heap_node_relation.pdf |
Solution |
|
| Heap Before Node |
★★ |
da66_m1_heap_before_node.pdf |
Solution |
|
| Heap Erase |
★☆ |
ds03_heap_erase.pdf |
Solution |
|
| Custom Order |
★ |
d58_q2_custom.pdf |
Solution |
i use tuple btw |
| Heap Height |
★ |
d60_q2_heap_height.pdf |
Solution |
|
| Rank in Heap |
★ |
d63_q3a_rank_in_heap.pdf |
Solution |
|
| Stack Vertical Split |
★★ |
d66_q2a_stack_vertical_split.pdf |
not done |
|
| Vector Range Erase |
★★☆ |
d66_q2a_vector_range_erase.pdf |
Solution |
|
| Vector Partial Sort |
★☆ |
d66_q2c_vector_partial_sort.pdf |
Solution |
|
| Dense Graph |
★☆ |
d57_q1_dense.pdf |
Solution |
|
| Sparse Graph |
★☆ |
d57_q1_sparse.pdf |
Solution |
|
| Stack Reverse |
★☆ |
d66_q2b_stack_reverse.pdf |
Solution |
|
| Queue Vertical Split |
★★ |
d66_q3a_queue_vertical_split.pdf |
not done |
|
| Queue Free Space |
☆ |
d66_q3b_queue_free.pdf |
not done |
|
| Queue Remove Many |
★ |
da66_m1_queue_remove_many.pdf |
Solution |
|
| Queue to Vector |
★☆ |
d58_q1_to_vector.pdf |
Solution |
|
| Queue Check |
★★☆ |
d64_q3a_queue_check.pdf |
not done |
take a look at this one |
| Queue Reverse |
★★ |
d64_q3b_queue_reverse.pdf |
Solution |
|
| Queue Total Reverse |
★★☆ |
d65_q3b_queue_total_reverse.pdf |
Solution |
|
| Queue Equality |
★☆ |
d59_q2_queue_equality.pdf |
Solution |
|
| Split Queue |
★☆ |
d60_q2_split_queue.pdf |
Solution |
|
| Multi Count |
★☆ |
d62_q2a_multi_count.pdf |
Solution |
|
| Queue Move to Front |
★☆ |
d62_q3b_queue_m2f.pdf |
Solution |
test case ตัวอย่างใน PDF ผิด |
| Queue Move to Back |
★☆ |
d63_q3a_queue_m2b.pdf |
Solution |
|
| Queue Back to Front |
★☆ |
d63_q3b_queue_b2f.pdf |
Solution |
|
| Queue At |
★ |
d60_q1_qat.pdf |
Solution |
circular queue intro |
| Append |
★☆ |
d61_q1_append.pdf |
Solution |
|
| Queue Min Element |
★☆ |
d65_q3a_queue_min.pdf |
not done |
|
| Stack From Set |
★★ |
d64_q2a_stack_from_set.pdf |
not done |
|
| Move Insert Stack |
★★ |
d64_q2c_stack_move_insert.pdf |
Solution |
|
| 1: Stack Mitosis |
★☆ |
d65_q2a_mitosis.pdf |
Solution |
|
| Split Stack |
★☆ |
d65_q2b_split_stack.pdf |
Solution |
|
| Stack by Vector |
★☆ |
d57_q1_sbv.pdf |
not done |
|
| Stack by Vector 2 |
★☆ |
d57_q1_sbv2.pdf |
not done |
|
| Stack Distribute |
★★ |
d64_q2b_stack_distribute.pdf |
not done |
|
| Pop Many |
★☆ |
d59_q1_pop_many.pdf |
not done |
|
| Stack Deep Push |
★☆ |
d62_q2b_stack_deep_push.pdf |
not done |
|
| Stack Reserve Compare |
★ |
d63_q2b_stack_reserve.pdf |
not done |
|
| 2: Vector No Move |
★★☆ |
d65_q2a_no_move.pdf |
Solution |
|
| Vector Some Move |
★★★★☆ |
d65_q2b_some_move.pdf |
Solution |
|
| Insert Many |
★★ |
d62_q2b_vector_insert_many.pdf |
not done |
|
| Swap Vector |
★★ |
d62_q2c_vector_swap.pdf |
not done |
|
| Vector Rotate |
★★ |
d64_q2b_vector_rotate.pdf |
not done |
|
| Range Insert |
★★ |
d59_q1_range_insert.pdf |
Solution |
|
| Vector Block Swap |
★☆ |
d64_q2a_vector_block_swap.pdf |
Solution |
|
| Vector less |
★☆ |
d64_q2c_vector_less.pdf |
not done |
|
| Erase Many from Vector |
★★ |
d58_q1_erase_many.pdf |
Solution |
|
| Vector Unique |
★☆ |
d60_q1_v_uniq.pdf |
Solution |
|
| Ordered Set |
★☆ |
d61_q1_ordered_set.pdf |
not done |
|
| Iterator Check |
★ |
d62_q2a_iterator_check.pdf |
Solution |
|
| Wasted Space |
★ |
d62_q2c_wasted_space.pdf |
not done |
|
| Vector Mirror |
★☆ |
d63_q2a_vector_mirror.pdf |
not done |
|
| Vector Equality |
★ |
d57_q1_vequal.pdf |
not done |
|
| Vector Compress |
★ |
d63_q2b_vector_compress.pdf |
not done |
|
| Is Reverse? |
★ |
ds02_is_reverse.pdf |
not done |
|
| Pair GTE |
★ |
d63_q2a_pair_gte.pdf |
not done |
|
| Booking |
★★ |
d66_q1a_booking.pdf |
not done |
|
| Top Sale |
★★☆ |
d66_q1a_topsale.pdf |
not done |
|
| Company Department |
★★ |
d66_q1c_company_department.pdf |
not done |
|
| Line Monopoly |
- |
da66_m1_line_monopoly.pdf |
not done |
|
| Restaurant |
★★ |
ex00m1.pdf |
Solution |
|
| Auction |
★☆ |
ex00m2.pdf |
Solution |
|
| 3: Cross 2D |
★★ |
d65_q1b_cross_2d.pdf |
not done |
|
| 4: Sparse Vector |
★★☆ |
d65_q1b_sparse_vector.pdf |
not done |
|
| Ice Cream |
★★ |
d65_q1c_ice_cream.pdf |
Solution |
|
| Min of Max |
★★☆ |
d65_q1c_min_of_max.pdf |
Solution |
|
| Zipcode |
★☆ |
d60_q0_zipcode.pdf |
Solution |
|
| Queue Count |
★☆ |
d62_q1b_queue_count.pdf |
Solution |
|
| Food Delivery |
★★★ |
d65_q1a_delivery.pdf |
Solution |
|
| Evaluate Postfix |
★★ |
d57_q1_postfix.pdf |
Solution |
|
| Stack Concatenate |
★☆ |
d59_q0_stack_concat.pdf |
Solution |
|
| Second Min |
★☆ |
d64_q1a_second_min.pdf |
Solution |
|
| Moving Median |
★★★☆ |
d64_q1b_moving_median.pdf |
Solution |
doesn't use multiset |
| Password |
★☆ |
d64_q1b_password.pdf |
Solution |
|
| Vector List Erase |
★★ |
d63_q1b_list_erase.pdf |
Solution |
|
| Card Battle |
★★ |
d64_q1a_card_battle.pdf |
Solution |
|
| Member Multiply |
★☆ |
d65_q1a_multiply.pdf |
Solution |
|
| Vector to Map |
★ |
d60_q0_v2m.pdf |
Solution |
|
| Hiatus |
★★☆ |
d63_q1a_hiatus.pdf |
Solution |
|
| Inside Interval |
★★ |
d63_qx_inside_interval.pdf |
Solution |
|
| Histogram |
★ |
d57_q0_histogram.pdf |
Solution |
|
| Interval Count |
★☆ |
d63_q1b_interval_count.pdf |
Solution |
|
| Check Mapping |
★ |
ex00e3.pdf |
Solution |
|
| CUCAS Rating |
★ |
d58_q0_rating.pdf |
Solution |
|
| Vote |
★ |
d62_q1a_vote.pdf |
Solution |
|
| Most Frequent Word |
☆ |
ds01_most.pdf |
Solution |
|
| Intersection |
★ |
ds02_intersection.pdf |
Solution |
|
| Grandfather |
★★ |
d62_q1b_grandfather.pdf |
Solution |
|
| Vector Intersection |
★ |
d62_q1c_vector_intersection.pdf |
Solution |
|
| Pair Sum |
★☆ |
ds01_pair_sum.pdf |
Solution |
|
| Vector Swap |
★☆ |
d59_q0_vector_swap.pdf |
Solution |
|
| Reverse Vector 2 |
★ |
ds00_reverse2.pdf |
Solution |
|
| Vector Punch |
★ |
d62_q1a_punch.pdf |
Solution |
|
| Vector Operation |
☆ |
d62_q1c_vector_op.pdf |
Solution |
|
| Remove Even |
☆ |
d57_q0_remove_even.pdf |
Solution |
|
| Reverse Vector 1 |
☆ |
ds00_reverse.pdf |
Solution |
|
| Time After |
☆ |
ex00e1.pdf |
Solution |
|
| Min Max |
★ |
ex00e2.pdf |
Solution |
|
