my program requires a hash to be generated for files and folders for data integrity between transfers and file system events (if hash is different, file is not ready). For data integrity, I wish to use SHA-256 and for checking if a file is ready for transfer, I am using a custom hash that uses sm...
I want to speed up the process below, its meant to remove duplication for my process.
random_list = [random.randint(1,1000) for i in range(1,1000000)]
remove_list = [random.randint(1,1000) for i in range(1,1000000)]
for element in remove_list:
if element in random_list:
random_list.r...
I'm trying to design an efficient data structure that store and checks if the total of any three consecutive elements added element is equal to a giving sum. What I have tried: but I get time limit exceeded
#include <vector>
#include <stdexcept>
#include <iostream>
class MovingTotal
{
public:
...
I write my Python program below for this Leetcode problem:
Given a string s, find the length of the longest substring without repeating characters.
Example 1:
Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.
Example 2:
Input: s = "bbbbb"
Output: 1
Explanat...
