Di String Match, is a LeetCode problem. In this post we will see how we can solve this challenge in C++

Problem Description

Example 1:

Input: "IDID" Output: [0,4,1,3,2]

Example 2:

Input: "III" Output: [0,1,2,3]

Example 3:

Input: "DDI" Output: [3,2,0,1]


1 <= S.length <= 10000


You can find the full details of the problem DI String Match at LeetCode

Solution: Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @kamyu104