ProblemNest
Sign In
You are coding as a Guest. Sign in with Google in 1 tap to save your daily streak, lock in +50 XP & boost your college rank!
Save Streak (1-Tap Google)
9:00 AM Daily Incident ReleaseMaintaining a 7-day streak grants a 2.5× Recruiter Visibility Multiplier on the Recruiter Talent Radar.
Multiplier Ladder:1d: 1.0ו3d: 1.5ו7d: 2.5× MAX
🔥Partition Labels: Greedy Last Occurrence ChunksMedium
DAILY PROBLEM OF THE DAY+50 XP • Daily Streak

Solve today's challenge or tackle one of the 3 Super Hard challenges for +150 XP.

MediumTwo Pointers•Acceptance: 80.1%

Partition Labels: Greedy Last Occurrence Chunks

Targeted in FAANG & Tech OA:AmazonGoogle
Real-World Engineering Context
Used in microservice distributed transaction boundary chunking and video stream keyframe chunk segmentation.
You are given a string `s`. We want to partition the string into as many parts as possible so that each letter appears in at most one part. Note that the partition is done so that after concatenating all the parts in order, the resultant string should be `s`. Return a list of integers representing the size of these parts.

Sample Test Cases

Input: ["ababcbacadefegdehijhklij"]
Expected: [9,7,8]
Input: ["eccbbbbdec"]
Expected: [10]
Input: ["abc"]
Expected: [1,1,1]

Constraints

  • 1 <= s.length <= 500
  • s consists of lowercase English letters.
Verified Proof-of-Work ATS PortfolioCryptographic Verification
Export tamper-proof problem verifications to your direct ATS applications
DevScore: Unranked (0/1000)

Every verified problem solve writes authentic cryptographic proof-of-work to your profile. Attach your verified DevScore badge to ATS applications to stand out to engineering hiring teams across 4,000+ verified live tech openings (23,000+ cumulative audited) on RoleNest.

Explore 4,000+ Direct ATS Openings on RoleNest ↗Solve Challenge to Activate Ledger