CodeYourFuture / CodeYourFuture/Module-Complexity

Codewars Fibonacci Series

未關閉
#5 1 則留言 0 個 reaction 已指派 0 人 在 GitHub 檢視
🏝️ Priority Stretch 🐇 Size Small 📅 Sprint 1 Module-Complexity Optional Submit:None
主要語言
Python
星號
0
分支
60
PR 合併指標
30 天內沒有已合併 PR

描述

### Link to the coursework

https://www.codewars.com/collections/cyf-interview-prep-problems-and-sub-problems

### Learning Objectives

- [ ] Solve dynamic programming problems using recursion and memoisation

### Why are we doing this?

This is a collection of well known computer science problems that deal with complexity. Quite a lot of employers use problems like these in their technical interview process. You can practice them on Codewars, HackerRank, and LeetCode.

### Maximum time in hours

0

### How to get help

Join a Codewars club at CYF to practice solving these problems. You don't have to only do Codewars problems - you can try ones on LeetCode and Hackerrank too if you like.

### How to submit

No submission step. This is a stretch goal to support your research and study plan.

### How to review

_No response_

### Anything else?

- https://trujillo9616.medium.com/what-ive-learned-after-one-month-of-doing-leetcode-hackerrank-problems-104a21259e16
- https://www.hackerrank.com/dashboard
- https://leetcode.com/problem-list/dynamic-programming/

貢獻指南

這個儲存庫沒有索引到貢獻指南

評估

這個 Issue 還沒有評估資料。

把新 issue 寄到你的電子郵件信箱

精選適合新手參與的 GitHub issue 摘要。