├── .devcontainer ├── Dockerfile ├── devcontainer.json └── startup.sh ├── .github ├── CODEOWNERS ├── ISSUE_TEMPLATE.md ├── PULL_REQUEST_TEMPLATE.md └── workflows │ └── main.yml ├── .gitignore ├── .vscode └── settings.json ├── 02 ├── 02_02 │ ├── 02_02b │ │ └── main.py │ └── 02_02e │ │ └── main.py ├── 02_03 │ ├── 02_03b │ │ └── main.py │ └── 02_03e │ │ └── main.py ├── 02_04 │ ├── 02_04b │ │ └── main.py │ └── 02_04e │ │ └── main.py ├── 02_05 │ ├── 02_05b │ │ └── main.py │ └── 02_05e │ │ └── main.py ├── 02_06 │ ├── 02_06b │ │ └── main.py │ └── 02_06e │ │ └── main.py ├── 02_07 │ ├── 02_07b │ │ └── main.py │ └── 02_07e │ │ └── main.py ├── 02_08 │ ├── 02_08b │ │ └── main.py │ └── 02_08e │ │ └── main.py ├── 02_09 │ ├── 02_09b │ │ └── main.py │ └── 02_09e │ │ └── main.py └── 02_10 │ ├── 02_10b │ └── main.py │ └── 02_10e │ └── main.py ├── 03 ├── 03_02 │ ├── 03_02b │ │ └── main.py │ └── 03_02e │ │ └── main.py ├── 03_03 │ ├── 03_03b │ │ └── main.py │ └── 03_03e │ │ └── main.py ├── 03_04 │ ├── 03_04b │ │ └── main.py │ └── 03_04e │ │ └── main.py └── 03_05 │ ├── 03_05b │ └── main.py │ └── 03_05e │ └── main.py ├── 04 ├── 04_02 │ ├── 04_02b │ │ └── main.py │ └── 04_02e │ │ └── main.py ├── 04_03 │ ├── 04_03b │ │ └── main.py │ └── 04_03e │ │ └── main.py ├── 04_04 │ ├── 04_04b │ │ └── main.py │ └── 04_04e │ │ └── main.py ├── 04_05 │ ├── 04_05b │ │ └── main.py │ └── 04_05e │ │ └── main.py └── 04_06 │ ├── 04_06b │ └── main.py │ └── 04_06e │ └── main.py ├── 05 ├── 05_02 │ ├── 05_02b │ │ └── main.py │ └── 05_02e │ │ └── main.py └── 05_04 │ ├── 05_04b │ └── main.py │ └── 05_04e │ └── main.py ├── 06 ├── 06_02 │ ├── 06_02b │ │ └── main.py │ └── 06_02e │ │ └── main.py ├── 06_03 │ ├── 06_03b │ │ └── main.py │ └── 06_03e │ │ └── main.py └── 06_05 │ ├── 06_05b │ └── main.py │ └── 06_05e │ └── main.py ├── CONTRIBUTING.md ├── LICENSE ├── NOTICE ├── README.md └── requirements.txt /.devcontainer/Dockerfile: -------------------------------------------------------------------------------- 1 | # See here for image contents: https://github.com/microsoft/vscode-dev-containers/tree/v0.233.0/containers/python-3/.devcontainer/base.Dockerfile 2 | 3 | # [Choice] Python version (use -bullseye variants on local arm64/Apple Silicon): 3, 3.10, 3.9, 3.8, 3.7, 3.6, 3-bullseye, 3.10-bullseye, 3.9-bullseye, 3.8-bullseye, 3.7-bullseye, 3.6-bullseye, 3-buster, 3.10-buster, 3.9-buster, 3.8-buster, 3.7-buster, 3.6-buster 4 | ARG VARIANT="3.10" 5 | FROM mcr.microsoft.com/vscode/devcontainers/python:0-${VARIANT} 6 | 7 | # [Choice] Node.js version: none, lts/*, 16, 14, 12, 10 8 | ARG NODE_VERSION="none" 9 | RUN if [ "${NODE_VERSION}" != "none" ]; then su vscode -c "umask 0002 && . /usr/local/share/nvm/nvm.sh && nvm install ${NODE_VERSION} 2>&1"; fi 10 | 11 | # [Optional] If your pip requirements rarely change, uncomment this section to add them to the image. 12 | # COPY requirements.txt /tmp/pip-tmp/ 13 | # RUN pip3 --disable-pip-version-check --no-cache-dir install -r /tmp/pip-tmp/requirements.txt \ 14 | # && rm -rf /tmp/pip-tmp 15 | 16 | # [Optional] Uncomment this section to install additional OS packages. 17 | # RUN apt-get update && export DEBIAN_FRONTEND=noninteractive \ 18 | # && apt-get -y install --no-install-recommends 19 | 20 | # [Optional] Uncomment this line to install global node packages. 21 | # RUN su vscode -c "source /usr/local/share/nvm/nvm.sh && npm install -g " 2>&1 22 | -------------------------------------------------------------------------------- /.devcontainer/devcontainer.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "Python 3", 3 | "build": { 4 | "dockerfile": "Dockerfile", 5 | "context": "..", 6 | "args": { 7 | "VARIANT": "3.10", // Set Python version here 8 | "NODE_VERSION": "lts/*" 9 | } 10 | }, 11 | "settings": { 12 | "python.defaultInterpreterPath": "/usr/local/bin/python", 13 | "python.linting.enabled": true, 14 | "python.linting.pylintEnabled": true, 15 | "python.formatting.autopep8Path": "/usr/local/py-utils/bin/autopep8", 16 | "python.formatting.blackPath": "/usr/local/py-utils/bin/black", 17 | "python.formatting.yapfPath": "/usr/local/py-utils/bin/yapf", 18 | "python.linting.banditPath": "/usr/local/py-utils/bin/bandit", 19 | "python.linting.flake8Path": "/usr/local/py-utils/bin/flake8", 20 | "python.linting.mypyPath": "/usr/local/py-utils/bin/mypy", 21 | "python.linting.pycodestylePath": "/usr/local/py-utils/bin/pycodestyle", 22 | "python.linting.pydocstylePath": "/usr/local/py-utils/bin/pydocstyle", 23 | "python.linting.pylintPath": "/usr/local/py-utils/bin/pylint", 24 | "python.linting.pylintArgs": ["--disable=C0111"] 25 | }, 26 | "extensions": [ 27 | "ms-python.python", 28 | "ms-python.vscode-pylance" 29 | ], 30 | "remoteUser": "vscode", 31 | "onCreateCommand": "echo PS1='\"$ \"' >> ~/.bashrc", //Set Terminal Prompt to $ 32 | "postCreateCommand": "sh .devcontainer/startup.sh" 33 | } 34 | -------------------------------------------------------------------------------- /.devcontainer/startup.sh: -------------------------------------------------------------------------------- 1 | if [ -f requirements.txt ]; then 2 | pip install --user -r requirements.txt 3 | fi -------------------------------------------------------------------------------- /.github/CODEOWNERS: -------------------------------------------------------------------------------- 1 | # Codeowners for these exercise files: 2 | # * (asterisk) denotes "all files and folders" 3 | # Example: * @producer @instructor 4 | -------------------------------------------------------------------------------- /.github/ISSUE_TEMPLATE.md: -------------------------------------------------------------------------------- 1 | 7 | 8 | ## Issue Overview 9 | 10 | 11 | ## Describe your environment 12 | 13 | 14 | ## Steps to Reproduce 15 | 16 | 1. 17 | 2. 18 | 3. 19 | 4. 20 | 21 | ## Expected Behavior 22 | 23 | 24 | ## Current Behavior 25 | 26 | 27 | ## Possible Solution 28 | 29 | 30 | ## Screenshots / Video 31 | 32 | 33 | ## Related Issues 34 | 35 | -------------------------------------------------------------------------------- /.github/PULL_REQUEST_TEMPLATE.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /.github/workflows/main.yml: -------------------------------------------------------------------------------- 1 | name: Copy To Branches 2 | on: 3 | workflow_dispatch: 4 | jobs: 5 | copy-to-branches: 6 | runs-on: ubuntu-latest 7 | steps: 8 | - uses: actions/checkout@v2 9 | with: 10 | fetch-depth: 0 11 | - name: Copy To Branches Action 12 | uses: planetoftheweb/copy-to-branches@v1.2 13 | env: 14 | key: main 15 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | .DS_Store 2 | node_modules 3 | .tmp 4 | npm-debug.log 5 | -------------------------------------------------------------------------------- /.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "editor.bracketPairColorization.enabled": true, 3 | "editor.cursorBlinking": "solid", 4 | "editor.fontFamily": "ui-monospace, Menlo, Monaco, 'Cascadia Mono', 'Segoe UI Mono', 'Roboto Mono', 'Oxygen Mono', 'Ubuntu Monospace', 'Source Code Pro', 'Fira Mono', 'Droid Sans Mono', 'Courier New', monospace", 5 | "editor.fontLigatures": false, 6 | "editor.fontSize": 22, 7 | "editor.formatOnPaste": true, 8 | "editor.formatOnSave": true, 9 | "editor.lineNumbers": "on", 10 | "editor.matchBrackets": "always", 11 | "editor.minimap.enabled": false, 12 | "editor.smoothScrolling": true, 13 | "editor.tabSize": 2, 14 | "editor.useTabStops": true, 15 | "emmet.triggerExpansionOnTab": true, 16 | "explorer.openEditors.visible": 0, 17 | "files.autoSave": "afterDelay", 18 | "screencastMode.onlyKeyboardShortcuts": true, 19 | "terminal.integrated.fontSize": 18, 20 | "workbench.activityBar.visible": true, 21 | "workbench.colorTheme": "Visual Studio Dark", 22 | "workbench.fontAliasing": "antialiased", 23 | "workbench.statusBar.visible": true 24 | } 25 | -------------------------------------------------------------------------------- /02/02_02/02_02b/main.py: -------------------------------------------------------------------------------- 1 | ''' 2 | Problem Statement: Compute the average number of pets each student 3 | has in a given class. 4 | ''' 5 | -------------------------------------------------------------------------------- /02/02_02/02_02e/main.py: -------------------------------------------------------------------------------- 1 | ''' 2 | Problem Statement: Compute the average number of pets each student 3 | has in a given class. 4 | ''' 5 | 6 | student_pet_count_list = [0, 1, 0, 2, 1, 1, 4, 0, 0, 0, 3, 2, 1, 3, 0, 2, 2, 4] 7 | 8 | NUM_OF_STUDENTS = len(student_pet_count_list) 9 | print(NUM_OF_STUDENTS) 10 | 11 | # average = sum / number of items 12 | -------------------------------------------------------------------------------- /02/02_03/02_03b/main.py: -------------------------------------------------------------------------------- 1 | ''' 2 | Problem Statement: Compute the average number of pets each student 3 | has in a given class. 4 | ''' 5 | 6 | student_pet_count_list = [0, 1, 0, 2, 1, 1, 4, 0, 0, 0, 3, 2, 1, 3, 0, 2, 2, 4] 7 | 8 | NUM_OF_STUDENTS = len(student_pet_count_list) 9 | print(NUM_OF_STUDENTS) 10 | 11 | # average = sum / number of items 12 | -------------------------------------------------------------------------------- /02/02_03/02_03e/main.py: -------------------------------------------------------------------------------- 1 | ''' 2 | Problem Statement: Compute the average number of pets each student 3 | has in a given class. 4 | ''' 5 | 6 | student_pet_count_list = [0, 1, 0, 2, 1, 1, 4, 0, 0, 0, 3, 2, 1, 3, 0, 2, 2, 4] 7 | 8 | ITEM_AT_INDEX_THREE = student_pet_count_list[3] 9 | # print(student_pet_count_list[100]) 10 | ITEM_THREE_FROM_BACK = student_pet_count_list[-3] 11 | 12 | NUM_OF_STUDENTS = len(student_pet_count_list) 13 | print(NUM_OF_STUDENTS) 14 | SUM = 0 15 | for INDIVIDUAL_PET_COUNT in student_pet_count_list: 16 | SUM = SUM + INDIVIDUAL_PET_COUNT 17 | print(SUM) 18 | 19 | # average = sum / number of items 20 | AVERAGE = SUM / NUM_OF_STUDENTS 21 | print(AVERAGE) 22 | -------------------------------------------------------------------------------- /02/02_04/02_04b/main.py: -------------------------------------------------------------------------------- 1 | ''' 2 | Problem Statement: Compute the average number of pets each student 3 | has in a given class. 4 | ''' 5 | 6 | student_pet_count_list = [0, 1, 0, 2, 1, 1, 4, 0, 0, 0, 3, 2, 1, 3, 0, 2, 2, 4] 7 | 8 | NUM_OF_STUDENTS = len(student_pet_count_list) 9 | print(NUM_OF_STUDENTS) 10 | SUM = 0 11 | for INDIVIDUAL_PET_COUNT in student_pet_count_list: 12 | SUM = SUM + INDIVIDUAL_PET_COUNT 13 | print(SUM) 14 | 15 | AVERAGE = SUM / NUM_OF_STUDENTS 16 | print(AVERAGE) 17 | -------------------------------------------------------------------------------- /02/02_04/02_04e/main.py: -------------------------------------------------------------------------------- 1 | ''' 2 | Problem Statement: Compute the average number of pets each student 3 | has in a given class. 4 | ''' 5 | 6 | student_pet_count_list = [0, 1, 0, 2, 1, 1, 4, 0, 0, 0, 3, 2, 1, 3, 0, 2, 2, 4] 7 | 8 | student_pet_count_list[2] = 3 9 | student_pet_count_list[3] = student_pet_count_list[3] + 1 10 | student_pet_count_list[-1] = student_pet_count_list[-1] + 2 11 | 12 | student_pet_count_list.append(4) 13 | 14 | NUM_OF_STUDENTS = len(student_pet_count_list) 15 | print(NUM_OF_STUDENTS) 16 | SUM = 0 17 | for INDIVIDUAL_PET_COUNT in student_pet_count_list: 18 | SUM = SUM + INDIVIDUAL_PET_COUNT 19 | print(SUM) 20 | 21 | AVERAGE = SUM / NUM_OF_STUDENTS 22 | print(AVERAGE) 23 | -------------------------------------------------------------------------------- /02/02_05/02_05b/main.py: -------------------------------------------------------------------------------- 1 | seating_chart = [ 2 | ["Sarah", "CLaire", "Ben", "Taylor", "Eva"], 3 | ["Frankie", "George", "Lindsey", "Izzy", "Jack"], 4 | ["Katherine", "Lauren", "Mary", "Nathan", "Olive"], 5 | ["Chad", "April", "Matt", "Thomas", "Penny"] 6 | ] 7 | -------------------------------------------------------------------------------- /02/02_05/02_05e/main.py: -------------------------------------------------------------------------------- 1 | seating_chart = [ 2 | ["Sarah", "CLaire", "Ben", "Taylor", "Eva"], 3 | ["Frankie", "George", "Lindsey", "Izzy", "Jack"], 4 | ["Katherine", "Lauren", "Mary", "Nathan", "Olive"], 5 | ["Chad", "April", "Matt", "Thomas", "Penny"] 6 | ] 7 | 8 | # print(seating_chart[2][1]) 9 | 10 | for i, row in enumerate(seating_chart): 11 | for j, student_name in enumerate(row): 12 | print(f"{student_name} is in row {i+1}, seat {j+1}") 13 | -------------------------------------------------------------------------------- /02/02_06/02_06b/main.py: -------------------------------------------------------------------------------- 1 | # Tuples are immutable array-like structures 2 | -------------------------------------------------------------------------------- /02/02_06/02_06e/main.py: -------------------------------------------------------------------------------- 1 | # Tuples are immutable array-like structures 2 | 3 | point = (5, 2) 4 | 5 | x = point[0] 6 | y = point[1] 7 | 8 | def calculate_square_properties(side_length): 9 | area = side_length * side_length 10 | perimeter = 4 * side_length 11 | return (area, perimeter) 12 | 13 | result = calculate_square_properties(5) 14 | print("Area: ", result[0]) 15 | print("Perimeter ", result[1]) 16 | -------------------------------------------------------------------------------- /02/02_07/02_07b/main.py: -------------------------------------------------------------------------------- 1 | # Linear Search 2 | -------------------------------------------------------------------------------- /02/02_07/02_07e/main.py: -------------------------------------------------------------------------------- 1 | # Linear Search 2 | 3 | my_list = [8, 5, 0, 3, 9, 7] 4 | ITEM = 7 5 | 6 | def search(item, listy): 7 | for element in listy: 8 | if element == item: 9 | return True 10 | return False 11 | 12 | print(search(ITEM, my_list)) 13 | 14 | ITEM_INDEX = my_list.index(ITEM) 15 | -------------------------------------------------------------------------------- /02/02_08/02_08b/main.py: -------------------------------------------------------------------------------- 1 | my_list = [1, 7, 3] 2 | print(sorted(my_list)) 3 | -------------------------------------------------------------------------------- /02/02_08/02_08e/main.py: -------------------------------------------------------------------------------- 1 | my_list = [1, 7, 3] 2 | print(sorted(my_list, reverse=True)) 3 | 4 | student_grades = [('Sarah', 89), ('Rebecca', 82), ('Matt', 91)] 5 | print(sorted(student_grades)) 6 | print(sorted(student_grades, key=lambda x:x[1], reverse=True)) 7 | -------------------------------------------------------------------------------- /02/02_09/02_09b/main.py: -------------------------------------------------------------------------------- 1 | def find_second_smallest(my_list): 2 | return 0 3 | 4 | print(find_second_smallest([5, 8, 3, 2, 6])) 5 | -------------------------------------------------------------------------------- /02/02_09/02_09e/main.py: -------------------------------------------------------------------------------- 1 | def find_second_smallest(my_list): 2 | return 0 3 | 4 | print(find_second_smallest([5, 8, 3, 2, 6])) 5 | -------------------------------------------------------------------------------- /02/02_10/02_10b/main.py: -------------------------------------------------------------------------------- 1 | def find_second_smallest(my_list): 2 | return 0 3 | 4 | print(find_second_smallest([5, 8, 3, 2, 6])) 5 | -------------------------------------------------------------------------------- /02/02_10/02_10e/main.py: -------------------------------------------------------------------------------- 1 | def find_second_smallest(my_list): 2 | if len(my_list) < 2: 3 | return None 4 | sorted_list = sorted(my_list) 5 | return sorted_list[1] 6 | 7 | def find_second_smallest_v2(my_list): 8 | if len(my_list) < 2: 9 | return None 10 | smallest = float('inf') 11 | second_smallest = float('inf') 12 | for num in my_list: 13 | if num < smallest: 14 | second_smallest = smallest 15 | smallest = num 16 | elif num < second_smallest: 17 | second_smallest = num 18 | return second_smallest 19 | 20 | print(find_second_smallest_v2([5, 8, 3, 2, 6])) 21 | -------------------------------------------------------------------------------- /03/03_02/03_02b/main.py: -------------------------------------------------------------------------------- 1 | # Key: State 2 | # Value: Capital 3 | -------------------------------------------------------------------------------- /03/03_02/03_02e/main.py: -------------------------------------------------------------------------------- 1 | # Key: State 2 | # Value: Capital 3 | 4 | states_to_capitals = { 5 | "Texas" : "Austin", 6 | "New York" : "Albany" 7 | } 8 | 9 | print(states_to_capitals["New York"]) 10 | 11 | for key, value in states_to_capitals.items(): 12 | print(key + " | " + value) 13 | -------------------------------------------------------------------------------- /03/03_03/03_03b/main.py: -------------------------------------------------------------------------------- 1 | user_preferences = { 2 | "language": "English", 3 | "font_size": "14px", 4 | "timezone": "GMT", 5 | "currency": "USD", 6 | "enable_location": False, 7 | "volume_level": 80, 8 | "date_format": "MM/DD/YYYY" 9 | } 10 | -------------------------------------------------------------------------------- /03/03_03/03_03e/main.py: -------------------------------------------------------------------------------- 1 | user_preferences = { 2 | "language": "English", 3 | "font_size": "14px", 4 | "timezone": "GMT", 5 | "currency": "USD", 6 | "enable_location": False, 7 | "volume_level": 80, 8 | "date_format": "MM/DD/YYYY" 9 | } 10 | 11 | user_preferences["language"] = "Spanish" 12 | 13 | user_preferences["volume_level"] = 50 14 | user_preferences["highlight_color"] = "yellow" 15 | 16 | del user_preferences["currency"] 17 | removed_item = user_preferences.pop("date_format", "N/A") 18 | 19 | print(user_preferences) 20 | -------------------------------------------------------------------------------- /03/03_04/03_04b/main.py: -------------------------------------------------------------------------------- 1 | user_preferences = { 2 | "timezone": "GMT", 3 | "language": "English", 4 | "notifications": None, 5 | "currency": "USD", 6 | "theme": None 7 | } 8 | 9 | 10 | def update_preferences(user_pref): 11 | return {} 12 | 13 | 14 | print(update_preferences(user_preferences)) 15 | -------------------------------------------------------------------------------- /03/03_04/03_04e/main.py: -------------------------------------------------------------------------------- 1 | user_preferences = { 2 | "timezone": "GMT", 3 | "language": "English", 4 | "notifications": None, 5 | "currency": "USD", 6 | "theme": None 7 | } 8 | 9 | 10 | def update_preferences(user_pref): 11 | return {} 12 | 13 | 14 | print(update_preferences(user_preferences)) 15 | -------------------------------------------------------------------------------- /03/03_05/03_05b/main.py: -------------------------------------------------------------------------------- 1 | user_preferences = { 2 | "timezone": "GMT", 3 | "language": "English", 4 | "notifications": None, 5 | "currency": "USD", 6 | "theme": None 7 | } 8 | 9 | def update_preferences(user_pref): 10 | return {} 11 | 12 | 13 | print(update_preferences(user_preferences)) 14 | -------------------------------------------------------------------------------- /03/03_05/03_05e/main.py: -------------------------------------------------------------------------------- 1 | user_preferences = { 2 | "timezone": "GMT", 3 | "language": "English", 4 | "notifications": None, 5 | "currency": "USD", 6 | "theme": None 7 | } 8 | 9 | def update_preferences(user_pref): 10 | return {key: value for key, value in user_pref.items() if value is not None } 11 | # updated_preferences = {} 12 | # for key, value in user_pref.items(): 13 | # if value is not None: 14 | # updated_preferences[key] = value 15 | # return updated_preferences 16 | 17 | print(update_preferences(user_preferences)) 18 | -------------------------------------------------------------------------------- /04/04_02/04_02b/main.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/LinkedInLearning/programming-foundations-data-structures-4410875/f6073c52d716180ebd99090a2f69df628a8f7d83/04/04_02/04_02b/main.py -------------------------------------------------------------------------------- /04/04_02/04_02e/main.py: -------------------------------------------------------------------------------- 1 | primary_colors = set(["red", "blue", "yellow"]) 2 | 3 | color = "green" 4 | 5 | if color in primary_colors: 6 | print(color + "is a primary color") 7 | else: 8 | print(color + " is not a primary color") 9 | 10 | letters = set(['a', 'b']) 11 | letters.add('c') 12 | print(letters) 13 | -------------------------------------------------------------------------------- /04/04_03/04_03b/main.py: -------------------------------------------------------------------------------- 1 | set_A = {10, 20, 30, 40, 50} 2 | set_B = {30, 40, 50, 60, 70} 3 | -------------------------------------------------------------------------------- /04/04_03/04_03e/main.py: -------------------------------------------------------------------------------- 1 | set_A = {10, 20, 30, 40, 50} 2 | set_B = {30, 40, 50, 60, 70} 3 | 4 | union_set = set_A.union(set_B) 5 | print(union_set) 6 | 7 | intersection_set = set_A.intersection(set_B) 8 | print(intersection_set) 9 | 10 | difference_set = set_A.difference(set_B) 11 | print(difference_set) 12 | 13 | difference_set_BA = set_B.difference(set_A) 14 | print(difference_set_BA) 15 | 16 | symmetric_difference_set = set_A.symmetric_difference(set_B) 17 | print(symmetric_difference_set) 18 | -------------------------------------------------------------------------------- /04/04_04/04_04b/main.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/LinkedInLearning/programming-foundations-data-structures-4410875/f6073c52d716180ebd99090a2f69df628a8f7d83/04/04_04/04_04b/main.py -------------------------------------------------------------------------------- /04/04_04/04_04e/main.py: -------------------------------------------------------------------------------- 1 | primary_colors = frozenset(["red", "blue", "yellow"]) 2 | 3 | if "blue" in primary_colors: 4 | print("Blue in the set!") 5 | 6 | # primary_colors.add("green") 7 | -------------------------------------------------------------------------------- /04/04_05/04_05b/main.py: -------------------------------------------------------------------------------- 1 | def has_unique_characters(data): 2 | return False 3 | 4 | print(has_unique_characters('sample')) 5 | print(has_unique_characters('hello world')) 6 | print(has_unique_characters('linkedin')) 7 | print(has_unique_characters('python')) 8 | -------------------------------------------------------------------------------- /04/04_05/04_05e/main.py: -------------------------------------------------------------------------------- 1 | def has_unique_characters(data): 2 | return False 3 | 4 | print(has_unique_characters('sample')) 5 | print(has_unique_characters('hello world')) 6 | print(has_unique_characters('linkedin')) 7 | print(has_unique_characters('python')) 8 | -------------------------------------------------------------------------------- /04/04_06/04_06b/main.py: -------------------------------------------------------------------------------- 1 | def has_unique_characters(data): 2 | return False 3 | 4 | print(has_unique_characters('sample')) 5 | print(has_unique_characters('hello world')) 6 | print(has_unique_characters('linkedin')) 7 | print(has_unique_characters('python')) 8 | -------------------------------------------------------------------------------- /04/04_06/04_06e/main.py: -------------------------------------------------------------------------------- 1 | def has_unique_characters(data): 2 | unique_data = set(data) 3 | return len(data) == len(unique_data) 4 | 5 | print(has_unique_characters('sample')) 6 | print(has_unique_characters('hello world')) 7 | print(has_unique_characters('linkedin')) 8 | print(has_unique_characters('python')) 9 | -------------------------------------------------------------------------------- /05/05_02/05_02b/main.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/LinkedInLearning/programming-foundations-data-structures-4410875/f6073c52d716180ebd99090a2f69df628a8f7d83/05/05_02/05_02b/main.py -------------------------------------------------------------------------------- /05/05_02/05_02e/main.py: -------------------------------------------------------------------------------- 1 | from collections import deque 2 | 3 | printer_queue = deque() 4 | printer_queue.append("TaylorSwiftTickets.pdf") 5 | printer_queue.append("MarketingNotes.docx") 6 | printer_queue.append("Proof.png") 7 | 8 | while len(printer_queue) > 0: 9 | document = printer_queue.popleft() 10 | print(f'Printing {document}') -------------------------------------------------------------------------------- /05/05_04/05_04b/main.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/LinkedInLearning/programming-foundations-data-structures-4410875/f6073c52d716180ebd99090a2f69df628a8f7d83/05/05_04/05_04b/main.py -------------------------------------------------------------------------------- /05/05_04/05_04e/main.py: -------------------------------------------------------------------------------- 1 | from collections import deque 2 | 3 | # 1 4 | # 10 5 | # 11 6 | # 100 7 | # 101 8 | # 110 9 | # 111 10 | # 1000 11 | 12 | def print_binary_numbers(n): 13 | if n <= 0: 14 | return 15 | 16 | queue = deque() 17 | queue.append(1) 18 | 19 | for i in range(n): 20 | binary = queue.popleft() 21 | print(binary) 22 | queue.append(binary * 10) 23 | queue.append(binary * 10 + 1) 24 | 25 | print_binary_numbers(6) 26 | print() 27 | print_binary_numbers(-9) 28 | print() 29 | print_binary_numbers(0) 30 | print() 31 | print_binary_numbers(2) 32 | print() 33 | print_binary_numbers(10) 34 | -------------------------------------------------------------------------------- /06/06_02/06_02b/main.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/LinkedInLearning/programming-foundations-data-structures-4410875/f6073c52d716180ebd99090a2f69df628a8f7d83/06/06_02/06_02b/main.py -------------------------------------------------------------------------------- /06/06_02/06_02e/main.py: -------------------------------------------------------------------------------- 1 | card_stack = [] 2 | 3 | card_stack.append("Jack of Hearts") 4 | card_stack.append("2 of Diamonds") 5 | card_stack.append("10 of Spades") 6 | 7 | # front(bottom) ---- back(top) 8 | top_card = card_stack.pop() 9 | print(top_card) 10 | top_card = card_stack[-1] 11 | print(top_card) 12 | 13 | if not card_stack: 14 | print("Card stack is empty") 15 | else: 16 | print(len(card_stack)) 17 | -------------------------------------------------------------------------------- /06/06_03/06_03b/main.py: -------------------------------------------------------------------------------- 1 | from collections import deque -------------------------------------------------------------------------------- /06/06_03/06_03e/main.py: -------------------------------------------------------------------------------- 1 | from collections import deque 2 | 3 | history_stack = deque() 4 | history_stack.append("https://google.com") 5 | history_stack.append("https://linkedin.com") 6 | history_stack.append("https://stackoverflow.com") 7 | 8 | print(history_stack[-1]) 9 | print(history_stack.pop()) 10 | -------------------------------------------------------------------------------- /06/06_05/06_05b/main.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/LinkedInLearning/programming-foundations-data-structures-4410875/f6073c52d716180ebd99090a2f69df628a8f7d83/06/06_05/06_05b/main.py -------------------------------------------------------------------------------- /06/06_05/06_05e/main.py: -------------------------------------------------------------------------------- 1 | from collections import deque 2 | 3 | def check_matching_parentheses(s): 4 | stack = deque() 5 | for char in s: 6 | if char == "(": 7 | stack.append(char) 8 | elif char == ")": 9 | if not stack: 10 | return False 11 | stack.pop() 12 | return len(stack) == 0 13 | 14 | print(check_matching_parentheses("()")) 15 | print(check_matching_parentheses("(hi there)")) 16 | print(check_matching_parentheses("(hell)o")) 17 | print(check_matching_parentheses("((linkedin)) learning")) 18 | 19 | print(check_matching_parentheses("(hi(there")) 20 | print(check_matching_parentheses("()ok)")) 21 | print(check_matching_parentheses("((increment)")) 22 | print(check_matching_parentheses(")linkedin()")) 23 | -------------------------------------------------------------------------------- /CONTRIBUTING.md: -------------------------------------------------------------------------------- 1 | 2 | Contribution Agreement 3 | ====================== 4 | 5 | This repository does not accept pull requests (PRs). All pull requests will be closed. 6 | 7 | However, if any contributions (through pull requests, issues, feedback or otherwise) are provided, as a contributor, you represent that the code you submit is your original work or that of your employer (in which case you represent you have the right to bind your employer). By submitting code (or otherwise providing feedback), you (and, if applicable, your employer) are licensing the submitted code (and/or feedback) to LinkedIn and the open source community subject to the BSD 2-Clause license. 8 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | LinkedIn Learning Exercise Files License Agreement 2 | ================================================== 3 | 4 | This License Agreement (the "Agreement") is a binding legal agreement 5 | between you (as an individual or entity, as applicable) and LinkedIn 6 | Corporation (“LinkedIn”). By downloading or using the LinkedIn Learning 7 | exercise files in this repository (“Licensed Materials”), you agree to 8 | be bound by the terms of this Agreement. If you do not agree to these 9 | terms, do not download or use the Licensed Materials. 10 | 11 | 1. License. 12 | - a. Subject to the terms of this Agreement, LinkedIn hereby grants LinkedIn 13 | members during their LinkedIn Learning subscription a non-exclusive, 14 | non-transferable copyright license, for internal use only, to 1) make a 15 | reasonable number of copies of the Licensed Materials, and 2) make 16 | derivative works of the Licensed Materials for the sole purpose of 17 | practicing skills taught in LinkedIn Learning courses. 18 | - b. Distribution. Unless otherwise noted in the Licensed Materials, subject 19 | to the terms of this Agreement, LinkedIn hereby grants LinkedIn members 20 | with a LinkedIn Learning subscription a non-exclusive, non-transferable 21 | copyright license to distribute the Licensed Materials, except the 22 | Licensed Materials may not be included in any product or service (or 23 | otherwise used) to instruct or educate others. 24 | 25 | 2. Restrictions and Intellectual Property. 26 | - a. You may not to use, modify, copy, make derivative works of, publish, 27 | distribute, rent, lease, sell, sublicense, assign or otherwise transfer the 28 | Licensed Materials, except as expressly set forth above in Section 1. 29 | - b. Linkedin (and its licensors) retains its intellectual property rights 30 | in the Licensed Materials. Except as expressly set forth in Section 1, 31 | LinkedIn grants no licenses. 32 | - c. You indemnify LinkedIn and its licensors and affiliates for i) any 33 | alleged infringement or misappropriation of any intellectual property rights 34 | of any third party based on modifications you make to the Licensed Materials, 35 | ii) any claims arising from your use or distribution of all or part of the 36 | Licensed Materials and iii) a breach of this Agreement. You will defend, hold 37 | harmless, and indemnify LinkedIn and its affiliates (and our and their 38 | respective employees, shareholders, and directors) from any claim or action 39 | brought by a third party, including all damages, liabilities, costs and 40 | expenses, including reasonable attorneys’ fees, to the extent resulting from, 41 | alleged to have resulted from, or in connection with: (a) your breach of your 42 | obligations herein; or (b) your use or distribution of any Licensed Materials. 43 | 44 | 3. Open source. This code may include open source software, which may be 45 | subject to other license terms as provided in the files. 46 | 47 | 4. Warranty Disclaimer. LINKEDIN PROVIDES THE LICENSED MATERIALS ON AN “AS IS” 48 | AND “AS AVAILABLE” BASIS. LINKEDIN MAKES NO REPRESENTATION OR WARRANTY, 49 | WHETHER EXPRESS OR IMPLIED, ABOUT THE LICENSED MATERIALS, INCLUDING ANY 50 | REPRESENTATION THAT THE LICENSED MATERIALS WILL BE FREE OF ERRORS, BUGS OR 51 | INTERRUPTIONS, OR THAT THE LICENSED MATERIALS ARE ACCURATE, COMPLETE OR 52 | OTHERWISE VALID. TO THE FULLEST EXTENT PERMITTED BY LAW, LINKEDIN AND ITS 53 | AFFILIATES DISCLAIM ANY IMPLIED OR STATUTORY WARRANTY OR CONDITION, INCLUDING 54 | ANY IMPLIED WARRANTY OR CONDITION OF MERCHANTABILITY OR FITNESS FOR A 55 | PARTICULAR PURPOSE, AVAILABILITY, SECURITY, TITLE AND/OR NON-INFRINGEMENT. 56 | YOUR USE OF THE LICENSED MATERIALS IS AT YOUR OWN DISCRETION AND RISK, AND 57 | YOU WILL BE SOLELY RESPONSIBLE FOR ANY DAMAGE THAT RESULTS FROM USE OF THE 58 | LICENSED MATERIALS TO YOUR COMPUTER SYSTEM OR LOSS OF DATA. NO ADVICE OR 59 | INFORMATION, WHETHER ORAL OR WRITTEN, OBTAINED BY YOU FROM US OR THROUGH OR 60 | FROM THE LICENSED MATERIALS WILL CREATE ANY WARRANTY OR CONDITION NOT 61 | EXPRESSLY STATED IN THESE TERMS. 62 | 63 | 5. Limitation of Liability. LINKEDIN SHALL NOT BE LIABLE FOR ANY INDIRECT, 64 | INCIDENTAL, SPECIAL, PUNITIVE, CONSEQUENTIAL OR EXEMPLARY DAMAGES, INCLUDING 65 | BUT NOT LIMITED TO, DAMAGES FOR LOSS OF PROFITS, GOODWILL, USE, DATA OR OTHER 66 | INTANGIBLE LOSSES . IN NO EVENT WILL LINKEDIN'S AGGREGATE LIABILITY TO YOU 67 | EXCEED $100. THIS LIMITATION OF LIABILITY SHALL: 68 | - i. APPLY REGARDLESS OF WHETHER (A) YOU BASE YOUR CLAIM ON CONTRACT, TORT, 69 | STATUTE, OR ANY OTHER LEGAL THEORY, (B) WE KNEW OR SHOULD HAVE KNOWN ABOUT 70 | THE POSSIBILITY OF SUCH DAMAGES, OR (C) THE LIMITED REMEDIES PROVIDED IN THIS 71 | SECTION FAIL OF THEIR ESSENTIAL PURPOSE; AND 72 | - ii. NOT APPLY TO ANY DAMAGE THAT LINKEDIN MAY CAUSE YOU INTENTIONALLY OR 73 | KNOWINGLY IN VIOLATION OF THESE TERMS OR APPLICABLE LAW, OR AS OTHERWISE 74 | MANDATED BY APPLICABLE LAW THAT CANNOT BE DISCLAIMED IN THESE TERMS. 75 | 76 | 6. Termination. This Agreement automatically terminates upon your breach of 77 | this Agreement or termination of your LinkedIn Learning subscription. On 78 | termination, all licenses granted under this Agreement will terminate 79 | immediately and you will delete the Licensed Materials. Sections 2-7 of this 80 | Agreement survive any termination of this Agreement. LinkedIn may discontinue 81 | the availability of some or all of the Licensed Materials at any time for any 82 | reason. 83 | 84 | 7. Miscellaneous. This Agreement will be governed by and construed in 85 | accordance with the laws of the State of California without regard to conflict 86 | of laws principles. The exclusive forum for any disputes arising out of or 87 | relating to this Agreement shall be an appropriate federal or state court 88 | sitting in the County of Santa Clara, State of California. If LinkedIn does 89 | not act to enforce a breach of this Agreement, that does not mean that 90 | LinkedIn has waived its right to enforce this Agreement. The Agreement does 91 | not create a partnership, agency relationship, or joint venture between the 92 | parties. Neither party has the power or authority to bind the other or to 93 | create any obligation or responsibility on behalf of the other. You may not, 94 | without LinkedIn’s prior written consent, assign or delegate any rights or 95 | obligations under these terms, including in connection with a change of 96 | control. Any purported assignment and delegation shall be ineffective. The 97 | Agreement shall bind and inure to the benefit of the parties, their respective 98 | successors and permitted assigns. If any provision of the Agreement is 99 | unenforceable, that provision will be modified to render it enforceable to the 100 | extent possible to give effect to the parties’ intentions and the remaining 101 | provisions will not be affected. This Agreement is the only agreement between 102 | you and LinkedIn regarding the Licensed Materials, and supersedes all prior 103 | agreements relating to the Licensed Materials. 104 | 105 | Last Updated: March 2019 106 | -------------------------------------------------------------------------------- /NOTICE: -------------------------------------------------------------------------------- 1 | Copyright 2023 LinkedIn Corporation 2 | All Rights Reserved. 3 | 4 | Licensed under the LinkedIn Learning Exercise File License (the "License"). 5 | See LICENSE in the project root for license information. 6 | 7 | ATTRIBUTIONS: 8 | 9 | requests 10 | https://github.com/psf/requests/ 11 | License: Apache 2.0 12 | http://www.apache.org/licenses/ 13 | 14 | Please note, this project may automatically load third party code from external 15 | repositories (for example, NPM modules, Composer packages, or other dependencies). 16 | If so, such third party code may be subject to other license terms than as set 17 | forth above. In addition, such third party code may also depend on and load 18 | multiple tiers of dependencies. Please review the applicable licenses of the 19 | additional dependencies. 20 | 21 | =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- 22 | 23 | " Apache License 24 | Version 2.0, January 2004 25 | http://www.apache.org/licenses/ 26 | 27 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 28 | 29 | 1. Definitions. 30 | 31 | ""License"" shall mean the terms and conditions for use, reproduction, 32 | and distribution as defined by Sections 1 through 9 of this document. 33 | 34 | ""Licensor"" shall mean the copyright owner or entity authorized by 35 | the copyright owner that is granting the License. 36 | 37 | ""Legal Entity"" shall mean the union of the acting entity and all 38 | other entities that control, are controlled by, or are under common 39 | control with that entity. For the purposes of this definition, 40 | ""control"" means (i) the power, direct or indirect, to cause the 41 | direction or management of such entity, whether by contract or 42 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 43 | outstanding shares, or (iii) beneficial ownership of such entity. 44 | 45 | ""You"" (or ""Your"") shall mean an individual or Legal Entity 46 | exercising permissions granted by this License. 47 | 48 | ""Source"" form shall mean the preferred form for making modifications, 49 | including but not limited to software source code, documentation 50 | source, and configuration files. 51 | 52 | ""Object"" form shall mean any form resulting from mechanical 53 | transformation or translation of a Source form, including but 54 | not limited to compiled object code, generated documentation, 55 | and conversions to other media types. 56 | 57 | ""Work"" shall mean the work of authorship, whether in Source or 58 | Object form, made available under the License, as indicated by a 59 | copyright notice that is included in or attached to the work 60 | (an example is provided in the Appendix below). 61 | 62 | ""Derivative Works"" shall mean any work, whether in Source or Object 63 | form, that is based on (or derived from) the Work and for which the 64 | editorial revisions, annotations, elaborations, or other modifications 65 | represent, as a whole, an original work of authorship. For the purposes 66 | of this License, Derivative Works shall not include works that remain 67 | separable from, or merely link (or bind by name) to the interfaces of, 68 | the Work and Derivative Works thereof. 69 | 70 | ""Contribution"" shall mean any work of authorship, including 71 | the original version of the Work and any modifications or additions 72 | to that Work or Derivative Works thereof, that is intentionally 73 | submitted to Licensor for inclusion in the Work by the copyright owner 74 | or by an individual or Legal Entity authorized to submit on behalf of 75 | the copyright owner. For the purposes of this definition, ""submitted"" 76 | means any form of electronic, verbal, or written communication sent 77 | to the Licensor or its representatives, including but not limited to 78 | communication on electronic mailing lists, source code control systems, 79 | and issue tracking systems that are managed by, or on behalf of, the 80 | Licensor for the purpose of discussing and improving the Work, but 81 | excluding communication that is conspicuously marked or otherwise 82 | designated in writing by the copyright owner as ""Not a Contribution."" 83 | 84 | ""Contributor"" shall mean Licensor and any individual or Legal Entity 85 | on behalf of whom a Contribution has been received by Licensor and 86 | subsequently incorporated within the Work. 87 | 88 | 2. Grant of Copyright License. Subject to the terms and conditions of 89 | this License, each Contributor hereby grants to You a perpetual, 90 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 91 | copyright license to reproduce, prepare Derivative Works of, 92 | publicly display, publicly perform, sublicense, and distribute the 93 | Work and such Derivative Works in Source or Object form. 94 | 95 | 3. Grant of Patent License. Subject to the terms and conditions of 96 | this License, each Contributor hereby grants to You a perpetual, 97 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 98 | (except as stated in this section) patent license to make, have made, 99 | use, offer to sell, sell, import, and otherwise transfer the Work, 100 | where such license applies only to those patent claims licensable 101 | by such Contributor that are necessarily infringed by their 102 | Contribution(s) alone or by combination of their Contribution(s) 103 | with the Work to which such Contribution(s) was submitted. If You 104 | institute patent litigation against any entity (including a 105 | cross-claim or counterclaim in a lawsuit) alleging that the Work 106 | or a Contribution incorporated within the Work constitutes direct 107 | or contributory patent infringement, then any patent licenses 108 | granted to You under this License for that Work shall terminate 109 | as of the date such litigation is filed. 110 | 111 | 4. Redistribution. You may reproduce and distribute copies of the 112 | Work or Derivative Works thereof in any medium, with or without 113 | modifications, and in Source or Object form, provided that You 114 | meet the following conditions: 115 | 116 | (a) You must give any other recipients of the Work or 117 | Derivative Works a copy of this License; and 118 | 119 | (b) You must cause any modified files to carry prominent notices 120 | stating that You changed the files; and 121 | 122 | (c) You must retain, in the Source form of any Derivative Works 123 | that You distribute, all copyright, patent, trademark, and 124 | attribution notices from the Source form of the Work, 125 | excluding those notices that do not pertain to any part of 126 | the Derivative Works; and 127 | 128 | (d) If the Work includes a ""NOTICE"" text file as part of its 129 | distribution, then any Derivative Works that You distribute must 130 | include a readable copy of the attribution notices contained 131 | within such NOTICE file, excluding those notices that do not 132 | pertain to any part of the Derivative Works, in at least one 133 | of the following places: within a NOTICE text file distributed 134 | as part of the Derivative Works; within the Source form or 135 | documentation, if provided along with the Derivative Works; or, 136 | within a display generated by the Derivative Works, if and 137 | wherever such third-party notices normally appear. The contents 138 | of the NOTICE file are for informational purposes only and 139 | do not modify the License. You may add Your own attribution 140 | notices within Derivative Works that You distribute, alongside 141 | or as an addendum to the NOTICE text from the Work, provided 142 | that such additional attribution notices cannot be construed 143 | as modifying the License. 144 | 145 | You may add Your own copyright statement to Your modifications and 146 | may provide additional or different license terms and conditions 147 | for use, reproduction, or distribution of Your modifications, or 148 | for any such Derivative Works as a whole, provided Your use, 149 | reproduction, and distribution of the Work otherwise complies with 150 | the conditions stated in this License. 151 | 152 | 5. Submission of Contributions. Unless You explicitly state otherwise, 153 | any Contribution intentionally submitted for inclusion in the Work 154 | by You to the Licensor shall be under the terms and conditions of 155 | this License, without any additional terms or conditions. 156 | Notwithstanding the above, nothing herein shall supersede or modify 157 | the terms of any separate license agreement you may have executed 158 | with Licensor regarding such Contributions. 159 | 160 | 6. Trademarks. This License does not grant permission to use the trade 161 | names, trademarks, service marks, or product names of the Licensor, 162 | except as required for reasonable and customary use in describing the 163 | origin of the Work and reproducing the content of the NOTICE file. 164 | 165 | 7. Disclaimer of Warranty. Unless required by applicable law or 166 | agreed to in writing, Licensor provides the Work (and each 167 | Contributor provides its Contributions) on an ""AS IS"" BASIS, 168 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 169 | implied, including, without limitation, any warranties or conditions 170 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 171 | PARTICULAR PURPOSE. You are solely responsible for determining the 172 | appropriateness of using or redistributing the Work and assume any 173 | risks associated with Your exercise of permissions under this License. 174 | 175 | 8. Limitation of Liability. In no event and under no legal theory, 176 | whether in tort (including negligence), contract, or otherwise, 177 | unless required by applicable law (such as deliberate and grossly 178 | negligent acts) or agreed to in writing, shall any Contributor be 179 | liable to You for damages, including any direct, indirect, special, 180 | incidental, or consequential damages of any character arising as a 181 | result of this License or out of the use or inability to use the 182 | Work (including but not limited to damages for loss of goodwill, 183 | work stoppage, computer failure or malfunction, or any and all 184 | other commercial damages or losses), even if such Contributor 185 | has been advised of the possibility of such damages. 186 | 187 | 9. Accepting Warranty or Additional Liability. While redistributing 188 | the Work or Derivative Works thereof, You may choose to offer, 189 | and charge a fee for, acceptance of support, warranty, indemnity, 190 | or other liability obligations and/or rights consistent with this 191 | License. However, in accepting such obligations, You may act only 192 | on Your own behalf and on Your sole responsibility, not on behalf 193 | of any other Contributor, and only if You agree to indemnify, 194 | defend, and hold each Contributor harmless for any liability 195 | incurred by, or claims asserted against, such Contributor by reason 196 | of your accepting any such warranty or additional liability." 197 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Programming Foundations: Data Structures 2 | This is the repository for the LinkedIn Learning course Programming Foundations: Data Structures. The full course is available from [LinkedIn Learning][lil-course-url]. 3 | 4 | ![Programming Foundations: Data Structures][lil-thumbnail-url] 5 | 6 | Once you get past simple programs with one or two variables, you'll use data structures to store the values in your applications. Data structures are a lot like containers—there's one for every way you want to store your data. While structures like arrays and queues are sometimes taken for granted, a deeper understanding is vital for any programmer who wants to know what's going on "under the hood" and understand how the choices they've made impact the performance and efficiency of their applications. In this course, Kathryn Hodge provides an in-depth overview of the most essential data structures for modern programming in Python. Starting with simple ways of grouping data, like arrays, lists, and tuples, Kathryn gradually introduces more complex data structures, such as dictionaries, sets, queues, and stacks. Each lesson is accompanied by a real-world, practical example that shows the data structures in action. Upon completing this course, you'll have a richer understanding of data structures and how to leverage them as you code. 7 | 8 | ### Instructor 9 | 10 | Kathryn Hodge 11 | 12 | Software Engineer 13 | 14 | 15 | 16 | Check out my other courses on [LinkedIn Learning](https://www.linkedin.com/learning/instructors/kathryn-hodge). 17 | 18 | [lil-course-url]: https://www.linkedin.com/learning/programming-foundations-data-structures-22859292?dApp=59033956&leis=LAA 19 | [lil-thumbnail-url]: https://media.licdn.com/dms/image/D560DAQHxm1ogQ0bu3g/learning-public-crop_675_1200/0/1695143297332?e=2147483647&v=beta&t=2ZXMFcky-k_paF3Drss-WW4l974px0vXoUuHnGNQaRI 20 | -------------------------------------------------------------------------------- /requirements.txt: -------------------------------------------------------------------------------- 1 | requests>=2.28 2 | --------------------------------------------------------------------------------