← Cisco questions
CodingMedium

Calculate patterns in string and Knapsack application

Filed under Cisco

Solve two algorithmic coding problems typically found in online assessments: calculating specific pattern occurrences in a string and applying the 0/1 Knapsack dynamic programming pattern.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Cisco questions

Collected from public candidate posts and coding forums. Updated Nov 2026.