mit-emerging-talent / 2024-group-02-collaboration-practice Goto Github PK

In the end of this week (after compliting all our task) we are expected to write out our retrospective

retrospective.md

of our experience this weeks

Creating an Issue
Test

Different implementations of the Longest Common Subsequence (LCS) algorithm: lcs_basic, lcs_memo, and lcs_tab.

lcs_basic: This implementation follows a straightforward recursive approach without using memoization or dynamic programming.
lcs_memo: This implementation likely uses memoization to optimize the recursive approach.
lcs_tab: This implementation likely uses a tabulation approach, which involves building a table to store results of subproblems iteratively.

• milestone: dynamic_programming
• labels:

longest_common_subsequence

Build an algorithm for sorting sequences.

Requirements:
quick_sorting algorithm with clear documentation

Write a 5 code solutions for tasks (free of choice) from here, make a 5 PR with them
Make 5 code reviews of other peoples PR
Due Date 22/01/2024

Dynamic programming
challenge: Fibonacci

it calculates the sum of values in a Bianary Search Tree within a specified range.

Dynamic programming

Function deletions_to_make_valid_parentheses
takes a string containing parentheses and returns the minimum number of deletions needed to make the parentheses valid

• milestone: brain_teasers

deletions_to_make_valid_parentheses

This task for making add_string_numbers code, very simple, it should just convert strings to numbers, add them and return a string with sum.

• milestone: brain_teasers
• labels:

https://github.com/MIT-Emerging-Talent/2024-group-02-collaboration-practice/tree/main/src/brain_teasers/python/add_string_numbers

• milestone: backtracking
• labels:

Task of making all possible combination of items in a list. Fron input list of n it will generate list of 2^n lists with all possible orders of the original elements

https://github.com/MIT-Emerging-Talent/2024-group-02-collaboration-practice/blob/main/src/backtracking/python/all_permutations/tests/test_all_permutations.py

Everyone is expected to write his part in the

1. communication.md

with your time avalabitily, so we could know when is best to organize meetings (must be)
with your thought on our communication chanells (could be)

2. learning_goals.md

With everyone's thougths on matter

Issue for coding challenge. Let's take the first one not to hard.

• milestone: coding challenges, sorting, merge_sort
• labels: sorting

https://github.com/MIT-Emerging-Talent/2024-group-02-collaboration-practice/tree/main/src/sorting/python/merge_sort