Title: [정봉찬] 8-9. 동전교환(복습풀이) by devwqc · Pull Request #230 · fraudgroup/codingtest · GitHub
Open Graph Title: [정봉찬] 8-9. 동전교환(복습풀이) by devwqc · Pull Request #230 · fraudgroup/codingtest
X Title: [정봉찬] 8-9. 동전교환(복습풀이) by devwqc · Pull Request #230 · fraudgroup/codingtest
Description: 📝코딩테스트 정복. Contribute to fraudgroup/codingtest development by creating an account on GitHub.
Open Graph Description: ✔ 문제 제목: 동전교환 ✔ 문제 유형: 재귀 ✔ 문제 풀이 날짜: 2024-09-09 💡 문제 분석 요약 거스름돈을 가장 적은 수의 동전으로 교환해주자. 동전의 종류 개수 N(1<=N<=12), 거슬러 줄 금액 M(1<=M<=500) 💡 알고리즘 설계 재귀 탐색하는 레벨을 동전을 뽑은 수로 생각한다. 모든 동전이 모든 동전...
X Description: ✔ 문제 제목: 동전교환 ✔ 문제 유형: 재귀 ✔ 문제 풀이 날짜: 2024-09-09 💡 문제 분석 요약 거스름돈을 가장 적은 수의 동전으로 교환해주자. 동전의 종류 개수 N(1<=N<=12), 거슬러 줄 금액 M(1<=M<=500) 💡 알고리즘 설계 재귀 탐색하는 레벨을 동전을 뽑은 수로 생각...
Opengraph URL: https://github.com/fraudgroup/codingtest/pull/230
X: @github
Domain: patch-diff.githubusercontent.com
| route-pattern | /_view_fragments/voltron/pull_requests/show/:user_id/:repository/:id/pull_request_layout(.:format) |
| route-controller | voltron_pull_requests_fragments |
| route-action | pull_request_layout |
| fetch-nonce | v2:6efda4dd-6b52-19d7-9795-b07c78bef87e |
| current-catalog-service-hash | ae870bc5e265a340912cde392f23dad3671a0a881730ffdadd82f2f57d81641b |
| request-id | AD3C:73A85:12BF93:18DE61:698F6CC0 |
| html-safe-nonce | 73d6134ae2cdabb441bb5cbb77118979a0d32ec0caa9b830ca0448e666e11171 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJBRDNDOjczQTg1OjEyQkY5MzoxOERFNjE6Njk4RjZDQzAiLCJ2aXNpdG9yX2lkIjoiMzg0MjUyNjY1NDA2NjQ3NDg4IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0= |
| visitor-hmac | 2cd14d09ee1bcf87e7baa0ebec48d086287957f98c2b7d3272840fbc575e7cb7 |
| hovercard-subject-tag | pull_request:2060488080 |
| github-keyboard-shortcuts | repository,pull-request-list,pull-request-conversation,pull-request-files-changed,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/_view_fragments/voltron/pull_requests/show/fraudgroup/codingtest/230/pull_request_layout |
| twitter:image | https://opengraph.githubassets.com/6a2d00a8152e47562cbbeb54b262583fe925b9c7e1b556936721230b19bcc87e/fraudgroup/codingtest/pull/230 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/6a2d00a8152e47562cbbeb54b262583fe925b9c7e1b556936721230b19bcc87e/fraudgroup/codingtest/pull/230 |
| og:image:alt | ✔ 문제 제목: 동전교환 ✔ 문제 유형: 재귀 ✔ 문제 풀이 날짜: 2024-09-09 💡 문제 분석 요약 거스름돈을 가장 적은 수의 동전으로 교환해주자. 동전의 종류 개수 N(1<=N<=12), 거슬러 줄 금액 M(1<=M<=500) 💡 알고리즘 설계 재귀 탐색하는 레벨을 동전을 뽑은 수로 생각한다. 모든 동전이 모든 동전... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | devwqc |
| hostname | github.com |
| expected-hostname | github.com |
| None | 7ab1c9acb90dba91d5e994ebfb6bfb1130e0e0e6aca329cdbbd934d636e22ab6 |
| turbo-cache-control | no-cache |
| go-import | github.com/fraudgroup/codingtest git https://github.com/fraudgroup/codingtest.git |
| octolytics-dimension-user_id | 174826869 |
| octolytics-dimension-user_login | fraudgroup |
| octolytics-dimension-repository_id | 825536399 |
| octolytics-dimension-repository_nwo | fraudgroup/codingtest |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 825536399 |
| octolytics-dimension-repository_network_root_nwo | fraudgroup/codingtest |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 1d6695367a1b2f05addc4030b791720f01693df4 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width