Problem of The Day: Longest Substring Without Repeating Characters
Problem Statement ``` Given a string s, find the length of the longest substring without repeating characters.
Recent posts
Problem of The Day: Find All Anagrams in a String
Problem Statement ``` Given two strings s and p, return an array of all the start indices of p’s anagrams in s. You may return the answer in any order.
Problem of The Day: Longest Common Subsequence
Problem Statement ``` Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.
Code Templates For Technical Interview
In this journal, I aim to compile code templates as a foundational resource to ready myself for technical interviews. These templates are sourced from the Le...
Problem of The Day: Reverse Nodes in k-Group
Problem Statement see problem