{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":719959072,"defaultBranch":"main","name":"leetcodetopinterview150","ownerLogin":"altaha056","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-11-17T09:16:04.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/64250070?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1700212627.0","currentOid":""},"activityList":{"items":[{"before":"d88d9eb701cc298f5a780e6f045ca383b8b15f7d","after":"1d93fbaae10b9e408964209a39fc2dd11a611b02","ref":"refs/heads/main","pushedAt":"2024-04-30T01:36:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"34. Find First and Last Position of Element in Sorted Array.js","shortMessageHtmlLink":"34. Find First and Last Position of Element in Sorted Array.js"}},{"before":"9d660f477728cde2394f4357c19ac0ceb315f668","after":"d88d9eb701cc298f5a780e6f045ca383b8b15f7d","ref":"refs/heads/main","pushedAt":"2024-04-29T12:17:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"30. Substring with Concatenation of All Words.js","shortMessageHtmlLink":"30. Substring with Concatenation of All Words.js"}},{"before":"2d89a2d34b717e1281a9822c6a33297dd2f74979","after":"9d660f477728cde2394f4357c19ac0ceb315f668","ref":"refs/heads/main","pushedAt":"2024-04-21T06:54:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"114. Flatten Binary Tree to Linked List.js","shortMessageHtmlLink":"114. Flatten Binary Tree to Linked List.js"}},{"before":"d152fc7e1081beacce12400f72df53b5b7ba0807","after":"2d89a2d34b717e1281a9822c6a33297dd2f74979","ref":"refs/heads/main","pushedAt":"2024-04-19T12:06:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"153. Find Minimum in Rotated Sorted Array.js","shortMessageHtmlLink":"153. Find Minimum in Rotated Sorted Array.js"}},{"before":"63bd673991b79aed70f398037b6e4f7a3c6dce6f","after":"d152fc7e1081beacce12400f72df53b5b7ba0807","ref":"refs/heads/main","pushedAt":"2024-04-07T06:29:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"148. Sort List.js","shortMessageHtmlLink":"148. Sort List.js"}},{"before":"7e3671cb458a34a192b5e3eb0cd33e51e45b994e","after":"63bd673991b79aed70f398037b6e4f7a3c6dce6f","ref":"refs/heads/main","pushedAt":"2024-04-06T04:47:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"530. Minimum Absolute Difference in BST.js","shortMessageHtmlLink":"530. Minimum Absolute Difference in BST.js"}},{"before":"2fa19bb27ccc6999957bf3e0e0843e2be74ced98","after":"7e3671cb458a34a192b5e3eb0cd33e51e45b994e","ref":"refs/heads/main","pushedAt":"2024-04-05T03:21:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"236. Lowest Common Ancestor of a Binary Tree.js","shortMessageHtmlLink":"236. Lowest Common Ancestor of a Binary Tree.js"}},{"before":"475a12170d8ac06d4c95be73fdc9351b3e2dbdde","after":"2fa19bb27ccc6999957bf3e0e0843e2be74ced98","ref":"refs/heads/main","pushedAt":"2024-04-04T01:00:07.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"230. Kth Smallest Element in a BST.js","shortMessageHtmlLink":"230. Kth Smallest Element in a BST.js"}},{"before":"cc4b385a4b63aa4303661189808716a156cf6682","after":"475a12170d8ac06d4c95be73fdc9351b3e2dbdde","ref":"refs/heads/main","pushedAt":"2024-04-02T00:52:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"199. Binary Tree Right Side View.js","shortMessageHtmlLink":"199. Binary Tree Right Side View.js"}},{"before":"85b4bdd7581169d86e3b60f2a1e2939aa47b7f10","after":"cc4b385a4b63aa4303661189808716a156cf6682","ref":"refs/heads/main","pushedAt":"2024-04-01T07:47:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"98. Validate Binary Search Tree.js","shortMessageHtmlLink":"98. Validate Binary Search Tree.js"}},{"before":"d5095f3d6787275978f9cf3fb94a614a3d399ec1","after":"85b4bdd7581169d86e3b60f2a1e2939aa47b7f10","ref":"refs/heads/main","pushedAt":"2024-03-31T07:40:53.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"33. Search in Rotated Sorted Array.js","shortMessageHtmlLink":"33. Search in Rotated Sorted Array.js"}},{"before":"7808558ea9c4b272b623989db6f960d35e4fbd33","after":"d5095f3d6787275978f9cf3fb94a614a3d399ec1","ref":"refs/heads/main","pushedAt":"2024-03-30T05:26:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"108. Convert Sorted Array to Binary Search Tree.js","shortMessageHtmlLink":"108. Convert Sorted Array to Binary Search Tree.js"}},{"before":"83e093e38c4625cf45385e814d3d9d66e3b0e70c","after":"7808558ea9c4b272b623989db6f960d35e4fbd33","ref":"refs/heads/main","pushedAt":"2024-03-29T03:35:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"74. Search a 2D Matrix.js","shortMessageHtmlLink":"74. Search a 2D Matrix.js"}},{"before":"6736a58620b9aa6c60c5e4ee79ff8e1803b23798","after":"83e093e38c4625cf45385e814d3d9d66e3b0e70c","ref":"refs/heads/main","pushedAt":"2024-03-23T03:10:58.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"139. Word Break.js","shortMessageHtmlLink":"139. Word Break.js"}},{"before":"34a22b7fb7c7970e85eecae113a784bd2c017199","after":"6736a58620b9aa6c60c5e4ee79ff8e1803b23798","ref":"refs/heads/main","pushedAt":"2024-03-22T07:33:35.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"112. Path Sum.js","shortMessageHtmlLink":"112. Path Sum.js"}},{"before":"fe30c873d80bbeaf7556aa2cd92848aedae765d5","after":"34a22b7fb7c7970e85eecae113a784bd2c017199","ref":"refs/heads/main","pushedAt":"2024-03-21T08:50:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"103. Binary Tree Zigzag Level Order Traversal.js","shortMessageHtmlLink":"103. Binary Tree Zigzag Level Order Traversal.js"}},{"before":"8917e5caf12de532d9c3379bae6ccc0e78e68d01","after":"fe30c873d80bbeaf7556aa2cd92848aedae765d5","ref":"refs/heads/main","pushedAt":"2024-03-20T07:10:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"102","shortMessageHtmlLink":"102"}},{"before":"a45ee5d4a2b84aac6e3bf8422e0e1de0e187f02d","after":"8917e5caf12de532d9c3379bae6ccc0e78e68d01","ref":"refs/heads/main","pushedAt":"2024-03-19T01:20:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"71. Simplify Path.js","shortMessageHtmlLink":"71. Simplify Path.js"}},{"before":"a2d6e5ced859136c7e32bcded93785237b92fc7c","after":"a45ee5d4a2b84aac6e3bf8422e0e1de0e187f02d","ref":"refs/heads/main","pushedAt":"2024-03-18T08:29:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"35. Search Insert Position.js","shortMessageHtmlLink":"35. Search Insert Position.js"}},{"before":"0f2a457d982d443cf3c0dbf21f88bc175e7245ba","after":"a2d6e5ced859136c7e32bcded93785237b92fc7c","ref":"refs/heads/main","pushedAt":"2024-03-17T03:37:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"2. Add Two Numbers.js","shortMessageHtmlLink":"2. Add Two Numbers.js"}},{"before":"cfae19116ed849c365ed22646e55c8e282c62a55","after":"0f2a457d982d443cf3c0dbf21f88bc175e7245ba","ref":"refs/heads/main","pushedAt":"2024-03-16T02:29:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"637. Average of Levels in Binary Tree.js","shortMessageHtmlLink":"637. Average of Levels in Binary Tree.js"}},{"before":"18af2f666dbdefe9cd6ca675852ad8b202e484b5","after":"cfae19116ed849c365ed22646e55c8e282c62a55","ref":"refs/heads/main","pushedAt":"2024-02-04T04:22:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"452. Minimum Number of Arrows to Burst Balloons.js","shortMessageHtmlLink":"452. Minimum Number of Arrows to Burst Balloons.js"}},{"before":"ccd1b741a0363fe423df4aac53e4319e5e7d7692","after":"18af2f666dbdefe9cd6ca675852ad8b202e484b5","ref":"refs/heads/main","pushedAt":"2024-02-03T05:56:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"383. Ransom Note.js","shortMessageHtmlLink":"383. Ransom Note.js"}},{"before":"f1ffb4f6952b31593f14ad9c9f7662e01e302d4f","after":"ccd1b741a0363fe423df4aac53e4319e5e7d7692","ref":"refs/heads/main","pushedAt":"2024-01-28T01:47:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"290. Word Pattern.js","shortMessageHtmlLink":"290. Word Pattern.js"}},{"before":"9160bb19e65e6567f66624e159b5fd5d025d896b","after":"f1ffb4f6952b31593f14ad9c9f7662e01e302d4f","ref":"refs/heads/main","pushedAt":"2024-01-27T04:47:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"57. Insert Interval.js","shortMessageHtmlLink":"57. Insert Interval.js"}},{"before":"132e5ffdd36491d613c990166d2ce5364a9f004a","after":"9160bb19e65e6567f66624e159b5fd5d025d896b","ref":"refs/heads/main","pushedAt":"2024-01-26T01:32:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"918. Maximum Sum Circular Subarray.js","shortMessageHtmlLink":"918. Maximum Sum Circular Subarray.js"}},{"before":"5d5336bc8763fe4664ba942ffc046c6a2468fd3c","after":"132e5ffdd36491d613c990166d2ce5364a9f004a","ref":"refs/heads/main","pushedAt":"2024-01-25T01:41:07.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"56. Merge Intervals.js","shortMessageHtmlLink":"56. Merge Intervals.js"}},{"before":"c4b60120ea5813e6af2a1bc6710edb754c2bb6fd","after":"5d5336bc8763fe4664ba942ffc046c6a2468fd3c","ref":"refs/heads/main","pushedAt":"2024-01-24T01:46:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"242. Valid Anagram.js","shortMessageHtmlLink":"242. Valid Anagram.js"}},{"before":"f55a2bcb3148dfb867f15c8aa6eeb5fe54d1eefa","after":"c4b60120ea5813e6af2a1bc6710edb754c2bb6fd","ref":"refs/heads/main","pushedAt":"2024-01-23T01:19:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"228. Summary Ranges.js","shortMessageHtmlLink":"228. Summary Ranges.js"}},{"before":"69ccbf6c5777b6299e57575aef118555d9d67eeb","after":"f55a2bcb3148dfb867f15c8aa6eeb5fe54d1eefa","ref":"refs/heads/main","pushedAt":"2024-01-22T13:17:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"altaha056","name":"Altaha","path":"/altaha056","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/64250070?s=80&v=4"},"commit":{"message":"226. Invert Binary Tree.js","shortMessageHtmlLink":"226. Invert Binary Tree.js"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEPYdEegA","startCursor":null,"endCursor":null}},"title":"Activity · altaha056/leetcodetopinterview150"}