Interviews
Partition String
Partition String ⭐⭐
Given a string S of lowercase letters, partition S into as many as parts so that one letter only appear in one part. Return the partitions as a list.
Example 1:
Input:
S = “bbeadcxede”
Output:
[“bb”, “eadcxede”]
Example 2:
Input:
S = “baddacx”
Output:
[“b”, “adda", “c”, “x”]
Solve the problem:
One-on-One Algorithm and Coding Training
One-on-One System Design Training
One-on-One Mock Interview
Get one-to-one training from Google Facebook engineers
Top-notch Professionals
Learn from Facebook and Google senior engineers interviewed 100+ candidates.aonecode.com
Most recent interview questions and system design topics gathered from aonecode alumnus.
One-to-one online classes. Get feedbacks from real interviewers.
Customized Private Class
Already a coding expert? - Advance straight to hard interview topics of your interest.
New to the ground? - Develop basic coding skills with your own designated mentor.
Days before
interview? - Focus on most important problems in target company question bank.
aonecoding@gmail.com