Practice Snowflake Coding Question | Real Coding Interviews | Hack2hire

NewThe Learning module is now liveSee what's new

Question Bank Learning

Pricing Blog Forum

Quick Summary

Replace every '?' in the weekly pattern with a digit between 0 and dayHours.
Generate all combinations where the total sum of hours equals workHours.
Return the resulting schedules sorted in lexicographical order.

What This Tests

Backtracking algorithm design for constraint satisfaction.
Recursive state exploration and pruning.
String manipulation and list aggregation.
Managing lexicographical ordering during generation.

Common Patterns

Backtracking

Accepted

2.9k/6k

Acceptance Rate49.0%

Test Cases

Input

workHours =

dayHours =

pattern =

Output

Expected