Media Summary: 0:10 Reading problem 4:12 Explaining Solution 21:28 Coding Complexities: - O(n log(n)) time - O(n) space n: 00:01:24 A AC 00:03:28 B AC 00:06:47 C1 AC 00:16:33 C2 AC 00:27:29 D AC 00:53:09 E AC 01:25:45 F TL 01:48:32 F AC ... 00:00 Problem A 03:23 Problem B 12:12 Problem C 17:37 Problem D
Overview

Codeforces 559b Div1 Equivalent Strings Arabic - Detailed Analysis

0:10 Reading problem 4:12 Explaining Solution 21:28 Coding Complexities: - O(n log(n)) time - O(n) space n: 00:01:24 A AC 00:03:28 B AC 00:06:47 C1 AC 00:16:33 C2 AC 00:27:29 D AC 00:53:09 E AC 01:25:45 F TL 01:48:32 F AC ... 00:00 Problem A 03:23 Problem B 12:12 Problem C 17:37 Problem D Problem - A String codeforces round 1001 (Div 1 + Div 2) solutions

Gallery

Photo Gallery

Related

Related Patients