{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":666451735,"defaultBranch":"main","name":"gfg-POTD","ownerLogin":"risitadas","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-07-14T14:50:55.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/92712417?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1689346256.0","currentOid":""},"activityList":{"items":[{"before":"0ff3a61a3c5bd006a4cd5f111e07e7f8d8d0da38","after":"9bf663f7abe8d56c8358e3c74ecfe1a4f01d04d5","ref":"refs/heads/main","pushedAt":"2024-08-11T19:53:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"11 August 2024","shortMessageHtmlLink":"11 August 2024"}},{"before":"1faaad1e3123e18a867702256f5578ca5ee1de90","after":"0ff3a61a3c5bd006a4cd5f111e07e7f8d8d0da38","ref":"refs/heads/main","pushedAt":"2024-06-30T17:10:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"30 June 2024\n\nGiven a doubly Linked list and a position. The task is to delete a node from a given position (position starts from 1) in a doubly linked list and return the head of the doubly Linked list.\r\n\r\nExamples:\r\n\r\nInput: LinkedList = 1 <--> 3 <--> 4, x = 3\r\nOutput: 1 3  \r\nExplanation: \r\nAfter deleting the node at position 3 (position starts from 1),the linked list will be now as 1 <--> 3.\r\n \r\nInput: LinkedList = 1 <--> 5 <--> 2 <--> 9, x = 1\r\nOutput: 5 2 9\r\nExplanation:\r\n\r\nExpected Time Complexity: O(n)\r\nExpected Auxilliary Space: O(1)\r\n\r\nConstraints:\r\n2 <= size of the linked list(n) <= 10^5\r\n1 <= x <= n\r\n1 <= node.data <= 10^9","shortMessageHtmlLink":"30 June 2024"}},{"before":"1db8b63bf1c0a32aefee67fe06b68518f4f09840","after":"1faaad1e3123e18a867702256f5578ca5ee1de90","ref":"refs/heads/main","pushedAt":"2024-06-30T17:04:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"30 June 2024","shortMessageHtmlLink":"30 June 2024"}},{"before":"f3da0605f48d187e6dc05b58a3c35997166fa653","after":"1db8b63bf1c0a32aefee67fe06b68518f4f09840","ref":"refs/heads/main","pushedAt":"2024-06-30T17:03:29.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"30 June 2024","shortMessageHtmlLink":"30 June 2024"}},{"before":"2a77ecd8f1e54c1e725e5b6446d81b9bed9ca5d2","after":"f3da0605f48d187e6dc05b58a3c35997166fa653","ref":"refs/heads/main","pushedAt":"2024-06-30T17:02:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"30 June 2024","shortMessageHtmlLink":"30 June 2024"}},{"before":"f6f525fe57be11ce71420cd698492a09f341b2b7","after":"2a77ecd8f1e54c1e725e5b6446d81b9bed9ca5d2","ref":"refs/heads/main","pushedAt":"2024-06-30T17:01:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"30 June 2024","shortMessageHtmlLink":"30 June 2024"}},{"before":"a1a527038f4b279148419237c8860ca21268fb2d","after":"f6f525fe57be11ce71420cd698492a09f341b2b7","ref":"refs/heads/main","pushedAt":"2024-03-07T14:56:23.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"7 March 2024\n\nGiven a string s of length n, find the longest repeating non-overlapping substring in it. In other words find 2 identical substrings of maximum length which do not overlap. Return the longest non-overlapping substring. Return \"-1\" if no such string exists.\r\n\r\nNote: Multiple Answers are possible but you have to return the substring whose first occurrence is earlier.\r\n\r\nFor Example: \"abhihiab\", here both \"ab\" and \"hi\" are possible answers. But you will have to return \"ab\" because it's first occurrence appears before the first occurrence of \"hi\".\r\n\r\nExample 1:\r\n\r\nInput:\r\nn = 9\r\ns = \"acdcdacdc\"\r\nOutput:\r\n\"acdc\"\r\nExplanation:\r\nThe string \"acdc\" is the longest Substring of s which is repeating but not overlapping.\r\nExample 2:\r\n\r\nInput:\r\nn = 7\r\ns = \"heheheh\"\r\nOutput:\r\n\"heh\"\r\nExplanation:\r\nThe string \"heh\" is the longest Substring of s which is repeating but not overlapping.\r\nYour Task:\r\nYou don't need to read input or print anything. Your task is to complete the function longestSubstring() which takes an Integer n and a string s as input and returns the answer.\r\n\r\nExpected Time Complexity: O(n2)\r\nExpected Auxiliary Space: O(n2)\r\n\r\nConstraints:\r\n1 <= n <= 10^3","shortMessageHtmlLink":"7 March 2024"}},{"before":"06deff33a0f428cbff031f301848b6bff6073aff","after":"a1a527038f4b279148419237c8860ca21268fb2d","ref":"refs/heads/main","pushedAt":"2024-03-06T16:44:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"4 March 2024\n\nGiven an array arr of n positive integers. The task is to swap every ith element of the array with (i+2)th element.\r\n\r\nExample 1:\r\n\r\nInput:\r\nn = 3\r\narr[] = 1 2 3\r\nOutput:\r\n3 2 1\r\nExplanation:\r\nSwapping 1 and 3, makes the array 3 2 1. There is only one swap possible in this array.\r\nExample 2:\r\n\r\nInput:\r\nn = 5\r\narr[] = 1 2 3 4 5\r\nOutput:\r\n3 4 5 2 1\r\nExplanation:\r\nSwapping 1 and 3, makes the array 3 2 1 4 5.\r\nNow, swapping 2 and 4, makes the array 3 4 1 2 5. \r\nAgain,swapping 1 and 5, makes the array 3 4 5 2 1.\r\nYour Task:\r\nYour task is to complete the function swapElements(), which should swap each ith element with (i+2)th element.\r\n\r\nExpected Time Complexity: O(n)\r\nExpected Auxilary Space: O(1)\r\n\r\nConstraints:\r\n1 <= n <= 10^6\r\n0 <= arri <= 10^9","shortMessageHtmlLink":"4 March 2024"}},{"before":"17265b60b9ba184fc08596b8fd77a46b7584511e","after":"06deff33a0f428cbff031f301848b6bff6073aff","ref":"refs/heads/main","pushedAt":"2024-03-06T16:42:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"6 March 2024\n\nGiven two strings, one is a text string and other is a pattern string. The task is to print the indexes of all the occurences of pattern string in the text string. For printing, Starting Index of a string should be taken as 1. The strings will only contain lowercase English alphabets ('a' to 'z').\r\n\r\nExample 1:\r\n\r\nInput: \r\ntext = \"birthdayboy\"\r\npattern = \"birth\"\r\nOutput: \r\n[1]\r\nExplanation: \r\nThe string \"birth\" occurs at index 1 in text.\r\nExample 2:\r\n\r\nInput:\r\ntext = \"geeksforgeeks\"\r\npattern = \"geek\"\r\nOutput: \r\n[1, 9]\r\nExplanation: \r\nThe string \"geek\" occurs twice in text, one starts are index 1 and the other at index 9.\r\nYour Task:\r\nYou don't need to read input or print anything. Your task is to complete the function search() which takes the string text and the string pattern as input and returns an array denoting the start indices (1-based) of substring pattern in the string text. \r\n\r\nExpected Time Complexity: O(|text| + |pattern|).\r\nExpected Auxiliary Space: O(1).\r\n\r\nConstraints:\r\n1<=|text|<=5*10^5\r\n1<=|pattern|<=|text|","shortMessageHtmlLink":"6 March 2024"}},{"before":"c927d9e47d3a5abd6ddebd21b8840a88c5584c6b","after":"17265b60b9ba184fc08596b8fd77a46b7584511e","ref":"refs/heads/main","pushedAt":"2024-02-29T18:15:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"29 February 2024\n\nGiven an array integers arr[], containing n elements, find the sum of bit differences between all pairs of element in the array. Bit difference of a pair (x, y) is the count of different bits at the same positions in binary representations of x and y.\r\nFor example, bit difference for 2 and 7 is 2. Binary representation of 2 is 010 and 7 is 111 respectively and the first and last bits differ between the two numbers.\r\n\r\nNote: (x, y) and (y, x) are considered two separate pairs.\r\n\r\nExample 1:\r\n\r\nInput: \r\nn = 2\r\narr[] = {1, 2}\r\nOutput: 4\r\nExplanation: All possible pairs of an array are (1, 1), (1, 2), (2, 1), (2, 2).\r\nSum of bit differences = 0 + 2 + 2 + 0\r\n                       = 4\r\nExample 2:\r\n\r\nInput:\r\nn = 3 \r\narr[] = {1, 3, 5}\r\nOutput: 8\r\nExplanation: \r\nAll possible pairs of an array are (1, 1), (1, 3), (1, 5), (3, 1), (3, 3) (3, 5),(5, 1), (5, 3), (5, 5).\r\nSum of bit differences = 0 + 1 + 1 + 1 + 0 + 2 + 1 + 2 + 0 \r\n                       = 8\r\nYour Task:  \r\nYou don't need to read input or print anything. Your task is to complete the function sumBitDifferences() which takes the array arr[] and n as inputs and return an integer that represents the sum of the bit differences between all possible pairs of elements in the array.\r\n\r\nExpected Time Complexity: O(n).\r\nExpected Auxiliary Space: O(1).\r\n\r\nConstraints:\r\n1 <= n <= 10^5\r\n1 <= arr[i] <= 10^5","shortMessageHtmlLink":"29 February 2024"}},{"before":"387aa887154f9394c5f60d5522f775b228c28987","after":"c927d9e47d3a5abd6ddebd21b8840a88c5584c6b","ref":"refs/heads/main","pushedAt":"2024-02-29T18:14:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"28 February 2024\n\nGiven a string representation of a decimal number s, check whether it is divisible by 8.\r\n\r\nExample 1:\r\n\r\nInput:\r\ns = \"16\"\r\nOutput:\r\n1\r\nExplanation:\r\nThe given number is divisible by 8,\r\nso the driver code prints 1 as the output.\r\nExample 2:\r\n\r\nInput:\r\ns = \"54141111648421214584416464555\"\r\nOutput:\r\n-1\r\nExplanation:\r\nGiven Number is not divisible by 8, \r\nso the driver code prints -1 as the output.\r\nYour Task:\r\nYou don't need to read input or print anything.Your task is to complete the function DivisibleByEight() which takes a string s as the input and returns 1 if the number is divisible by 8, else it returns -1.\r\n\r\nExpected Time Complexity: O(1).\r\nExpected Auxillary Space: O(1).\r\n\r\nConstraints:\r\n1 <= |s| <= 10^6","shortMessageHtmlLink":"28 February 2024"}},{"before":"7a4de1d926db9937926c94fe5d1d9c0cc493b7e7","after":"387aa887154f9394c5f60d5522f775b228c28987","ref":"refs/heads/main","pushedAt":"2024-02-29T18:13:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"NOT DONE 27 February 2024\n\nYou are given an array arr[] of length n, you have to re-construct the same array arr[] in-place. The arr[i] after reconstruction will become arr[i] OR arr[i+1], where OR is bitwise or. If for some i, i+1 does not exists, then do not change arr[i].\r\n\r\nExample 1:\r\n\r\nInput :\r\nn = 5\r\narr[] = {10, 11, 1, 2, 3}\r\nOutput :\r\n11 11 3 3 3\r\nExplanation:\r\nAt index 0, arr[0] or arr[1] = 11\r\nAt index 1, arr[1] or arr[2] = 11\r\nAt index 2, arr[2] or arr[3] = 3\r\n...\r\nAt index 4, No element is left So, it will remain as it is.\r\nNew Array will be {11, 11, 3, 3, 3}.\r\nExample 2:\r\n\r\nInput :\r\nn= 4\r\narr[] = {5, 9, 2, 6} \r\nOutput :\r\n13 11 6 6\r\nExplanation:\r\nAt index 0, arr[0] or arr[1] = 13.\r\nAt index 1, arr[1] or arr[2] = 11.\r\nAt index 2, arr[2] or arr[3] = 6.\r\nAt index 3, No element is left So, it will remain as it is.\r\nNew Array will be {13, 11, 6, 6}.\r\nYour Task:\r\nYou are required to implement the function game_with_number(), which takes an array arr, representing values at each index, and the size of the array n. The function should modify the elements of the same array arr[] in-place by replacing them with the values obtained by performing the bitwise OR operation on consecutive elements.\r\n\r\nExpected Time Complexity: O(n).\r\nExpected Auxiliary Space: O(1).\r\n\r\nConstraints:\r\n1 ≤ n ≤ 10^5\r\n1 ≤ arr[i] ≤ 10^7","shortMessageHtmlLink":"NOT DONE 27 February 2024"}},{"before":"6b9f46a56beb9033c017ba2a57bfb95d434c1c8c","after":"7a4de1d926db9937926c94fe5d1d9c0cc493b7e7","ref":"refs/heads/main","pushedAt":"2024-02-26T15:31:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"20 February 2024\n\nGiven a string s and a dictionary of n words dictionary, find out if \"s\" can be segmented into a space-separated sequence of dictionary words.\r\nReturn 1 if it is possible to break the s into a sequence of dictionary words, else return 0. \r\n\r\nNote: From the dictionary dictionary each word can be taken any number of times and in any order.\r\n\r\nExample 1:\r\n\r\nInput:\r\nn = 6\r\ns = \"ilike\"\r\ndictionary = { \"i\", \"like\", \"sam\", \"sung\", \"samsung\", \"mobile\"}\r\nOutput:\r\n1\r\nExplanation:\r\nThe string can be segmented as \"i like\".\r\nExample 2:\r\n\r\nInput:\r\nn = 6\r\ns = \"ilikesamsung\"\r\ndictionary = { \"i\", \"like\", \"sam\", \"sung\", \"samsung\", \"mobile\"}\r\nOutput:\r\n1\r\nExplanation:\r\nThe string can be segmented as \r\n\"i like samsung\" or \"i like sam sung\".\r\nYour Task:\r\nComplete wordBreak() function which takes a string and list of strings as a parameter and returns 1 if it is possible to break words, else returns 0. You don't need to read any input or print any output, it is done by driver code.\r\n\r\nExpected Time Complexity: O(len(s)2)\r\nExpected Space Complexity: O(len(s))\r\n\r\nConstraints:\r\n1 ≤ n ≤ 12\r\n1 ≤ len(s) ≤ 1100","shortMessageHtmlLink":"20 February 2024"}},{"before":"04e14a83981d71c3552d5a4d52b657824e4d73a9","after":"6b9f46a56beb9033c017ba2a57bfb95d434c1c8c","ref":"refs/heads/main","pushedAt":"2024-02-26T15:30:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"NOT DONE 21 February 2024\n\nGiven a boolean expression s of length n with following symbols.\r\nSymbols\r\n    'T' ---> true\r\n    'F' ---> false\r\nand following operators filled between symbols\r\nOperators\r\n    &   ---> boolean AND\r\n    |   ---> boolean OR\r\n    ^   ---> boolean XOR\r\nCount the number of ways we can parenthesize the expression so that the value of expression evaluates to true.\r\n\r\nNote: The answer can be large, so return it with modulo 1003\r\n\r\nExample 1:\r\n\r\nInput: \r\nn = 7\r\ns = T|T&F^T\r\nOutput: \r\n4\r\nExplaination: \r\nThe expression evaluates to true in 4 ways ((T|T)&(F^T)), (T|(T&(F^T))), (((T|T)&F)^T) and (T|((T&F)^T)).\r\nExample 2:\r\n\r\nInput: \r\nn = 5\r\ns = T^F|F\r\nOutput: \r\n2\r\nExplaination: \r\n((T^F)|F) and (T^(F|F)) are the only ways.\r\nYour Task:\r\nYou do not need to read input or print anything. Your task is to complete the function countWays() which takes n and s as input parameters and returns number of possible ways modulo 1003.\r\n\r\nExpected Time Complexity: O(n^3)\r\nExpected Auxiliary Space: O(n^2)\r\n\r\nConstraints:\r\n1 ≤ n ≤ 200","shortMessageHtmlLink":"NOT DONE 21 February 2024"}},{"before":"13cbdcce10d52d08c54a8b3219d80999d24cc251","after":"04e14a83981d71c3552d5a4d52b657824e4d73a9","ref":"refs/heads/main","pushedAt":"2024-02-26T15:28:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"22 February 2024\n\nGiven two strings s and t of length n and m respectively. Find the count of distinct occurrences of t in s as a sub-sequence modulo 109 + 7.\r\n\r\nExample 1:\r\n\r\nInput:\r\ns = \"banana\" , t = \"ban\"\r\nOutput: \r\n3\r\nExplanation: \r\nThere are 3 sub-sequences:[ban], [ba n], [b an].\r\nExample 2:\r\n\r\nInput:\r\ns = \"geeksforgeeks\" , t = \"ge\"\r\nOutput: \r\n6\r\nExplanation: \r\nThere are 6 sub-sequences:[ge], [ge], [g e], [g e] [g e] and [g e].\r\nYour Task:\r\nYou don't need to read input or print anything.Your task is to complete the function subsequenceCount() which takes two strings as argument s and t and returns the count of the sub-sequences modulo 109 + 7.\r\n\r\nExpected Time Complexity: O(n*m).\r\nExpected Auxiliary Space: O(n*m).\r\n\r\nConstraints:\r\n1 ≤ n,m ≤ 1000","shortMessageHtmlLink":"22 February 2024"}},{"before":"781923b641734788344b9049a65843d69fdc5ec8","after":"13cbdcce10d52d08c54a8b3219d80999d24cc251","ref":"refs/heads/main","pushedAt":"2024-02-26T15:24:27.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"23 February 2024\n\nIn daily share trading, a buyer buys shares in the morning and sells them on the same day. If the trader is allowed to make at most 2 transactions in a day, the second transaction can only start after the first one is complete (buy->sell->buy->sell). The stock prices throughout the day are represented in the form of an array of prices. \r\n\r\nGiven an array price of size n, find out the maximum profit that a share trader could have made.\r\n\r\nExample 1:\r\n\r\nInput:\r\nn = 6\r\nprices[] = {10,22,5,75,65,80}\r\nOutput:\r\n87\r\nExplanation:\r\nTrader earns 87 as sum of 12, 75 Buy at 10, sell at 22, Buy at 5 and sell at 80.\r\nExample 2:\r\n\r\nInput:\r\nn = 7\r\nprices[] = {2,30,15,10,8,25,80}\r\nOutput:\r\n100\r\nExplanation:\r\nTrader earns 100 as sum of 28 and 72 Buy at price 2, sell at 30, Buy at 8 and sell at 80,\r\nYour Task:\r\n\r\nComplete the function maxProfit() which takes an integer array price as the only argument and returns an integer, representing the maximum profit, if only two transactions are allowed.\r\n\r\nExpected Time Complexity: O(n)\r\nExpected Space Complexity: O(n)\r\n\r\nConstraints:\r\n\r\n1 <= n <= 10^5\r\n1 <= price[i] <= 10^5","shortMessageHtmlLink":"23 February 2024"}},{"before":"56f2221d52223e26bf213e9da61d9cc0879f015a","after":"781923b641734788344b9049a65843d69fdc5ec8","ref":"refs/heads/main","pushedAt":"2024-02-26T15:21:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"24 February 2024\n\nA number n can be broken into three parts n/2, n/3, and n/4 (consider only the integer part). Each number obtained in this process can be divided further recursively. Find the maximum sum that can be obtained by summing up the divided parts together.\r\nNote: It is possible that we don't divide the number at all.\r\n\r\nExample 1:\r\n\r\nInput:\r\nn = 12\r\nOutput: \r\n13\r\nExplanation: \r\nBreak n = 12 in three parts {12/2, 12/3, 12/4} = {6, 4, 3}, now current sum is = (6 + 4 + 3) = 13. Further breaking 6, 4 and 3 into parts will produce sum less than or equal to 6, 4 and 3 respectively.\r\nExample 2:\r\n\r\nInput:\r\nn = 24\r\nOutput: \r\n27\r\nExplanation: \r\nBreak n = 24 in three parts {24/2, 24/3, 24/4} = {12, 8, 6}, now current sum is = (12 + 8 + 6) = 26 . But recursively breaking 12 would produce value 13. So our maximum sum is 13 + 8 + 6 = 27.\r\nYour Task:\r\nYou don't need to read input or print anything. Your task is to complete the function maxSum() which accepts an integer n and returns the maximum sum.\r\n\r\nExpected Time Complexity: O(n)\r\nExpected Auxiliary Space: O(n)\r\n\r\nConstraints:\r\n0 <= n <= 10^6","shortMessageHtmlLink":"24 February 2024"}},{"before":"12f802e4e8c901354f2f933e2fe1c320317b62fa","after":"56f2221d52223e26bf213e9da61d9cc0879f015a","ref":"refs/heads/main","pushedAt":"2024-02-26T15:20:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"25 February 2024\n\nConsider a game where a player can score 3 or 5 or 10 points in a move. Given a total score n, find number of distinct combinations to reach the given score.\r\n\r\nExample 1:\r\n\r\nInput\r\nn = 10\r\nOutput\r\n2\r\nExplanation\r\nThere are two ways {5,5} and {10}.\r\nExample 2:\r\n\r\nInput\r\nn = 20\r\nOutput\r\n4\r\nExplanation\r\nThere are four possible ways. {5,5,5,5}, {3,3,3,3,3,5}, {10,10}, {5,5,10}.\r\nYour Task:  \r\nYou don't need to read input or print anything. Your task is to complete the function count( ) which takes n as input parameter and returns the answer to the problem.\r\n\r\nExpected Time Complexity: O(n)\r\nExpected Auxiliary Space: O(n)\r\n\r\nConstraints:\r\n\r\n1 ≤ n ≤ 10^6","shortMessageHtmlLink":"25 February 2024"}},{"before":"cc6f7afec720f04fdf4d911c56ea51fbaf2d1a9a","after":"12f802e4e8c901354f2f933e2fe1c320317b62fa","ref":"refs/heads/main","pushedAt":"2024-02-26T15:19:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"26 February 2024\n\nGiven a string s of length n, find all the possible subsequences of the string s in lexicographically-sorted order.\r\n\r\nExample 1:\r\n\r\nInput : \r\ns = \"abc\"\r\nOutput: \r\na ab abc ac b bc c\r\nExplanation : \r\nThere are a total 7 number of subsequences possible \r\nfor the given string, and they are mentioned above \r\nin lexicographically sorted order.\r\nExample 2:\r\n\r\nInput: \r\ns = \"aa\"\r\nOutput: \r\na a aa\r\nExplanation : \r\nThere are a total 3 number of subsequences possible \r\nfor the given string, and they are mentioned above \r\nin lexicographically sorted order.\r\nYour Task:\r\nYou don't need to read input or print anything. Your task is to complete the function AllPossibleStrings() which takes a string s as the input parameter and returns a list of all possible subsequences (non-empty) that can be formed from s in lexicographically-sorted order.\r\n\r\nExpected Time Complexity: O( n*2n  )\r\nExpected Space Complexity: O( n * 2n )\r\n\r\nConstraints: \r\n1 <= n <= 16\r\ns will constitute of lower case english alphabets","shortMessageHtmlLink":"26 February 2024"}},{"before":"700cf954bed00cd3766f77958fc63c8b533f4e1d","after":"cc6f7afec720f04fdf4d911c56ea51fbaf2d1a9a","ref":"refs/heads/main","pushedAt":"2024-02-13T14:37:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"13 February 2024\n\nGiven a connected undirected graph with n nodes and m edges, with each node having a distinct label from 0 to n-1, create a clone of the graph. Each node in the graph contains an integer val and an array (neighbors) of nodes, containing nodes that are adjacent to the current node.\r\n\r\nNote: If the user returns a correct copy of the given graph, then the system will print 1; in the case when an incorrect copy is generated or when the user returns the original node, the system will print 0.\r\n\r\nFor Example :    \r\n\r\nclass Node {\r\n    val: integer\r\n    neighbors: List[Node]\r\n}\r\nExample 1:\r\n\r\nInput:\r\nadjList = \r\n{\r\n    {1, 3},\r\n    {0, 2},\r\n    {1, 3},\r\n    {0, 2}\r\n}\r\nOutput: 1\r\nExplanation:\r\n1 is the output that the driver code will print in case \r\nyou successfully cloned the given graph.\r\nExample 2:\r\n\r\nInput:\r\nadjList = \r\n{\r\n    {1},\r\n    {0}\r\n}\r\nOutput: 1\r\nExplanation: \r\n1 is the output that the driver code will print in case\r\nyou successfully cloned the given graph.\r\nYour Task:\r\nYou don't need to read input or print anything. Your task is to complete the function cloneGraph( ) which takes a node will always be the first node of the graph as input and returns the copy of the given node as a reference to the cloned graph.\r\n\r\nExpected Time Complexity: O(n + m).\r\nExpected Auxiliary Space: O(n).\r\n\r\nConstraints:\r\n1 <= n, m <= 10^4\r\n1 <= Node value <= n","shortMessageHtmlLink":"13 February 2024"}},{"before":"b30324578d0019d42694c80335a28f21c106da99","after":"700cf954bed00cd3766f77958fc63c8b533f4e1d","ref":"refs/heads/main","pushedAt":"2024-02-13T14:37:00.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"12 February 2024\n\nA function F is defined as follows F(n)= (1) +(2*3) + (4*5*6) ... upto n terms (look at the examples for better clarity). Given an integer n, determine the F(n).\r\n\r\nNote: As the answer can be very large, return the answer modulo 109+7.\r\n\r\nExample 1:\r\n\r\nInput: n = 5\r\nOutput: 365527\r\nExplanation: \r\nF(5) = 1 + 2*3 + 4*5*6 + 7*8*9*10 + 11*12*13*14*15 = 365527.\r\nExample 2:\r\n\r\nInput: n = 7\r\nOutput: 6006997207\r\nExplanation: \r\nF(7) = 1 + 2*3 + 4*5*6 + 7*8*9*10 + 11*12*13*14*15 + \r\n16*17*18*19*20*21 + 22*23*24*25*26*27*28 = 6006997207.\r\n6006997207 % 109+7 = 6997165\r\nYour Task:\r\nYou do not need to read input or print anything. Your task is to complete the function sequence() which takes an integer n as an input parameter and returns the value of F(n).\r\n\r\nExpected Time Complexity: O(n2)\r\nExpected Space Complexity: O(1)\r\n\r\nConstraints:\r\n1 ≤ n ≤ 10^3","shortMessageHtmlLink":"12 February 2024"}},{"before":"20df561c5c9132428daf5c0640eb98e05fde3f1d","after":"b30324578d0019d42694c80335a28f21c106da99","ref":"refs/heads/main","pushedAt":"2024-02-11T14:43:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"10 February 2024\n\nGiven a n x n matrix such that each of its cells contains some coins. Count the number of ways to collect exactly k coins while moving from top left corner of the matrix to the bottom right. From a cell (i, j), you can only move to (i+1, j) or (i, j+1).\r\n\r\nExample 1:\r\n\r\nInput:\r\nk = 12, n = 3\r\narr[] = [[1, 2, 3], \r\n       [4, 6, 5], \r\n       [3, 2, 1]]\r\nOutput: \r\n2\r\nExplanation: \r\nThere are 2 possible paths with exactly 12 coins, (1 + 2 + 6 + 2 + 1) and (1 + 2 + 3 + 5 + 1).\r\nExample 2:\r\n\r\nInput:\r\nk = 16, n = 3\r\narr[] = [[1, 2, 3], \r\n       [4, 6, 5], \r\n       [9, 8, 7]]\r\nOutput: \r\n0 \r\nExplanation: \r\nThere are no possible paths that lead to sum=16\r\nYour Task:  \r\nYou don't need to read input or print anything. Your task is to complete the function numberOfPath() which takes n, k and 2D matrix arr[][] as input parameters and returns the number of possible paths.\r\n\r\nExpected Time Complexity: O(n*n*k)\r\nExpected Auxiliary Space: O(n*n*k)\r\n\r\nConstraints:\r\n\r\n1 <= k < 100\r\n1 <= n < 100\r\n0 <= arrij <= 200","shortMessageHtmlLink":"10 February 2024"}},{"before":"e1f66e16c915c931a87c1165b2b33db2482e1136","after":"20df561c5c9132428daf5c0640eb98e05fde3f1d","ref":"refs/heads/main","pushedAt":"2024-02-11T14:42:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"11 February 2024\n\nGiven an integer n, return the first n elements of Recaman’s sequence.\r\nIt is a function with domain and co-domain as whole numbers. It is recursively defined as below:\r\nSpecifically, let a(n) denote the (n+1)th term. (0 being the 1st term).\r\nThe rule says:\r\na(0) = 0\r\na(n) = a(n-1) - n, if a(n-1) - n > 0 and is not included in the sequence previously\r\n       =  a(n-1) + n otherwise.\r\n\r\nExample 1:\r\n\r\nInput: \r\nn = 5\r\nOutput: \r\n0 1 3 6 2\r\nExplaination: \r\na(0) = 0,\r\na(1) = a(0)-1 = 0-1 = -1 and -1<0, therefore a(1) = a(0)+1 = 1,\r\na(2) = a(1)-2 = 1-2 = -1 and -1<0, therefore a(2) = a(1)+2 = 3,\r\na(3) = a(2)-3 = 3-3 = 0 but since 0 is already present in the sequence, a(3) = a(2)+3 = 3+3 = 6,\r\na(4) = a(3)-4 = 6-4 = 2.\r\nTherefore the first 5 elements of Recaman's sequence will be 0 1 3 6 2.\r\nExample 2:\r\n\r\nInput: \r\nn = 3\r\nOutput: \r\n0 1 3\r\nExplaination: \r\nAs seen in example 1, the first three elements will be 0 1 3.\r\nYour Task:\r\nYou do not need to read input or print anything. Your task is to complete the function recamanSequence() which takes n as the input parameter and returns the sequence.\r\n\r\nExpected Time Complexity: O(n)\r\nExpected Auxiliary Space: O(n)\r\n\r\nConstraints:\r\n1 ≤ n ≤ 10^5","shortMessageHtmlLink":"11 February 2024"}},{"before":"f1cd1e4ae97c001699aadcf874a79d1ec4489984","after":"e1f66e16c915c931a87c1165b2b33db2482e1136","ref":"refs/heads/main","pushedAt":"2024-02-09T15:34:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"6 February 2024\n\nGiven a binary tree with n nodes and a non-negative integer k, the task is to count the number of special nodes.\r\nA node is considered special if there exists at least one leaf in its subtree such that the distance between the node and leaf is exactly k.\r\n\r\nNote: Any such node should be counted only once. For example, if a node is at a distance k from 2 or more leaf nodes, then it would add only 1 to our count.\r\n\r\nExample 1:\r\n\r\nInput:\r\nBinary tree\r\n        1\r\n      /   \\\r\n     2     3\r\n   /  \\   /  \\\r\n  4   5  6    7\r\n          \\ \r\n          8\r\nk = 2\r\nOutput: \r\n2\r\nExplanation: \r\nThere are only two unique nodes that are at a distance of 2 units from the leaf node. (node 3 for leaf with value 8 and node 1 for leaves with values 4, 5 and 7) Note that node 2 isn't considered for leaf with value 8 because it isn't a direct ancestor of node 8.\r\nExample 2:\r\n\r\nInput:\r\nBinary tree\r\n          1\r\n         /\r\n        3\r\n       /\r\n      5\r\n    /  \\\r\n   7    8\r\n         \\\r\n          9\r\nk = 4\r\nOutput: \r\n1\r\nExplanation: \r\nOnly one node is there which is at a distance of 4 units from the leaf node.(node 1 for leaf with value 9) \r\nYour Task:\r\nYou don't have to read input or print anything. Complete the function printKDistantfromLeaf() that takes root node and k as inputs and returns the number of nodes that are at distance k from a leaf node. \r\n\r\nExpected Time Complexity: O(n).\r\nExpected Auxiliary Space: O(Height of the Tree).\r\n\r\nConstraints:\r\n1 <= n <= 10^5","shortMessageHtmlLink":"6 February 2024"}},{"before":"cd7f77cfb7ff1a5441714bfa9aad7a50086b10a6","after":"f1cd1e4ae97c001699aadcf874a79d1ec4489984","ref":"refs/heads/main","pushedAt":"2024-02-09T15:30:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"7 February 2024\n\nGiven a binary tree with n nodes and two node values, a and b, your task is to find the minimum distance between them. The given two nodes are guaranteed to be in the binary tree and all node values are unique.\r\n\r\nExample 1:\r\n\r\nInput:\r\n        1\r\n      /  \\\r\n     2    3\r\na = 2, b = 3\r\nOutput: \r\n2\r\nExplanation: \r\nWe need the distance between 2 and 3. Being at node 2, we need to take two steps ahead in order to reach node 3. The path followed will be: 2 -> 1 -> 3. Hence, the result is 2. \r\nExample 2:\r\n\r\nInput:\r\n        11\r\n      /   \\\r\n     22  33\r\n    /  \\  /  \\\r\n  44 55 66 77\r\na = 77, b = 22\r\nOutput: \r\n3\r\nExplanation: \r\nWe need the distance between 77 and 22. Being at node 77, we need to take three steps ahead in order to reach node 22. The path followed will be: 77 -> 33 -> 11 -> 22. Hence, the result is 3.\r\nYour Task:\r\nYou don't need to read input or print anything. Your task is to complete the function findDist() which takes the root node of the tree and the two node values a and b as input parameters and returns the minimum distance between the nodes represented by the two given node values.\r\n\r\nExpected Time Complexity: O(n).\r\nExpected Auxiliary Space: O(Height of the Tree).\r\n\r\nConstraints:\r\n2 <= n <= 10^5\r\n0 <= Data of a node <= 10^9","shortMessageHtmlLink":"7 February 2024"}},{"before":"928e994fa3b6ce696ec3ac9e8a859fa7be0b9e6d","after":"cd7f77cfb7ff1a5441714bfa9aad7a50086b10a6","ref":"refs/heads/main","pushedAt":"2024-02-09T15:21:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"8 February 2024\n\nGiven a binary tree with n nodes, determine whether all the leaf nodes are at the same level or not. Return true if all leaf nodes are at the same level, and false otherwise.\r\n\r\nExample 1:\r\n\r\nInput:\r\nTree:\r\n    1\r\n   / \\\r\n  2   3\r\nOutput:\r\ntrue\r\nExplanation:\r\nThe binary tree has a height of 2 and the leaves are at the same level.\r\nExample 2:\r\n\r\nInput:\r\nTree:\r\n    10\r\n   /  \\\r\n 20   30\r\n /  \\\r\n 10   15\r\nOutput:\r\nfalse\r\nExplanation:\r\nThe binary tree has a height of 3 and the leaves are not at the same level.\r\nExpected Time Complexity: O(n)\r\nExpected Auxiliary Space: O(height of tree)\r\n\r\nYour Task:\r\nImplement the function check() that checks whether all the leaf nodes in the given binary tree are at the same level or not. The function takes the root node of the tree as an input and should return a boolean value (true/false) based on the condition.\r\n\r\nConstraints:\r\n1 ≤ n ≤ 10^5","shortMessageHtmlLink":"8 February 2024"}},{"before":"48d1fb178e4f2ccb1eeba46a50881fd1bc566c7a","after":"928e994fa3b6ce696ec3ac9e8a859fa7be0b9e6d","ref":"refs/heads/main","pushedAt":"2024-02-09T15:00:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"9 February 2024\n\nGiven a binary tree having n nodes. Check whether all of its nodes have the value equal to the sum of their child nodes. Return 1 if all the nodes in the tree satisfy the given properties, else it return 0.\r\n\r\nFor every node, data value must be equal to the sum of data values in left and right children. Consider data value as 0 for NULL child.  Also, leaves are considered to follow the property.\r\n\r\nExample 1:\r\n\r\nInput:\r\nBinary tree\r\n       35\r\n      /   \\\r\n     20  15\r\n    /  \\  /  \\\r\n   15 5 10 5\r\nOutput: \r\n1\r\nExplanation: \r\nHere, every node is sum of its left and right child.\r\nExample 2:\r\n\r\nInput:\r\nBinary tree\r\n       1\r\n     /   \\\r\n    4    3\r\n   /  \r\n  5    \r\nOutput: \r\n0\r\nExplanation: \r\nHere, 1 is the root node and 4, 3 are its child nodes. 4 + 3 = 7 which is not equal to the value of root node. Hence, this tree does not satisfy the given condition.\r\nYour Task:\r\nYou don't need to read input or print anything. Your task is to complete the function isSumProperty() that takes the root Node of the binary tree as input and returns 1 if all the nodes in the tree satisfy the following properties, else it returns 0.\r\n\r\nExpected Time Complexiy: O(n).\r\nExpected Auxiliary Space: O(Height of the Tree).\r\n\r\nConstraints:\r\n1 <= n <= 10^5\r\n1 <= Data on nodes <= 10^5","shortMessageHtmlLink":"9 February 2024"}},{"before":"c231b4f5bac553b69004b4a9d00a41c95af23435","after":"48d1fb178e4f2ccb1eeba46a50881fd1bc566c7a","ref":"refs/heads/main","pushedAt":"2024-02-05T14:01:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"5 February 2024\n\nGiven a sorted circular linked list of length n, the task is to insert a new node in this circular list so that it remains a sorted circular linked list.\r\n\r\nExample 1:\r\n\r\nInput:\r\nn = 3\r\nLinkedList = 1->2->4\r\n(the first and last node is connected, i.e. 4 --> 1)\r\ndata = 2\r\nOutput: \r\n1 2 2 4\r\nExplanation:\r\nWe can add 2 after the second node.\r\nExample 2:\r\n\r\nInput:\r\nn = 4\r\nLinkedList = 1->4->7->9\r\n(the first and last node is connected, i.e. 9 --> 1)\r\ndata = 5\r\nOutput: \r\n1 4 5 7 9\r\nExplanation:\r\nWe can add 5 after the second node.\r\nYour Task:\r\nThe task is to complete the function sortedInsert() which should insert the new node into the given circular linked list and return the head of the linked list.\r\n\r\nExpected Time Complexity: O(n)\r\nExpected Auxiliary Space: O(1)\r\n\r\nConstraints:\r\n0 <= n <= 10^5","shortMessageHtmlLink":"5 February 2024"}},{"before":"79c387d0fe04d97425304d6665919e082ddbf4ea","after":"c231b4f5bac553b69004b4a9d00a41c95af23435","ref":"refs/heads/main","pushedAt":"2024-02-05T14:00:09.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"4 February 2024\n\nYou are given two linked lists that represent two large positive numbers. From the two numbers represented by the linked lists, subtract the smaller number from the larger one. Look at the examples to get a better understanding of the task.\r\n\r\nExample 1:\r\n\r\nInput:\r\nL1 = 1->0->0\r\nL2 = 1->2\r\nOutput: 88\r\nExplanation:  \r\nFirst linked list represents 100 and the\r\nsecond one represents 12. 12 subtracted from 100\r\ngives us 88 as the result. It is represented\r\nas 8->8 in the linked list.\r\nExample 2:\r\n\r\nInput:\r\nL1 = 0->0->6->3\r\nL2 = 7->1->0\r\nOutput: 647\r\nExplanation: \r\nFirst linked list represents 0063 => 63 and \r\nthe second one represents 710. 63 subtracted \r\nfrom 710 gives us 647 as the result. It is\r\nrepresented as 6->4->7 in the linked list.\r\nYour Task:\r\nYou do not have to take any input or print anything. The task is to complete the function subLinkedList() that takes heads of two linked lists as input parameters and which should subtract the smaller number from the larger one represented by the given linked lists and return the head of the linked list representing the result.\r\n\r\nn and m are the length of the two linked lists respectively.\r\nExpected Time Complexity:  O(n+m)\r\nExpected Auxiliary Space: O(n+m)\r\n\r\nConstraints:\r\n1 <= n <= 10000\r\n0 <= values represented by the linked lists < 10n\r\n0 <= values represented by the linked lists < 10m","shortMessageHtmlLink":"4 February 2024"}},{"before":"d5337987cf2e96c26e1f4a06d7cbd198a11cad88","after":"79c387d0fe04d97425304d6665919e082ddbf4ea","ref":"refs/heads/main","pushedAt":"2024-02-05T13:59:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"risitadas","name":"Risita Das","path":"/risitadas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/92712417?s=80&v=4"},"commit":{"message":"3 February 2024\n\nGiven a singly linked list of length n. The link list represents a binary number, ie- it contains only 0s and 1s. Find its decimal equivalent.\r\nThe significance of the bits decreases with the increasing index in the linked list.\r\nAn empty linked list is considered to represent the decimal value 0. \r\n\r\nSince the answer can be very large, answer modulo 109+7 should be printed.\r\n\r\nExample 1:\r\nInput:\r\nn = 3\r\nLinked List = {0, 1, 1}\r\nOutput:\r\n3\r\nExplanation:\r\n0*22 + 1*21 + 1*20 =  1 + 2 + 0 = 3\r\nExample 2:\r\nInput:\r\nn = 4\r\nLinked List = {1, 1, 1, 0}\r\nOutput:\r\n14\r\nExplanation:\r\n1*23 + 1*22 + 1*21 + 0*20 =  8 + 4 + 2 + 0 = 14\r\nYour Task:\r\nYou do not have to take any input or print anything. Complete the function decimalValue() which takes a head node of a linked list as an input parameter and returns decimal representation of it.\r\n\r\nExpected Time Complexity: O(n)\r\nExpected Auxiliary Space: O(1)\r\n\r\nConstraints:\r\n0 <= n <= 10^4\r\nData of each node is either 0 or 1","shortMessageHtmlLink":"3 February 2024"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOC0xMVQxOTo1MzoyOC4wMDAwMDBazwAAAASXh-Wy","startCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOC0xMVQxOTo1MzoyOC4wMDAwMDBazwAAAASXh-Wy","endCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wMi0wNVQxMzo1OToyNS4wMDAwMDBazwAAAAPyUpej"}},"title":"Activity · risitadas/gfg-POTD"}