yizhenwang0811,github

algorithm_interview_notes-chinese

2018/2019/校招/春招/秋招/算法/机器学习(Machine Learning)/深度学习(Deep Learning)/自然语言处理(NLP)/C/C++/Python/面试笔记

awesome-java-leetcode

:crown: LeetCode of algorithms with java solution(updating).

bu-cs506-spring2018

BU CS506 (Computational Tools for Data Science) as taught by Adam Smith

char-rnn-tensorflow

Multi-layer Recurrent Neural Networks (LSTM, RNN) for character-level language models in Python using Tensorflow

The task is to find out if the given message fragment could be part of a given encrypted message, and if so, in how many positions? The encryption is done using substitution cipher. Unfortunately, the key is not available. The input consists of: one line with a string consisting of at least 1 and at most 250000 lowercase letters, the encrypted message; one line with a string consisting of at least 1 and at most 250000 lowercase letters, the decrypted fragment. If there is a unique position in the encrypted message where the message fragment could occur, output the substring of the encrypted message that could correspond to the fragment. Otherwise, output the number of positions in the encrypted message where the fragment could occur. This task was taken from NothWestern Europe Regional Contest (NWERC). This program tries to solve this problem.