{"id":23929367,"url":"https://github.com/monamobeen/coding","last_synced_at":"2026-04-02T02:42:21.973Z","repository":{"id":238488427,"uuid":"796661791","full_name":"MonaMobeen/Coding","owner":"MonaMobeen","description":"100+ Challenges Data Structures \u0026 Algorithms. As this repo designed to help you prepare for technical interviews at top tech companies like Meta (Facebook), Amazon, Apple, Netflix, and Google (MAANG). The focus is on building a strong foundation in clean code, data structures, and algorithms.","archived":false,"fork":false,"pushed_at":"2024-08-28T10:19:02.000Z","size":137,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-01-05T23:16:53.586Z","etag":null,"topics":["data-structures","geometry","hashmap","leetcode-practice","mathematics","matrix"],"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/MonaMobeen.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,"publiccode":null,"codemeta":null}},"created_at":"2024-05-06T11:44:05.000Z","updated_at":"2024-12-27T14:43:03.000Z","dependencies_parsed_at":"2024-05-06T12:58:25.190Z","dependency_job_id":"aafe029a-5c2b-4d5c-8fe9-e2112defba80","html_url":"https://github.com/MonaMobeen/Coding","commit_stats":null,"previous_names":["monamobeen/data-structures-journeys","monamobeen/dsa_library","monamobeen/coding"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MonaMobeen%2FCoding","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MonaMobeen%2FCoding/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MonaMobeen%2FCoding/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MonaMobeen%2FCoding/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MonaMobeen","download_url":"https://codeload.github.com/MonaMobeen/Coding/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240404517,"owners_count":19796059,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["data-structures","geometry","hashmap","leetcode-practice","mathematics","matrix"],"created_at":"2025-01-05T23:16:58.174Z","updated_at":"2025-12-27T17:28:46.838Z","avatar_url":"https://github.com/MonaMobeen.png","language":"C++","readme":"**MAANG Interview Preparation**\n\nYou should start with:\n\n- Clean code\n- Data structures\n- Algorithms\n\n**For data structures**, look at reviewing:\n\n- Array\n- LinkedList\n- Stack\n- Queue\n- HashMap\n- Tree\n- Graph\n\n**For algorithms**, look at reviewing:\n\n- Sort algorithms — merge sort, quick sort, bucket sort, heap sort\n- Search algorithms — binary, depth-first, breadth-first\n- Greedy algorithms — Kruskal’s, Dijkstra’s\n\n**Coding Considerations**   \n\n1. Fundamentals:\nGrasp the basics: Master variables, data types (int, float, char, etc.), operators (+, -, *, /), control flow (if, else, for, while), and functions. Understand object-oriented programming (OOP): Learn about classes, objects, inheritance, polymorphism, and encapsulation.\n\n2. Data Structures \u0026 Algorithms:\n\nChoose appropriate data structures: Arrays, pointers, structures, unions, linked lists, stacks, queues, trees, and graphs each have their strengths and weaknesses. Learn their uses and trade-offs. Design efficient algorithms: Strive for algorithms that solve problems in an optimal way (e.g., sorting algorithms like bubble sort vs. quick sort). \n\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmonamobeen%2Fcoding","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmonamobeen%2Fcoding","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmonamobeen%2Fcoding/lists"}