Find minimum number of currency notes and values that sum to given amount
Given an amount, find the minimum number of notes of different denominations that sum upto the given amount. Starting from the highest denomination note, try to accommodate as many notes possible for given amount.
We may assume that we have infinite supply of notes of values {100, 10, 5, 1}
example:
Input : 777
Output : Currency Count
100 : 7
10 : 7
5 : 0
1:7
Ho presentato la mia candidatura tramite un'agenzia di reclutamento personale. Ho sostenuto un colloquio presso Samsung Research America (Mountain View, CA) nel mese di mar 2024
Colloquio
1. Recruiter Screening
2. 1 on 1 with Hiring Manager
Simple Interview setup, no online assessments. Basic knowledge of DSA, Machine Learning Deployment, NLP and GenAI.
Service Intelligence, MLOps and hands on deployment of ML models expected.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Samsung Research America (San Jose, CA) nel mese di giu 2018
Colloquio
Apply for software engineer for autonomous platform. Onsite interview in San Jose following a phone interview. Interviewers are not professional, they don't provide help during interview process. During question session, they even checking their smart phone. Showing no respect to candidates. I doubt they can produce quality product.
