[{"itemType":"task","number":"1","published_number":"1","title":"Class 1. Binary Search","result":"","resultStatus":"","lock":false,"status":"published","taskId":"3820","isOptional":"0","type":"video","isTaskFree":"0","watchLimitRemaining":false,"replayStatus":"","activityStartTimeStr":"","activityStartTime":"","activityLength":"02:02:46","activityEndTime":"","fileStorage":"cloud","isTaskTryLookable":0,"isSingleTaskLesson":true},{"itemType":"task","number":"2","published_number":"2","title":"Class 2. Recursion","result":"","resultStatus":"","lock":false,"status":"published","taskId":"3821","isOptional":"0","type":"video","isTaskFree":"0","watchLimitRemaining":false,"replayStatus":"","activityStartTimeStr":"","activityStartTime":"","activityLength":"01:43:09","activityEndTime":"","fileStorage":"cloud","isTaskTryLookable":0,"isSingleTaskLesson":true},{"itemType":"task","number":"3","published_number":"3","title":"Class 3. Linked List","result":"","resultStatus":"","lock":false,"status":"published","taskId":"3822","isOptional":"0","type":"video","isTaskFree":"0","watchLimitRemaining":false,"replayStatus":"","activityStartTimeStr":"","activityStartTime":"","activityLength":"01:41:33","activityEndTime":"","fileStorage":"cloud","isTaskTryLookable":0,"isSingleTaskLesson":true},{"itemType":"task","number":"4","published_number":"4","title":"Class 4. Mock Interview","result":"","resultStatus":"","lock":false,"status":"published","taskId":"3823","isOptional":"0","type":"video","isTaskFree":"0","watchLimitRemaining":false,"replayStatus":"","activityStartTimeStr":"","activityStartTime":"","activityLength":"01:44:11","activityEndTime":"","fileStorage":"cloud","isTaskTryLookable":0,"isSingleTaskLesson":true},{"itemType":"task","number":"5","published_number":"5","title":"Class 5. Queue & Stack","result":"","resultStatus":"","lock":false,"status":"published","taskId":"3824","isOptional":"0","type":"video","isTaskFree":"0","watchLimitRemaining":false,"replayStatus":"","activityStartTimeStr":"","activityStartTime":"","activityLength":"01:37:49","activityEndTime":"","fileStorage":"cloud","isTaskTryLookable":0,"isSingleTaskLesson":true},{"itemType":"task","number":"6","published_number":"6","title":"Class 6. Binary Tree & Binary Search Tree","result":"","resultStatus":"","lock":false,"status":"published","taskId":"3825","isOptional":"0","type":"video","isTaskFree":"0","watchLimitRemaining":false,"replayStatus":"","activityStartTimeStr":"","activityStartTime":"","activityLength":"01:37:51","activityEndTime":"","fileStorage":"cloud","isTaskTryLookable":0,"isSingleTaskLesson":true},{"itemType":"task","number":"7","published_number":"7","title":"Class 7. Heap and Graph Search","result":"","resultStatus":"","lock":false,"status":"published","taskId":"3826","isOptional":"0","type":"video","isTaskFree":"0","watchLimitRemaining":false,"replayStatus":"","activityStartTimeStr":"","activityStartTime":"","activityLength":"01:37:56","activityEndTime":"","fileStorage":"cloud","isTaskTryLookable":0,"isSingleTaskLesson":true},{"itemType":"task","number":"8","published_number":"8","title":"Class 8 Mock Interview","result":"","resultStatus":"","lock":false,"status":"published","taskId":"3835","isOptional":"0","type":"video","isTaskFree":"0","watchLimitRemaining":false,"replayStatus":"","activityStartTimeStr":"","activityStartTime":"","activityLength":"01:33:21","activityEndTime":"","fileStorage":"cloud","isTaskTryLookable":0,"isSingleTaskLesson":true},{"itemType":"task","number":"9","published_number":"9","title":"Class 9. Graph Search II_ DFS","result":"","resultStatus":"","lock":false,"status":"published","taskId":"3842","isOptional":"0","type":"video","isTaskFree":"0","watchLimitRemaining":false,"replayStatus":"","activityStartTimeStr":"","activityStartTime":"","activityLength":"01:37:48","activityEndTime":"","fileStorage":"cloud","isTaskTryLookable":0,"isSingleTaskLesson":true}]