ThanThoai

'''
https://arxiv.org/abs/2312.00858
1. put this file in ComfyUI/custom_nodes
2. load node from <loaders>

start_step, end_step: apply this method when the timestep is between start_step and end_step
cache_interval: interval of caching (1 means no caching)
cache_depth: depth of caching
'''

ThanThoai

GROKKING NOTES

I liked the way Grokking the coding interview organized problems into learnable patterns. However, the course is expensive and the majority of the time the problems are copy-pasted from leetcode. As the explanations on leetcode are usually just as good, the course really boils down to being a glorified curated list of leetcode problems.

So below I made a list of leetcode problems that are as close to grokking problems as possible.

Pattern: Sliding Window

• https://leetcode.com/problems/maximum-subarray/ # Close enough
• https://leetcode.com/problems/minimum-size-subarray-sum/

ThanThoai

from moviepy.video.io.ffmpeg_tools import ffmpeg_extract_subclip
import os
def convert2sec(line = ""):
	t2s = [60, 1]
	times = map(int, line.split("p"))
	return sum([a * b for a, b in zip(t2s, times)])


list_vi = ['video_5.txt']
count = 419