{"id":20672718,"url":"https://github.com/gmal1/algoholics-anon","last_synced_at":"2025-04-19T19:11:19.163Z","repository":{"id":38290951,"uuid":"188726286","full_name":"gmal1/algoholics-anon","owner":"gmal1","description":"algorithms and data structures","archived":false,"fork":false,"pushed_at":"2024-09-12T01:45:37.000Z","size":564,"stargazers_count":23,"open_issues_count":10,"forks_count":8,"subscribers_count":6,"default_branch":"main","last_synced_at":"2024-09-12T11:36:54.625Z","etag":null,"topics":["algorithms","data-structures","javascript","kotlin","python","searching-algorithms","sorting-algorithms","trees","typescript"],"latest_commit_sha":null,"homepage":null,"language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/gmal1.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-05-26T20:02:25.000Z","updated_at":"2023-07-14T17:21:21.000Z","dependencies_parsed_at":"2023-02-05T02:02:12.411Z","dependency_job_id":"6799fcf0-7005-4662-acb3-c5b8e859e254","html_url":"https://github.com/gmal1/algoholics-anon","commit_stats":{"total_commits":191,"total_committers":6,"mean_commits":"31.833333333333332","dds":0.6178010471204188,"last_synced_commit":"ed5b2e212da468344f009de755d08a69df53059e"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmal1%2Falgoholics-anon","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmal1%2Falgoholics-anon/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmal1%2Falgoholics-anon/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmal1%2Falgoholics-anon/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gmal1","download_url":"https://codeload.github.com/gmal1/algoholics-anon/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":224970163,"owners_count":17400294,"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","javascript","kotlin","python","searching-algorithms","sorting-algorithms","trees","typescript"],"created_at":"2024-11-16T20:38:35.943Z","updated_at":"2024-11-16T20:38:36.553Z","avatar_url":"https://github.com/gmal1.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"[![contributions welcome](https://img.shields.io/badge/contributions-welcome-brightgreen.svg?style=flat)](https://github.com/gmal1/algoholics-anon/issues)\n[![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg?style=flat-square)](https://github.com/gmal1/algoholics-anon/pulls)\n\n## Algorithms\n### Searching:\n* binary search ([TypeScript](../master/algorithms/search/binarySearch.ts) / [JavaScript](../master/algorithms/search/binarySearch.js))\n* quick select ([TypeScript](../master/algorithms/search/quickSelect.ts))\n* shortest path ([JavaScript](../master/algorithms/search/shortestPath.js))\n\n### Sorting:\n* bubble sort ([JavaScript](../master/algorithms/sorts/BubbleSort.js))\n* counting sort ([JavaScript](../master/algorithms/sorts/CountingSort.js) / [TypeScript](../master/algorithms/sorts/CountingSort.ts))\n* heap sort ([JavaScript](../master/algorithms/sorts/HeapSort.js))\n* insertion sort ([JavaScript](../master/algorithms/sorts/InsertionSort.js))\n* Knuth shuffle ([JavaScript](../master/algorithms/sorts/knuthShuffle.js))\n* merge sort ([JavaScript](../master/algorithms/sorts/MergeSort.js))\n* merge sort in place ([JavaScript](../master/algorithms/sorts/mergeSortInPlace.js))\n* quicksort ([JavaScript](../master/algorithms/sorts/QuickSort.js) / [TypeScript](../master/algorithms/sorts/QuickSort.ts) / [Python](../master/algorithms/sorts/QuickSort.py))\n* radix sort ([TypeScript](../master/algorithms/sorts/RadixSort.ts))\n* selection sort ([JavaScript](../master/algorithms/sorts/SelectionSort.js) / [TypeScript](../master/algorithms/sorts/SelectionSort.ts))\n* shell sort ([JavaScript](../master/algorithms/sorts/ShellSort.js))\n* wiggle sort ([JavaScript](../master/algorithms/sorts/WiggleSort.js))\n\n### Tree traversal:\n* in-order traversal ([JavaScript](../master/algorithms/treeTraversal/inorderTraversal.js))\n* post-order traversal ([JavaScript](../master/algorithms/treeTraversal/postorderTraversal.js))\n* pre-order traversal ([JavaScript](../master/algorithms/treeTraversal/preorderTraversal.js))\n\n## Data structures\n* binary search tree ([JavaScript](../master/data-structures/BST.js))\n* bloom filter ([JavaScript](../master/data-structures/BloomFilter.js))\n* deque ([JavaScript](../master/data-structures/Deque.js) / [TypeScript](../master/data-structures/Deque.ts))\n* doubly linked list ([JavaScript](../master/data-structures/DoublyLinkedList.js))\n* graph ([JavaScript](../master/data-structures/Graph.js) / [TypeScript](../master/data-structures/Graph.ts))\n* hash table ([JavaScript](../master/data-structures/HashTable.js))\n* linked list ([JavaScript](../master/data-structures/LinkedList.js) / [Python](../master/python/data-structures/linked_list.py))\n* LRU cache ([JavaScript](../master/data-structures/LRUcache.js))\n* max heap ([JavaScript](../master/data-structures/MaxHeap.js) / [TypeScript](../master/data-structures/MaxHeap.ts) / [Python](../master/python/data-structures/heaps.py))\n* min heap ([TypeScript](../master/data-structures/MinHeap.ts) / [Python](../master/python/data-structures/heaps.py))\n* randomized queue ([TypeScript](../master/data-structures/RandomizedQueue.ts))\n* red-black tree ([Python](../master/python/data-structures/ll_red_black.py))\n* stack ([Python](../master/python/cracking-coding/stacks_queues/stack.py))\n* trie ([JavaScript](../master/data-structures/trie.js))\n\n## Interview questions\n* animal shelter ([Python](../master/python/cracking-coding/stacks_queues/animal_shelter.py))\n* apple stocks ([JavaScript](../master/interview-questions/maxProfitCalc.js))\n* balanced BST ([JavaScript](../master/interview-questions/balancedBST.js))\n* balanced parens / https://leetcode.com/problems/valid-parentheses/ ([JavaScript](../master/interview-questions/balancedParens.js))\n* balanced parens with wildcard ([JavaScript](../master/interview-questions/balancedParensWithWildCard.js))\n* baseball scoring ([JavaScript](../master/interview-questions/baseballScoring.js))\n* bikes ([JavaScript](../master/interview-questions/bikes.js))\n* bucket fill ([JavaScript](../master/interview-questions/colorPixels.js))\n* check if given string is interleaving of two strings ([JavaScript](../master/interview-questions/isInterleaved.js))\n* check permutation ([Python](../master/python/cracking-coding/array_strings/is_perm.py))\n* climb steps ([JavaScript](..//master/interview-questions/countWays.js))\n* clone linked list with random pointer / https://leetcode.com/problems/copy-list-with-random-pointer/ ([JavaScript](../master/interview-questions/cloneLLwithRandomPtr.js))\n* construct a BST of minimal height / https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ ([JavaScript](../master/interview-questions/minHeightBST.js))\n* decode string ([JavaScript](../master/interview-questions/decodeString.js))\n* decode permutations ([JavaScript](../master/interview-questions/decodeWays.js))\n* deep clone graph / https://leetcode.com/problems/clone-graph/ ([JavaScript](../master/interview-questions/deepCloneGraph.js))\n* delete linked list node ([Python](../master/python/cracking-coding/linked_list/del_node.py))\n* find longest increasing route in graph ([JavaScript](../master/interview-questions/longestIncreasingInGraph.js))\n* find shortest route in directed graph ([JavaScript](../master/interview-questions/findRoute.js))\n* find sum of elements between two indices in integer array ([JavaScript](../master/interview-questions/rangeSumQuery.js))\n* generate all permutations ([JavaScript](../master/interview-questions/generateAllPerms.js))\n* generate valid parens pairs / https://leetcode.com/problems/generate-parentheses/ ([JavaScript](../master/interview-questions/generateParens.js))\n* hat / Google interview question ([JavaScript](../master/interview-questions/hat.js))\n* is unique ([Python](../master/python/cracking-coding/array_strings/is_unique.py))\n* isomorphic strings / https://leetcode.com/problems/isomorphic-strings/ ([JavaScript](../master/interview-questions/isomorphicStrings.js))\n* kth to last ([Python](../master/python/cracking-coding/linked_list/kth_to_last.py))\n* longest substring with at most k distinct characters ([JavaScript](../master/interview-questions/longestSubstringKDistinct.js))\n* longest substring with no repeating characters ([JavaScript](../master/interview-questions/longestSubStrNoRepeat.js) / [TypeScript](../master/interview-questions/longestSubStrNoRepeat.ts))\n* loop detection ([Python](../master/python/cracking-coding/linked_list/loop_detection.py))\n* match words to pattern ([JavaScript](../master/interview-questions/matchPattern.js))\n* most common word ([JavaScript](../master/interview-questions/mostCommonWord.js) / [TypeScript](../master/interview-questions/mostCommonWord.ts))\n* move zeroes to the right ([JavaScript](../master/interview-questions/moveZeroesRight.js))\n* n paths / no backtracking ([JavaScript](../master/interview-questions/nPathsNoBacktracking.js))\n* number of islands ([JavaScript](../master/interview-questions/numberOfIslands.js))\n* one away ([Python](../master/python/cracking-coding/array_strings/one_away.py))\n* palindrome permutation ([Python](../master/python/cracking-coding/array_strings/palin_perm.py))\n* partition linked list ([Python](../master/python/cracking-coding/linked_list/partition.py))\n* peek from iterator ([JavaScript](../master/interview-questions/peekFromIterator.js))\n* pig latin translator ([JavaScript](../master/interview-questions/pigLatin.js))\n* push to end ([JavaScript](../master/interview-questions/pushToEnd.js))\n* queue via stacks ([Python](../master/python/cracking-coding/stacks_queues/queue_w_stacks.py))\n* reverse linked list ([JavaScript](../master/interview-questions/reverseLinkedList.js))\n* remove dups in linked list ([Python](../master/python/cracking-coding/linked_list/remove_dups.py))\n* rotate matrix ([Python](../master/python/cracking-coding/array_strings/rotate_matrix.py))\n* set of stacks ([Python](../master/python/cracking-coding/stacks_queues/set_of_stacks.py))\n* shortest path ([JavaScript](../master/interview-questions/shortestPath.js))\n* sort stack ([Python](../master/python/cracking-coding/stacks_queues/sort_stack.py))\n* spiral matrix ([JavaScript](../master/interview-questions/spiralMatrix.js))\n* stack min ([Python](../master/python/cracking-coding/stacks_queues/stack_min.py))\n* string compression ([Python](../master/python/cracking-coding/array_strings/str_compression.py))\n* string rotation ([Python](../master/python/cracking-coding/array_strings/string_rotation.py))\n* subset sums ([JavaScript](../master/interview-questions/subsetSums.js))\n* sum lists ([Python](../master/python/cracking-coding/linked_list/sum_digits.py))\n* synchronize ([JavaScript](../master/interview-questions/synchronize.js))\n* task scheduler ([JavaScript](../master/interview-questions/taskScheduler.js))\n* three stacks with one array ([Python](../master/python/cracking-coding/stacks_queues/three_in_one.py))\n* Toeplitz matrix ([JavaScript](../master/interview-questions/toeplitzMatrix.js))\n* trapping rainwater ([JavaScript](../master/interview-questions/trappingRainwater.js) / [TypeScript](../master/interview-questions/trappingRainwater.ts))\n* two sum ([JavaScript](../master/interview-questions/twoSum.js) / [TypeScript](../master/interview-questions/twoSum.ts))\n* unbounded knapsack ([JavaScript](../master/interview-questions/unboundedKnapsack.js))\n* urlify ([Python](../master/python/cracking-coding/array_strings/urlify.py))\n* word search II / https://leetcode.com/problems/word-search-ii/ ([JavaScript](../master/interview-questions/wordSearchTwo.js))\n* wrap text ([Kotlin](../master/interview-questions/wrapText.kt))\n* zero matrix ([Python](../master/python/cracking-coding/array_strings/zero_matrix.py))","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgmal1%2Falgoholics-anon","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgmal1%2Falgoholics-anon","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgmal1%2Falgoholics-anon/lists"}