Data Structures and Algorithms

Problem: Given a string s, find the length of the longest substring without repeating characters. Example: Input: s = “abcabcbb” Output: 3 Explanation: The answer is “abc”, with the length of 3. Solution: #include <iostream> #include <unordered_map> #include <algorithm> int lengthOfLongestSubstring(std::string s) {     std::unordered_map<char, int> charIndexMap;     int maxLength = 0;  …

Given an array of integers nums and an integer target, return the indices of the two numbers such that they add up to the target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order. Example :…