{"id":18985534,"url":"https://github.com/jagoda11/cs50-problem-set-2","last_synced_at":"2026-06-16T23:31:57.149Z","repository":{"id":222013252,"uuid":"134271543","full_name":"Jagoda11/CS50-Problem-Set-2","owner":"Jagoda11","description":"CS50-Problem-Set-2 🚀 delves into data structures 📊 and memory allocation 💾, key components of efficient programming. This set challenges students 🧑‍🎓 to understand and implement various data structures like arrays, linked lists, and trees 🌳, and manage memory effectively 🧠, enhancing their problem-solving skills","archived":false,"fork":false,"pushed_at":"2024-03-18T15:12:36.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-11-10T23:30:25.087Z","etag":null,"topics":["arrays","c","cs50","cs50problemsets","datastructures","linked-list","memory-allocation","problem-solving","trees"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Jagoda11.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null}},"created_at":"2018-05-21T13:16:18.000Z","updated_at":"2024-05-22T15:06:04.000Z","dependencies_parsed_at":"2024-02-11T20:12:39.931Z","dependency_job_id":"a2910a93-4a6e-4f94-82dd-2a45b42ad02d","html_url":"https://github.com/Jagoda11/CS50-Problem-Set-2","commit_stats":null,"previous_names":["jagoda11/pset2-","jagoda11/cs50-problem-set-2"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Jagoda11/CS50-Problem-Set-2","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jagoda11%2FCS50-Problem-Set-2","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jagoda11%2FCS50-Problem-Set-2/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jagoda11%2FCS50-Problem-Set-2/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jagoda11%2FCS50-Problem-Set-2/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Jagoda11","download_url":"https://codeload.github.com/Jagoda11/CS50-Problem-Set-2/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jagoda11%2FCS50-Problem-Set-2/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34428196,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-16T02:00:06.860Z","response_time":126,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["arrays","c","cs50","cs50problemsets","datastructures","linked-list","memory-allocation","problem-solving","trees"],"created_at":"2024-11-08T16:27:02.236Z","updated_at":"2026-06-16T23:31:57.126Z","avatar_url":"https://github.com/Jagoda11.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# CS50 Problem Set 2 🚀\n\nWelcome to my CS50 Problem Set 2 repository! This set dives into the world of cryptography, featuring two classic ciphers implemented in C. Let's encrypt and decrypt messages in style! 🎉\n\n## Caesar Cipher 🔐\n\n- **Filename:** `caesar.c`\n- **Description:** This program encrypts messages using the Caesar cipher, one of the simplest and most widely known encryption techniques. It shifts each letter by a fixed number of positions in the alphabet, wrapping around as necessary. 🔄\n\n## Vigenère Cipher 📜\n\n- **Filename:** `vigenere.c`\n- **Description:** Taking a step further into the realm of cryptography, the Vigenère cipher uses a keyword to shift each letter in the plaintext, offering a more secure encryption method. Unlike Caesar's fixed shift, Vigenère's shift varies, making it a polyalphabetic cipher. 🗝️\n\n## Getting Started 🏁\n\nTo run these encryption programs, clone the repository and compile each program using `clang` or `make`. Provide a key as a command-line argument when executing the program, and then enter the plaintext you wish to encrypt.\n\nExample for Caesar:\n./caesar 13\n\n\nExample for Vigenère:\n./vigenere keyword\n\n\n## Dive into Cryptography 🤿\n\nThese programs offer a hands-on experience with basic cryptography concepts. By exploring these ciphers, you'll gain insights into historical encryption methods and their modern significance.\n\n\nFeel free to explore\nHappy Coding! 💻\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjagoda11%2Fcs50-problem-set-2","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjagoda11%2Fcs50-problem-set-2","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjagoda11%2Fcs50-problem-set-2/lists"}