{"id":16644050,"url":"https://github.com/blossom-babs/data-structures-and-algorithm","last_synced_at":"2025-10-04T11:56:33.126Z","repository":{"id":38392326,"uuid":"475713143","full_name":"blossom-babs/Data-structures-and-algorithm","owner":"blossom-babs","description":"Data structures and algorithms solutions in javascript and pythong - arrays, linked list, trees, lists, object oriented programming","archived":false,"fork":false,"pushed_at":"2023-01-15T16:55:01.000Z","size":401,"stargazers_count":12,"open_issues_count":1,"forks_count":5,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-02-02T08:31:48.865Z","etag":null,"topics":["algorithm","algorithms","data-structures","javascript","jest-tests","leetcode"],"latest_commit_sha":null,"homepage":"https://github.com/blossom-babs/Data-structures-and-algorithm","language":"JavaScript","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/blossom-babs.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-03-30T04:03:27.000Z","updated_at":"2024-07-07T00:34:39.000Z","dependencies_parsed_at":"2023-02-09T23:00:34.644Z","dependency_job_id":null,"html_url":"https://github.com/blossom-babs/Data-structures-and-algorithm","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/blossom-babs%2FData-structures-and-algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/blossom-babs%2FData-structures-and-algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/blossom-babs%2FData-structures-and-algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/blossom-babs%2FData-structures-and-algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/blossom-babs","download_url":"https://codeload.github.com/blossom-babs/Data-structures-and-algorithm/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":238961308,"owners_count":19559466,"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":["algorithm","algorithms","data-structures","javascript","jest-tests","leetcode"],"created_at":"2024-10-12T08:10:17.870Z","updated_at":"2025-10-04T11:56:28.086Z","avatar_url":"https://github.com/blossom-babs.png","language":"JavaScript","readme":"# Data structure and algorithms\n\nExercising my problem solving skills by solving coding challenges and optimizing my result for best solution with data structures and complexity analysis.\n\nFind solutions [here](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode)\n\n## Solutions to [Sean Prashad Pattern](https://seanprashad.com/leetcode-patterns/) curated list\n\n| No | LC Index | Question | Python Soln | Javascript soln | Difficulty | Tags |\n| -- | -------- | -------- | ----------- | --------------- | ---------- | ---- |\n| 1 | 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/1-containsDups.py) | | Easy | Array, Hash Table, Sorting |\n| 2 | 268 | [Missing Number](https://leetcode.com/problems/missing-number/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/2-missingNumber.py) | | Easy | Array, Hash Table, Math, Sorting, Binary search, Bit Manipulation |\n| 3 | 448 | [ Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/3-findDisappearedNumbers.py) | | Easy | Array, Hash Table |\n| 4 | 136 | [Single Number](https://leetcode.com/problems/single-number/submissions/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/4-singleNumber.py) | | Easy | Array, Bit Manipulation |\n| 5 | 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/5-climbingStairs.py) | | Easy | Math, Dynamic Programming, Memoization |\n| 6 | 121 | [Best Time to Buy and sell stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/6-bestTimeToSell.py) | | Easy | Array, Dynamic Programming |\n| 7 | 303 | [Range Sum Query Immutable](https://leetcode.com/problems/range-sum-query-immutable/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/7-rangeSumQuery.py) | | Easy | Array, Design,  Prefix Sum |\n| 8 | 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/8-hasCycle.py) | | Easy | Hash Table, Linked List, Two Pointers |\n| 9 | 876 | [Middle of the linked list](https://leetcode.com/problems/middle-of-the-linked-list/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/9-middleLinkedList.py) | | Easy | Linked List, Two Pointers |\n| 10 | 234 | [Palindrome linked list](https://leetcode.com/problems/palindrome-linked-list/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/10-palindromeLList.py) | | Easy | Linked List, Two Pointers, Stack Recursion |\n| 11 | 206 | [Reverse linked list](https://leetcode.com/problems/reverse-linked-list/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/11-reverseLList.py) | | Easy | Linked List, Stack Recursion |\n| 12 | 203 | [Remove linked list Elements](https://leetcode.com/problems/remove-linked-list-elements//) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/12-removeLListEl.py) | | Easy | Linked List, Recursion |\n| 13 | 83 | [Remove Duplicates from sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/13-removeDupsSortedLList.py) | | Easy | Linked List |\n| 14 | 21 | [Merge Two sorted List](https://leetcode.com/problems/merge-two-sorted-lists/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/14-mergeTwoSortedList.py) | | Easy | Linked List, Recursion |\n| 15 | 704 | [Binary Search](https://leetcode.com/problems/binary-search/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/15-binarySearch.py) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/15-binarySearch.test.js) | Easy | Binary Search, Array |\n| 16 | 744 | [Find Smallest Letter Greater than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/16-nextGreatestLetter.py) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/16-nextGreatestLetter.test.js) | Easy | Binary Search, Array |\n| 17 | 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/17-avgOfLevels.py) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/17-avgOfLevels.test.js) | Easy | Tree, BFS, DFS, Binary Tree |\n| 18 | 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/18-minDepth.py) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/18-minDeptht.test.js) | Easy | Tree, BFS, DFS, Binary Tree |\n| 19 | 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/19-maxDepth.py) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/19-maxDepth.test.js) | Easy | Tree, BFS, DFS, Binary Tree |\n| 20 | 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/20-isSameTree.py) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/20-isSameTree.test.js) | Easy | Tree, BFS, DFS, Binary Tree |\n| 21 | 112 | [Path Sum](https://leetcode.com/problems/path-sum/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/21-pathSum.py) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/21-pathSum.test.js) | Easy | Tree, BFS, DFS, Binary Tree |\n| 22 | 1 | [Two Sum](https://leetcode.com/problems/two-sum/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/22-twoSum.py) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/23-twoSum.test.js) | Easy | Array, Hash Table |\n| 23 | 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/23-invertBinaryTree.py) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/23-invertBinaryTree.test.js) | Easy | Tree, BFS, DFS, Binary Tree |\n| 24 | 572 | [Subtree of another Tree](https://leetcode.com/problems/subtree-of-another-tree/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/24-subTree.py) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/24-subTree.test.js) | Easy | Tree, BFS, DFS, Binary Tree |\n| 25 | 977 | [Squares of a sorted array](https://leetcode.com/problems/squares-of-a-sorted-array/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/25-squareSortedArr.py) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/25-squareSortedArr.test.js) | Easy | Array, Two Pointers, Sorting |\n| 26 | 844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/description/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/26-backspaceStringCompare.py) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/26-backSpaceStringCompare.test.js) | Easy | Two Pointers, String, Stack, Simulation |\n| 27 | 169 | [Majority Element](https://leetcode.com/problems/majority-element) | [Solution](-) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/Javascript/27-majorityElement.test.js) | Easy | Array, Hash table, divide and conquer, sorting, counting |\n| Bonus | 142 | [Linked List cycle II](https://leetcode.com/problems/linked-list-cycle-ii/submissions/) | [Solution](https://github.com/blossom-babs/Data-structures-and-algorithm/blob/main/leetcode/sean-prashad/python/bonus-linkedlistII.py) | | Easy | Hash Table, Linked List, Two Pointers |\n\n\n# Chore\n\n1. Test linked list problem in sean prashad pattern","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fblossom-babs%2Fdata-structures-and-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fblossom-babs%2Fdata-structures-and-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fblossom-babs%2Fdata-structures-and-algorithm/lists"}