{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":771236864,"defaultBranch":"main","name":"Data-Structures","ownerLogin":"Narsell","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2024-03-12T23:44:06.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/3138878?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1710287520.0","currentOid":""},"activityList":{"items":[{"before":"19a678ef940ccd2d4d84ebd3c0cbcd70e27e1e97","after":"582e5a27aed346e996a7cf29cbb95961c3290ecd","ref":"refs/heads/main","pushedAt":"2024-05-21T05:38:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Iterative fibonacci sequence\nReduced integer overflow","shortMessageHtmlLink":"Iterative fibonacci sequence"}},{"before":"197eb7ca94e71bd1a0821e33e41e730613060a60","after":"19a678ef940ccd2d4d84ebd3c0cbcd70e27e1e97","ref":"refs/heads/main","pushedAt":"2024-05-21T04:49:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Recursive fibonacci sequence with memoization\nQuicksort doc update","shortMessageHtmlLink":"Recursive fibonacci sequence with memoization"}},{"before":"12dde57c015347d2d1da6b1680746540d98fe15a","after":"197eb7ca94e71bd1a0821e33e41e730613060a60","ref":"refs/heads/main","pushedAt":"2024-05-21T03:28:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Quicksort algorithm","shortMessageHtmlLink":"Quicksort algorithm"}},{"before":"e11f1735f572cf755171e306efc0e6a11686224d","after":"12dde57c015347d2d1da6b1680746540d98fe15a","ref":"refs/heads/main","pushedAt":"2024-05-21T00:49:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Added merge sort","shortMessageHtmlLink":"Added merge sort"}},{"before":"953e5269d421c6a0a6f5c450d9a45ab316c52a00","after":"e11f1735f572cf755171e306efc0e6a11686224d","ref":"refs/heads/main","pushedAt":"2024-05-17T01:01:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Added basic sorted algorithms (Bubble sort, selection sort and insertion sort)","shortMessageHtmlLink":"Added basic sorted algorithms (Bubble sort, selection sort and insert…"}},{"before":"c35d1f36b88af0872581602cc28ebc1036e1632e","after":"953e5269d421c6a0a6f5c450d9a45ab316c52a00","ref":"refs/heads/main","pushedAt":"2024-05-16T00:31:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Implemeted recursive insert function for Binary Search Tree","shortMessageHtmlLink":"Implemeted recursive insert function for Binary Search Tree"}},{"before":"f28adb603cc90f950abe5621b0f07910f4148489","after":"c35d1f36b88af0872581602cc28ebc1036e1632e","ref":"refs/heads/main","pushedAt":"2024-05-15T00:44:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Implemeted recursive contains function for Binary Search Tree","shortMessageHtmlLink":"Implemeted recursive contains function for Binary Search Tree"}},{"before":"e64a73121e372e46d6413ed95f2a8231a489a73a","after":"f28adb603cc90f950abe5621b0f07910f4148489","ref":"refs/heads/main","pushedAt":"2024-04-25T03:14:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Graphs: Added all basic graph functionality","shortMessageHtmlLink":"Graphs: Added all basic graph functionality"}},{"before":"212b11fa42dce4b860d5cc67a81c772f0e29a3aa","after":"e64a73121e372e46d6413ed95f2a8231a489a73a","ref":"refs/heads/main","pushedAt":"2024-04-25T01:16:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Find duplicates in array, using unordered map (hashtable)","shortMessageHtmlLink":"Find duplicates in array, using unordered map (hashtable)"}},{"before":"d847ee571cd2dcc01373e90a6e68877c7aa8734d","after":"212b11fa42dce4b860d5cc67a81c772f0e29a3aa","ref":"refs/heads/main","pushedAt":"2024-04-12T01:50:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Implemented algorithm with hash table: Check if common items exists between two arrays","shortMessageHtmlLink":"Implemented algorithm with hash table: Check if common items exists b…"}},{"before":"0e15db259e7d6a4c1985e6f1a3e242ebcd2be648","after":"d847ee571cd2dcc01373e90a6e68877c7aa8734d","ref":"refs/heads/main","pushedAt":"2024-04-12T01:17:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Added documentation","shortMessageHtmlLink":"Added documentation"}},{"before":"789f71869e7bb1211d231451b31f6b808c397209","after":"0e15db259e7d6a4c1985e6f1a3e242ebcd2be648","ref":"refs/heads/main","pushedAt":"2024-04-12T01:05:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Hash Table: Added Keys method","shortMessageHtmlLink":"Hash Table: Added Keys method"}},{"before":"9cb7b4c5b807a91cec0aa43ba6d57ec91e7d3a3b","after":"789f71869e7bb1211d231451b31f6b808c397209","ref":"refs/heads/main","pushedAt":"2024-04-12T00:48:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"HashTable: Get and Set functions","shortMessageHtmlLink":"HashTable: Get and Set functions"}},{"before":"7535f467a5e02169f59c98cebaea6ef2266977ac","after":"9cb7b4c5b807a91cec0aa43ba6d57ec91e7d3a3b","ref":"refs/heads/main","pushedAt":"2024-04-11T02:47:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Hash table with hash function","shortMessageHtmlLink":"Hash table with hash function"}},{"before":"08f6ad2fb9b701152aedb630832a19df8ca774e3","after":"7535f467a5e02169f59c98cebaea6ef2266977ac","ref":"refs/heads/main","pushedAt":"2024-04-04T01:33:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Binary Search Tree contains method","shortMessageHtmlLink":"Binary Search Tree contains method"}},{"before":"2644779af5571c84c6e7aa713e8a17e788284a15","after":"08f6ad2fb9b701152aedb630832a19df8ca774e3","ref":"refs/heads/main","pushedAt":"2024-04-04T01:05:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Binary Search Tree with Insert method","shortMessageHtmlLink":"Binary Search Tree with Insert method"}},{"before":"8277743c686b4cc62a8ab4960b3586c3154e320e","after":"2644779af5571c84c6e7aa713e8a17e788284a15","ref":"refs/heads/main","pushedAt":"2024-03-23T00:04:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Added time complexity comments for stacks","shortMessageHtmlLink":"Added time complexity comments for stacks"}},{"before":"503a9cce6c109e5435df80002f89dc1c5d612522","after":"8277743c686b4cc62a8ab4960b3586c3154e320e","ref":"refs/heads/main","pushedAt":"2024-03-22T23:54:22.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Queue class with Enqueue and Dequeue methods","shortMessageHtmlLink":"Queue class with Enqueue and Dequeue methods"}},{"before":"bd0a7cd6b32211bf469f982224e63968789f07d3","after":"503a9cce6c109e5435df80002f89dc1c5d612522","ref":"refs/heads/main","pushedAt":"2024-03-22T22:55:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Stack class with push and pop methods","shortMessageHtmlLink":"Stack class with push and pop methods"}},{"before":"7465aa344cd05190ab7fdd3bcad4469f1344c100","after":"bd0a7cd6b32211bf469f982224e63968789f07d3","ref":"refs/heads/main","pushedAt":"2024-03-22T22:10:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Two leetcode exercises (DLL): Swap every two adjacent nodes and check if list is a palindrome","shortMessageHtmlLink":"Two leetcode exercises (DLL): Swap every two adjacent nodes and check…"}},{"before":"516ecbbc6a52f143add5584ab865ced4c2813d9c","after":"7465aa344cd05190ab7fdd3bcad4469f1344c100","ref":"refs/heads/main","pushedAt":"2024-03-22T01:01:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Two leetcode exercises (DLL): Reverse DLL list and spawn first and last elements.","shortMessageHtmlLink":"Two leetcode exercises (DLL): Reverse DLL list and spawn first and la…"}},{"before":"69526cbce9905a599dbe813aa4d3e947818d9228","after":"516ecbbc6a52f143add5584ab865ced4c2813d9c","ref":"refs/heads/main","pushedAt":"2024-03-21T00:32:09.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"DLL: Delete node at index","shortMessageHtmlLink":"DLL: Delete node at index"}},{"before":"0763e09ae1a848820d493bb8eef1de447af6a8f0","after":"69526cbce9905a599dbe813aa4d3e947818d9228","ref":"refs/heads/main","pushedAt":"2024-03-21T00:15:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"DLL: Insert and Set methods","shortMessageHtmlLink":"DLL: Insert and Set methods"}},{"before":"90f4f1885b36358cb4a8aa4f576770c09fd6b4ed","after":"0763e09ae1a848820d493bb8eef1de447af6a8f0","ref":"refs/heads/main","pushedAt":"2024-03-20T23:47:00.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"DLL: Optimized get method","shortMessageHtmlLink":"DLL: Optimized get method"}},{"before":"8e96a13cbaad3bcf917064d2f688c95da694feff","after":"90f4f1885b36358cb4a8aa4f576770c09fd6b4ed","ref":"refs/heads/main","pushedAt":"2024-03-20T22:39:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Doubly linked list class and some basic functions","shortMessageHtmlLink":"Doubly linked list class and some basic functions"}},{"before":"05b8e8552227990d29647f64149212c67aab6383","after":"8e96a13cbaad3bcf917064d2f688c95da694feff","ref":"refs/heads/main","pushedAt":"2024-03-20T22:38:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Leetcode exercise (LL): Reverse sublist between m and n","shortMessageHtmlLink":"Leetcode exercise (LL): Reverse sublist between m and n"}},{"before":"d80246b291435514ecd4c6079198588364aa3bde","after":"05b8e8552227990d29647f64149212c67aab6383","ref":"refs/heads/main","pushedAt":"2024-03-14T01:56:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Leetcode exercise (LL): Remove duplicates using std::unordered_set","shortMessageHtmlLink":"Leetcode exercise (LL): Remove duplicates using std::unordered_set"}},{"before":"8ac844b48beea5331297666851ba7161bf24fc97","after":"d80246b291435514ecd4c6079198588364aa3bde","ref":"refs/heads/main","pushedAt":"2024-03-14T00:43:00.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"No point in having getters and setters, only makes it harder to read","shortMessageHtmlLink":"No point in having getters and setters, only makes it harder to read"}},{"before":"9bf04a35a08d882b10fd52e7d6d139c451f7273a","after":"8ac844b48beea5331297666851ba7161bf24fc97","ref":"refs/heads/main","pushedAt":"2024-03-14T00:36:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Leetcode exercise (LL): Remove duplicates using runner pointer","shortMessageHtmlLink":"Leetcode exercise (LL): Remove duplicates using runner pointer"}},{"before":"ac7eb91047c9da64a076260cac97c3df5d7f18b3","after":"9bf04a35a08d882b10fd52e7d6d139c451f7273a","ref":"refs/heads/main","pushedAt":"2024-03-13T22:59:03.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Narsell","name":"Daniel Mateus","path":"/Narsell","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3138878?s=80&v=4"},"commit":{"message":"Leetcode exercise (LL): Partition LL around x","shortMessageHtmlLink":"Leetcode exercise (LL): Partition LL around x"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAET3TvZQA","startCursor":null,"endCursor":null}},"title":"Activity · Narsell/Data-Structures"}