{"id":20380164,"url":"https://github.com/ammahmoudi/designalgorithms","last_synced_at":"2025-09-23T21:31:46.277Z","repository":{"id":191849093,"uuid":"685526805","full_name":"ammahmoudi/DesignAlgorithms","owner":"ammahmoudi","description":"Homework Solutions for Design Algorithm Course as Computer Science B.Sc. Student at Department of Mathematical Sciences, Sharif University of Technology","archived":false,"fork":false,"pushed_at":"2023-09-25T09:49:19.000Z","size":4960,"stargazers_count":6,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-11-15T02:06:16.174Z","etag":null,"topics":["algorithms","data-structures","dynamic-programming","graph-algorithms","greedy-algorithms","linear-programming","recursive-backtracking-algorithm"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"unlicense","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ammahmoudi.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-08-31T12:37:17.000Z","updated_at":"2024-09-06T03:41:24.000Z","dependencies_parsed_at":"2023-09-01T04:59:53.523Z","dependency_job_id":null,"html_url":"https://github.com/ammahmoudi/DesignAlgorithms","commit_stats":null,"previous_names":["ammahmoudi/designalgorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ammahmoudi%2FDesignAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ammahmoudi%2FDesignAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ammahmoudi%2FDesignAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ammahmoudi%2FDesignAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ammahmoudi","download_url":"https://codeload.github.com/ammahmoudi/DesignAlgorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":234001635,"owners_count":18764310,"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":["algorithms","data-structures","dynamic-programming","graph-algorithms","greedy-algorithms","linear-programming","recursive-backtracking-algorithm"],"created_at":"2024-11-15T02:06:21.101Z","updated_at":"2025-09-23T21:31:40.663Z","avatar_url":"https://github.com/ammahmoudi.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DesignAlgorithms\nHomework Solutions for Design Algorithm Course as Computer Science B.Sc. Student at Department of Mathematical Sciences, Sharif University of Technology.\n\nSpring 2023\n\nSupervisor: Dr. Shahram Khazaei\n\n\n## Description\nThis repository includes my homework and projects around Algorithms and Data structures.\n\n## Table of Coding Problems\nEach problem has a PDF file describing the problem in Persian in the format of a story.\nAlgorithms are supposed to be fast and efficient to accept the original problem restrictions.\n\n| Problem | Description |\n| --- | --- |\n| [BalancedParanthesisMinimumSwapsCounter](./BalancedParanthesisMinimumSwapsCounter) | Finding minimum swaps needed to balance an input string of parentheses |\n| [ClosestPointsFinder](./ClosestPointsFinder) |Finding closest points on a 2d plane with different data structures in O(n log n) |\n| [DiversityCoefficientFinding](./DiversityCoefficientFinding) | Calculating Diversity Coefficient among a group of singers in a singing competition |\n| [FarthestNodeFinder](./FarthestNodeFinder) | Finding the farthest node from the given starting node using Dijkstra |\n| [LongestCommonIncreasingSubsequence](./LongestCommonIncreasingSubsequence) | Finding Longest Common Increasing Subsequence between two strings using Dynamic Programming |\n| [MaximumVerticalMarginClassifier](./MaximumVerticalMarginClassifier) | a simple sudo SVM Classifier which only considers vertical distance (solved by LP) |\n| [RookPlacingwithinAllowedArea](./RookPlacingwithinAllowedArea) | Placing Rooks in an N*N chess board in which each rook is allowed to place only in a specified area without threatening other rooks |\n| [SafeMST](./SafeMST) | indicates that a list of edges are all part of the MST of the given graph using some sudo-kruskal algorithm |\n| [SafePathFinder](./SafePathFinder) | indicates that there is a safe path between the start and end point in a graph which has some unsafe edges |\n| [ShortestPathesToGraphBuilder](./ShortestPathesToGraphBuilder) | Given a list of shortest path lengths between vertices and trying to make the smallest graph with these properties  |\n| [TreeSplittingCounter](./TreeSplittingCounter) | Given a tree, trying to count all combinations of splitting this tree with some restrictions  |\n\n## Theoretical Problems\nThere is some theoretical homework along with my solutions around the algorithm topics. (my answers may be incorrect!)\nsourcebook of the course:\n\n\nAlgorithms\n\nBook by Christos Papadimitriou, Sanjoy Dasgupta, and Umesh Vazirani\n\nThe problems are in Persian but my answers are in English.\n\n[Theoritical Homeworks](./TheorticalHomeworks)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fammahmoudi%2Fdesignalgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fammahmoudi%2Fdesignalgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fammahmoudi%2Fdesignalgorithms/lists"}