Minimum Disjoint Segments With Distinct Characters

Company: IBM

Difficulty: easy

String Greedy Hash Table Dynamic Programming

More IBM OA questions Interview experiences