Algorithms vs Regex Tester

Did you pass the interview algorithm question? Learning algorithm questions takes too much time? Not your problem! Before this, no algorithmic learning method could be so simple and efficient. It only takes three steps to become an algorithm master: The first step is to read the question; The second step is to play the animation, refer to the subtitles, and understand the ideas and codes; The third step is to read, analyze and summarize; Why do you make an algorithm animation diagram app? Like many programmers, I have to prepare a lot of time to brush up the algorithm every time I change jobs. Very good, in the process of brushing the questions, you must first read the solution. I also read a lot of problem solutions from big guys on the Internet, and I especially like to read algorithm analysis with moving pictures or schematic diagrams, which is faster than reading text. In the process, several problems were also found, such as: the animation is not interactive and cannot be paused; the data is dead and cannot be changed; it is not convenient to study on the mobile phone, etc. I saw some good animations at the beginning, and I had a strong urge to implement them in the app with native code several times. This time I finally made up my mind and made 70 animations in one go. I understand that the positioning of this app is a tool that can help us quickly understand algorithm ideas and codes, help memory, and improve learning efficiency. But here you can't submit, you can't execute the code, and the code still needs to be typed on the computer to make it feel better. Why is it not arranged in the order of the leetcode number? At present, the algorithm questions are classified into three major blocks: - linked list, string, array, binary tree; - Backtracking, greedy, dynamic programming, divide and conquer; - Sort and classify separately. Under each category, the difficulty is divided into easy, medium and hard. First classify data structures and algorithms separately, and learn according to knowledge points. For example, you can concentrate on learning binary tree structures or dynamic programming algorithms, so that concentrated saturation training can help improve learning efficiency. The data structure comes first, and the algorithm follows, which is also arranged in the order in which we learn theoretical knowledge. In terms of algorithms, four types are currently arranged: backtracking, greedy, dynamic programming, and divide-and-conquer. When I learned data structures and algorithms many years ago, I first came into contact with various sorting algorithms. At that time, I felt that sorting was too difficult, and I was very impressed, so I made a separate sorting classification for beginners. Thinking on how to combine animation and code and other interactive issues - In the process of learning algorithms by myself, I often understand the ideas, but I can't understand the codes, and many codes in the text explanations have no comments. Seeing this is a big headache. Therefore, when thinking about App interaction, the code highlighting function is specially designed, which means that each line of code will be highlighted as the animation progresses. In this way, the animation is executing, the code is highlighted, and it looks cool. - Although the animation is easy to understand, it still needs some short explanations, so the "subtitle" function is designed below the animation. Every time the corresponding step is executed, the corresponding explanation will be displayed. - Animation playback and reset, each algorithm page has a playback function, so how to prepare test cases? To simplify the concept of test cases, a "reset" button is designed, which means that the test cases are random. When you want to change a set of data, just click reset.

Pasted a log line and got zero matches? When a valid pattern finds nothing, tap Check prefix: the app tries up to 32 shorter versions of your pattern on the same text and shows the longest prefix that does match and where — a clue, not a proof of the exact failing token. When it can't tell (alternation, lookaround, backreferences, several places), it says so. Then step through matches one tap at a time with context, UTF-16 ranges and numbered groups. Test patterns on your device with Dart's ECMAScript regular-expression engine. See highlighted matches, positions and capture groups. Toggle ignore case, multiline and dot all; preview replacements with capture groups. Save named favorites with flags and recall recent successful patterns. Code examples are available for JavaScript, Python, Dart, Java, Kotlin, Swift, Go, PHP and Ruby. Other engines may behave differently. This app does not execute or validate those engines. Copy is disabled for unsupported cross-engine syntax or flag combinations; verify examples in your target runtime. Browse 45 reference patterns and 10 sample texts. Reference content includes Korean. Email, URL and similar patterns are learning examples, not security or complete input validation. Matching runs in a cancellable background task with a 500 ms time limit. Limits: pattern 2,000 UTF-16 units, text/replacement 20,000 units, first 500 matches and 100,000 units of result data/output. Partial results are labelled; their total is unknown and replacement is unavailable. Simplify your input if a limit is reached. Core matching, replacement, favorites and history work offline. No ads or tracking prompt. Share only when you tap Share; sharing uses your selected app. Copied text goes to your device clipboard. English controls; reference content includes Korean.