{"id":21730225,"url":"https://github.com/sumanbiswas7/ds-algo","last_synced_at":"2025-06-15T02:33:52.141Z","repository":{"id":43916938,"uuid":"500159413","full_name":"sumanbiswas7/ds-algo","owner":"sumanbiswas7","description":"patterns for coding interviews ","archived":false,"fork":false,"pushed_at":"2022-10-24T13:49:45.000Z","size":343,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-20T23:24:03.341Z","etag":null,"topics":["algorithms","data-structures","python"],"latest_commit_sha":null,"homepage":"","language":"Python","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/sumanbiswas7.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}},"created_at":"2022-06-05T17:04:17.000Z","updated_at":"2022-08-25T06:42:15.000Z","dependencies_parsed_at":"2023-01-20T07:47:09.355Z","dependency_job_id":null,"html_url":"https://github.com/sumanbiswas7/ds-algo","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sumanbiswas7/ds-algo","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sumanbiswas7%2Fds-algo","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sumanbiswas7%2Fds-algo/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sumanbiswas7%2Fds-algo/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sumanbiswas7%2Fds-algo/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sumanbiswas7","download_url":"https://codeload.github.com/sumanbiswas7/ds-algo/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sumanbiswas7%2Fds-algo/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259912701,"owners_count":22931105,"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","python"],"created_at":"2024-11-26T04:14:04.858Z","updated_at":"2025-06-15T02:33:52.081Z","avatar_url":"https://github.com/sumanbiswas7.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithms Interview\n\nunderstand coding problem patterns to build a good base on solving problems. all answers are in python but if you get the idea you can implement these in any language and clinch your tech interview :) \u003cbr/\u003e\n\n\u003e **Note** : You are not expected to understand all of these problems just by reading the given explanation. You could use these as a hint or you could use these as revision material.\n\n## Patterns and Solutions\n\n[`Hashing`](01-hashing/HASHING.md) [`Sliding Window`](02-sliding-window/SLIDING_WINDOW.md) [`Two Pointers`](03-two-pointers/TWO_POINTERS.md) [`Fast slow pointers`](04-fast_slow-pointers/FAST_SLOW_POINTERS.md) [`Merge intervals`](05-merge-intervals/MERGE_INTERVALS.md) [`Cyclic sort`](06-cyclic-sort/CYCLIC_SORT.md) \u003cbr/\u003e\n[`Inplace reversal of a linkedlist`](07-inplace-reversal-linkedlist/INPLACE_REVERSAL_LINKEDLIST.md)\n[`Subsets`](08-subsets/SUBSETS.md)\n\n## Table of contents\n\n#### Hashing\n\n- [Contains Duplicate](01-hashing/HASHING.md)\n- [Two Sum](01-hashing/HASHING.md)\n- [Valid Anagram](01-hashing/HASHING.md)\n- [Group Anagrams](01-hashing/HASHING.md)\n- [Top k frequent elements](01-hashing/HASHING.md)\n- [Product of array expect self](01-hashing/HASHING.md)\n- [Valid soduku](01-hashing/HASHING.md)\n\n#### Sliding window\n\n- [Maximum Sum Subarray of Size K ](02-sliding-window/SLIDING_WINDOW.md)\n- [Smallest array with given sum](02-sliding-window/SLIDING_WINDOW.md)\n- [Longest substring with k character](02-sliding-window/SLIDING_WINDOW.md)\n- [Fruits into busket](02-sliding-window/SLIDING_WINDOW.md#fruits-into-basket)\n- [Longest substr without repeating char](02-sliding-window/SLIDING_WINDOW.md)\n- [Longest substr with same letters after replacement](02-sliding-window/SLIDING_WINDOW.md)\n- [Longest subarray with ones after replacement](02-sliding-window/SLIDING_WINDOW.md)\n\n#### Two pointers\n\n- [Two sum sorted](03-two-pointers/TWO_POINTERS.md)\n- [Remove duplicates from sorted array](03-two-pointers/TWO_POINTERS.md)\n- [Squaring a Sorted Array](03-two-pointers/TWO_POINTERS.md)\n- [Three sum](03-two-pointers/TWO_POINTERS.md)\n- [Three sum closest](03-two-pointers/TWO_POINTERS.md)\n- [Three sum smaller](03-two-pointers/TWO_POINTERS.md)\n- [Dutch national flag problem](03-two-pointers/TWO_POINTERS.md)\n\n#### Fast and slow pointer\n\n- [Linked list cycle](04-fast_slow-pointers/FAST_SLOW_POINTERS.md)\n- [Linked list cycle II](04-fast_slow-pointers/FAST_SLOW_POINTERS.md)\n- [Middle of the linked list](04-fast_slow-pointers/FAST_SLOW_POINTERS.md)\n- [Happy number](04-fast_slow-pointers/FAST_SLOW_POINTERS.md)\n\n#### Merge intervals\n\n- [Merge intervals](05-merge-intervals/MERGE_INTERVALS.md)\n- [Insert intervals](05-merge-intervals/MERGE_INTERVALS.md)\n- [Intervals intersection](05-merge-intervals/MERGE_INTERVALS.md)\n- [Conflicting appointments](05-merge-intervals/MERGE_INTERVALS.md)\n\n#### Cyclic sort\n\n- [Cyclic sort](06-cyclic-sort/CYCLIC_SORT.md)\n- [Find the missing number](06-cyclic-sort/CYCLIC_SORT.md)\n- [Find all missing number](06-cyclic-sort/CYCLIC_SORT.md)\n- [Find the duplicate number](06-cyclic-sort/CYCLIC_SORT.md)\n- [Find all duplicate number](06-cyclic-sort/CYCLIC_SORT.md)\n\n#### Inplace reversal of a linkedlist\n\n- [Reverse a linkedlist](07-inplace-reversal-linkedlist/INPLACE_REVERSAL_LINKEDLIST.md)\n- [Reverse a sublist](07-inplace-reversal-linkedlist/INPLACE_REVERSAL_LINKEDLIST.md)\n- [Reverse every K-element Sub-list](07-inplace-reversal-linkedlist/INPLACE_REVERSAL_LINKEDLIST.md)\n\n#### Subsets\n\n- [Subsets](08-subsets/SUBSETS.md)\n- [Subsets with duplicates](08-subsets/SUBSETS.md)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsumanbiswas7%2Fds-algo","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsumanbiswas7%2Fds-algo","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsumanbiswas7%2Fds-algo/lists"}