[{"_id":"623947fd6622115cc8048ecd","isAnonymous":false,"views":13,"coverImage":"","brief":"Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.\n\nExample 1:\nInput: nums = [1,2,3,4,5]\nOutput: true\nExplanation: Any t...","upvotes":0,"tags":["56744721958ef13879b94c9f","56744720958ef13879b947e1","56744722958ef13879b9512b","56fb79d4da7018d48c208e91","56744722958ef13879b951bb"],"responseCount":0,"replyCount":0,"isActive":true,"bookmarkedIn":[],"reactions":[],"totalReactions":0,"reactionsByCurrentUser":[],"isPinnedToBlog":false,"title":"Increasing Triplet Subsequence | Arrays | LeetCode","subtitle":"","type":"story","partOfPublication":true,"publication":"60116f742426ce4197073339","slug":"increasing-triplet-subsequence-or-arrays-or-leetcode","dateAdded":"2022-03-22T03:52:29.436Z","contributors":[],"cuid":"cl11lpctk01evlgnvfbbvdj6f","author":{"_id":"60116f482426ce419707331d","socialMedia":{"twitter":"","github":"","stackoverflow":"","facebook":"","website":"https://gowthy.com/","linkedin":"http://linkedin.com/in/gowthy"},"location":"India","isDeactivated":false,"numFollowers":3,"numFollowing":0,"storiesCreated":[],"totalUpvotesReceived":0,"tagManagerOf":[],"isEvangelist":false,"isAmbassador":false,"hasGoldRing":false,"name":"Gowthaman Ravi","username":"gowthy","tagline":"Developer | Learner | DSA ","photo":"https://cdn.hashnode.com/res/hashnode/image/upload/v1611755336749/uytW_oRcJ.png","dateJoined":"2021-01-27T13:48:56.325Z","publicationDomain":"blog.gowthy.com","numPosts":39,"numReactions":17,"bio":"

I love solving problems and building tech stuffs. I leverage my expertise to assist others and make better world.

\n"},"followersCount":1,"readTime":2},{"_id":"620bfde425673f2740ee8ab9","isAnonymous":false,"views":15,"coverImage":"","brief":"The next greater element of some element x in an array is the first greater element that is to the right of x in the same array.\nYou are given two distinct 0-indexed integer arrays nums1 and nums2, where nums1 is a subset of nums2.\nFor each 0 <= i < ...","upvotes":0,"tags":["56744721958ef13879b94c9f","56744722958ef13879b951bb","56744722958ef13879b9512b","56fb79d4da7018d48c208e91","56744720958ef13879b947e1"],"responseCount":0,"replyCount":0,"isActive":true,"bookmarkedIn":[],"reactions":[],"totalReactions":0,"reactionsByCurrentUser":[],"isPinnedToBlog":false,"title":"Stack problem | Next Greater Element I","subtitle":"","type":"story","partOfPublication":true,"publication":"60116f742426ce4197073339","slug":"stack-problem-or-next-greater-element-i","dateAdded":"2022-02-15T19:24:20.995Z","contributors":[],"cuid":"ckzoikx5b04rpr4s1hny83ysz","author":{"_id":"60116f482426ce419707331d","socialMedia":{"twitter":"","github":"","stackoverflow":"","facebook":"","website":"https://gowthy.com/","linkedin":"http://linkedin.com/in/gowthy"},"location":"India","isDeactivated":false,"numFollowers":3,"numFollowing":0,"storiesCreated":[],"totalUpvotesReceived":0,"tagManagerOf":[],"isEvangelist":false,"isAmbassador":false,"hasGoldRing":false,"name":"Gowthaman Ravi","username":"gowthy","tagline":"Developer | Learner | DSA ","photo":"https://cdn.hashnode.com/res/hashnode/image/upload/v1611755336749/uytW_oRcJ.png","dateJoined":"2021-01-27T13:48:56.325Z","publicationDomain":"blog.gowthy.com","numPosts":39,"numReactions":17,"bio":"

I love solving problems and building tech stuffs. I leverage my expertise to assist others and make better world.

\n"},"followersCount":1,"readTime":2},{"_id":"620015bc3a8a6e5fe1197ede","isAnonymous":false,"views":15,"coverImage":"https://cdn.hashnode.com/res/hashnode/image/upload/v1644172553393/d7GuN8jQ7.jpeg","brief":"Given the root of a binary tree, return the leftmost value in the last row of the tree.\nExample 1:\n\nInput: root = [2,1,3]\nOutput: 1\nExample 2:\n\nInput: root = [1,2,3,4,null,5,6,null,null,7]\nOutput: 7\nConstraints:\nThe number of nodes in the tree is in ...","upvotes":0,"tags":["56744722958ef13879b951bb","56744722958ef13879b9512b","56fb79d4da7018d48c208e91","56744720958ef13879b947e1","56744721958ef13879b94c9f"],"responseCount":0,"replyCount":0,"isActive":true,"bookmarkedIn":[],"reactions":[],"totalReactions":0,"reactionsByCurrentUser":[],"isPinnedToBlog":false,"title":"Find Bottom Left Tree Value | Breadth-First search","subtitle":"","type":"story","partOfPublication":true,"publication":"60116f742426ce4197073339","slug":"find-bottom-left-tree-value-or-breadth-first-search","dateAdded":"2022-02-06T18:38:52.356Z","contributors":[],"cuid":"ckzblzs6i02sxxts1gxrlaxi2","author":{"_id":"60116f482426ce419707331d","socialMedia":{"twitter":"","github":"","stackoverflow":"","facebook":"","website":"https://gowthy.com/","linkedin":"http://linkedin.com/in/gowthy"},"location":"India","isDeactivated":false,"numFollowers":3,"numFollowing":0,"storiesCreated":[],"totalUpvotesReceived":0,"tagManagerOf":[],"isEvangelist":false,"isAmbassador":false,"hasGoldRing":false,"name":"Gowthaman Ravi","username":"gowthy","tagline":"Developer | Learner | DSA ","photo":"https://cdn.hashnode.com/res/hashnode/image/upload/v1611755336749/uytW_oRcJ.png","dateJoined":"2021-01-27T13:48:56.325Z","publicationDomain":"blog.gowthy.com","numPosts":39,"numReactions":17,"bio":"

I love solving problems and building tech stuffs. I leverage my expertise to assist others and make better world.

\n"},"followersCount":1,"readTime":1},{"_id":"61f43a236bb59d5767db4003","isAnonymous":false,"views":25,"coverImage":"https://cdn.hashnode.com/res/hashnode/image/upload/v1643395418205/rLTBC0mbB.jpeg","brief":"Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).\n\nExample 1:\n\nInput: root = [3,9,20,null,null,15,7]\nOutput: [[3],[9,20],[15,7]]\nExample 2:\nInput: root = [1]\nOutput: [[...","upvotes":0,"tags":["56744721958ef13879b94c9f","56744722958ef13879b9512b","56fb79d4da7018d48c208e91","56744722958ef13879b951bb","56744720958ef13879b947e1"],"responseCount":0,"replyCount":0,"isActive":true,"bookmarkedIn":[],"reactions":["5c090d96c2a9c2a674d35484","5c090d96c2a9c2a674d35485","567453d0b73d6a82ac8c5abd","567453d0b73d6a82ac8c5abc"],"totalReactions":4,"reactionsByCurrentUser":[],"isPinnedToBlog":false,"title":"Breadth-first search | Binary Tree Level Order Traversal","subtitle":"","type":"story","partOfPublication":true,"publication":"60116f742426ce4197073339","slug":"breadth-first-search-or-binary-tree-level-order-traversal","dateAdded":"2022-01-28T18:46:59.787Z","contributors":[],"isCoverImagePortrait":true,"cuid":"ckyyrbjzb00qx9js1hr63bu2c","author":{"_id":"60116f482426ce419707331d","socialMedia":{"twitter":"","github":"","stackoverflow":"","facebook":"","website":"https://gowthy.com/","linkedin":"http://linkedin.com/in/gowthy"},"location":"India","isDeactivated":false,"numFollowers":3,"numFollowing":0,"storiesCreated":[],"totalUpvotesReceived":0,"tagManagerOf":[],"isEvangelist":false,"isAmbassador":false,"hasGoldRing":false,"name":"Gowthaman Ravi","username":"gowthy","tagline":"Developer | Learner | DSA ","photo":"https://cdn.hashnode.com/res/hashnode/image/upload/v1611755336749/uytW_oRcJ.png","dateJoined":"2021-01-27T13:48:56.325Z","publicationDomain":"blog.gowthy.com","numPosts":39,"numReactions":17,"bio":"

I love solving problems and building tech stuffs. I leverage my expertise to assist others and make better world.

\n"},"followersCount":1,"readTime":2},{"_id":"61f19220e247b2151e621d5c","isAnonymous":false,"views":22,"coverImage":"","brief":"Given the root of a binary tree, return the inorder traversal of its nodes' values.\n\nExample 1:\n\nInput: root = [1,null,2,3]\nOutput: [1,3,2]\nExample 2:\nInput: root = []\nOutput: []\nExample 3:\nInput: root = [1]\nOutput: [1]\nConstraints:\nThe number of nod...","upvotes":0,"tags":["56744721958ef13879b94c9f","56744722958ef13879b9512b","56fb79d4da7018d48c208e91","56744720958ef13879b947e1","56744722958ef13879b951bb"],"responseCount":0,"replyCount":0,"isActive":true,"bookmarkedIn":[],"reactions":[],"totalReactions":0,"reactionsByCurrentUser":[],"isPinnedToBlog":false,"title":"Binary Tree | Inorder Traversal","subtitle":"","type":"story","partOfPublication":true,"publication":"60116f742426ce4197073339","slug":"binary-tree-or-inorder-traversal","dateAdded":"2022-01-26T18:25:36.916Z","contributors":[],"cuid":"ckyvvocv11ibo66s10d7t3ohp","author":{"_id":"60116f482426ce419707331d","socialMedia":{"twitter":"","github":"","stackoverflow":"","facebook":"","website":"https://gowthy.com/","linkedin":"http://linkedin.com/in/gowthy"},"location":"India","isDeactivated":false,"numFollowers":3,"numFollowing":0,"storiesCreated":[],"totalUpvotesReceived":0,"tagManagerOf":[],"isEvangelist":false,"isAmbassador":false,"hasGoldRing":false,"name":"Gowthaman Ravi","username":"gowthy","tagline":"Developer | Learner | DSA ","photo":"https://cdn.hashnode.com/res/hashnode/image/upload/v1611755336749/uytW_oRcJ.png","dateJoined":"2021-01-27T13:48:56.325Z","publicationDomain":"blog.gowthy.com","numPosts":39,"numReactions":17,"bio":"

I love solving problems and building tech stuffs. I leverage my expertise to assist others and make better world.

\n"},"followersCount":1,"readTime":2},{"_id":"61f1901f87fd2728e7cd642e","isAnonymous":false,"views":39,"coverImage":"","brief":"Given an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal's triangle.\nIn Pascal's triangle, each number is the sum of the two numbers directly above it as shown:\n\n\nExample 1:\nInput: rowIndex = 3\nOutput: [1,3,3,1]\nExample 2:\nInput...","upvotes":0,"tags":["56744722958ef13879b951bb","56744721958ef13879b94c9f","56744720958ef13879b947e1","56744722958ef13879b9512b","56fb79d4da7018d48c208e91"],"responseCount":0,"replyCount":0,"isActive":true,"bookmarkedIn":[],"reactions":[],"totalReactions":0,"reactionsByCurrentUser":[],"isPinnedToBlog":false,"title":"Dynamic Programming | Pascal's Triangle II","subtitle":"","type":"story","partOfPublication":true,"publication":"60116f742426ce4197073339","slug":"dynamic-programming-or-pascals-triangle-ii","dateAdded":"2022-01-26T18:17:03.318Z","contributors":[],"cuid":"ckyvvdci30qyr2vs1ha5fhu3v","author":{"_id":"60116f482426ce419707331d","socialMedia":{"twitter":"","github":"","stackoverflow":"","facebook":"","website":"https://gowthy.com/","linkedin":"http://linkedin.com/in/gowthy"},"location":"India","isDeactivated":false,"numFollowers":3,"numFollowing":0,"storiesCreated":[],"totalUpvotesReceived":0,"tagManagerOf":[],"isEvangelist":false,"isAmbassador":false,"hasGoldRing":false,"name":"Gowthaman Ravi","username":"gowthy","tagline":"Developer | Learner | DSA ","photo":"https://cdn.hashnode.com/res/hashnode/image/upload/v1611755336749/uytW_oRcJ.png","dateJoined":"2021-01-27T13:48:56.325Z","publicationDomain":"blog.gowthy.com","numPosts":39,"numReactions":17,"bio":"

I love solving problems and building tech stuffs. I leverage my expertise to assist others and make better world.

\n"},"followersCount":1,"readTime":1},{"_id":"61f18ef8e247b2151e621d21","isAnonymous":false,"views":12,"coverImage":"","brief":"Given an integer numRows, return the first numRows of Pascal's triangle.\nIn Pascal's triangle, each number is the sum of the two numbers directly above it as shown:\n\n\nExample 1:\nInput: numRows = 5\nOutput: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]\nExa...","upvotes":0,"tags":["56744722958ef13879b951bb","56744722958ef13879b9512b","56fb79d4da7018d48c208e91","56744721958ef13879b94c9f","56744720958ef13879b947e1"],"responseCount":0,"replyCount":0,"isActive":true,"bookmarkedIn":[],"reactions":[],"totalReactions":0,"reactionsByCurrentUser":[],"isPinnedToBlog":false,"title":"Dynamic Programming | Pascal's Triangle","subtitle":"","type":"story","partOfPublication":true,"publication":"60116f742426ce4197073339","slug":"dynamic-programming-or-pascals-triangle","dateAdded":"2022-01-26T18:12:08.395Z","contributors":[],"cuid":"ckyvv70x71i5p66s1gdkz3msd","author":{"_id":"60116f482426ce419707331d","socialMedia":{"twitter":"","github":"","stackoverflow":"","facebook":"","website":"https://gowthy.com/","linkedin":"http://linkedin.com/in/gowthy"},"location":"India","isDeactivated":false,"numFollowers":3,"numFollowing":0,"storiesCreated":[],"totalUpvotesReceived":0,"tagManagerOf":[],"isEvangelist":false,"isAmbassador":false,"hasGoldRing":false,"name":"Gowthaman Ravi","username":"gowthy","tagline":"Developer | Learner | DSA ","photo":"https://cdn.hashnode.com/res/hashnode/image/upload/v1611755336749/uytW_oRcJ.png","dateJoined":"2021-01-27T13:48:56.325Z","publicationDomain":"blog.gowthy.com","numPosts":39,"numReactions":17,"bio":"

I love solving problems and building tech stuffs. I leverage my expertise to assist others and make better world.

\n"},"followersCount":1,"readTime":1},{"_id":"61f18b6ae247b2151e621cb5","isAnonymous":false,"views":31,"coverImage":"","brief":"Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.\nA subarray is a contiguous part of an array.\n\nExample 1:\nInput: nums = [-2,1,-3,4,-1,2,1,-5,4]\nOutput: 6\nExplanat...","upvotes":0,"tags":["56744722958ef13879b951bb","56744721958ef13879b94c9f","56744720958ef13879b947e1","56fb79d4da7018d48c208e91","56744722958ef13879b9512b"],"responseCount":0,"replyCount":0,"isActive":true,"bookmarkedIn":[],"reactions":["5c090d96c2a9c2a674d35484"],"totalReactions":1,"reactionsByCurrentUser":[],"isPinnedToBlog":false,"title":"Dynamic Programming | Maximum Subarray","subtitle":"","type":"story","partOfPublication":true,"publication":"60116f742426ce4197073339","slug":"dynamic-programming-or-maximum-subarray","dateAdded":"2022-01-26T17:56:58.446Z","contributors":[],"cuid":"ckyvunimx1hw766s1849vejo7","author":{"_id":"60116f482426ce419707331d","socialMedia":{"twitter":"","github":"","stackoverflow":"","facebook":"","website":"https://gowthy.com/","linkedin":"http://linkedin.com/in/gowthy"},"location":"India","isDeactivated":false,"numFollowers":3,"numFollowing":0,"storiesCreated":[],"totalUpvotesReceived":0,"tagManagerOf":[],"isEvangelist":false,"isAmbassador":false,"hasGoldRing":false,"name":"Gowthaman Ravi","username":"gowthy","tagline":"Developer | Learner | DSA ","photo":"https://cdn.hashnode.com/res/hashnode/image/upload/v1611755336749/uytW_oRcJ.png","dateJoined":"2021-01-27T13:48:56.325Z","publicationDomain":"blog.gowthy.com","numPosts":39,"numReactions":17,"bio":"

I love solving problems and building tech stuffs. I leverage my expertise to assist others and make better world.

\n"},"followersCount":1,"readTime":2,"series":null,"dateUpdated":"2022-01-26T18:02:41.993Z"},{"_id":"60e978e96d962b01bdecbe95","isAnonymous":false,"views":59,"coverImage":"","brief":"Given the root of a binary tree, invert the tree, and return its root.\nExample 1:\n\nInput: root = [4,2,7,1,3,6,9]\nOutput: [4,7,2,9,6,3,1]\nExample 2:\n\nInput: root = [2,1,3]\nOutput: [2,3,1]\nExample 3:\nInput: root = []\nOutput: []\nConstraints:\nThe number ...","upvotes":0,"tags":["56744720958ef13879b947e1","56744722958ef13879b9512b","56fb79d4da7018d48c208e91","56744722958ef13879b951bb","56744721958ef13879b948b7"],"responseCount":0,"replyCount":0,"isActive":true,"bookmarkedIn":[],"reactions":[],"totalReactions":0,"reactionsByCurrentUser":[],"isPinnedToBlog":false,"title":"226. Invert Binary Tree | LeetCode | DSA | Problem Solving","subtitle":"","type":"story","partOfPublication":true,"publication":"60116f742426ce4197073339","slug":"226-invert-binary-tree-or-leetcode-or-dsa-or-problem-solving","dateAdded":"2021-07-10T10:39:37.777Z","contributors":[],"cuid":"ckqxmypvz0bubcds14pz41c8j","author":{"_id":"60116f482426ce419707331d","socialMedia":{"twitter":"","github":"","stackoverflow":"","facebook":"","website":"https://gowthy.com/","linkedin":"http://linkedin.com/in/gowthy"},"location":"India","isDeactivated":false,"numFollowers":3,"numFollowing":0,"storiesCreated":[],"totalUpvotesReceived":0,"tagManagerOf":[],"isEvangelist":false,"isAmbassador":false,"hasGoldRing":false,"name":"Gowthaman Ravi","username":"gowthy","tagline":"Developer | Learner | DSA ","photo":"https://cdn.hashnode.com/res/hashnode/image/upload/v1611755336749/uytW_oRcJ.png","dateJoined":"2021-01-27T13:48:56.325Z","publicationDomain":"blog.gowthy.com","numPosts":39,"numReactions":17,"bio":"

I love solving problems and building tech stuffs. I leverage my expertise to assist others and make better world.

\n"},"followersCount":1,"readTime":1},{"_id":"60e5eb8bd534931b99a4f21d","isAnonymous":false,"views":58,"coverImage":"","brief":"You are given an array of n pairs pairs where pairs[i] = [lefti, righti] and lefti < righti.\nA pair p2 = [c, d] follows a pair p1 = [a, b] if b < c. A chain of pairs can be formed in this fashion.\nReturn the length longest chain which can be formed.\n...","upvotes":0,"tags":["56744721958ef13879b94c9f","56fb79d4da7018d48c208e91","56744722958ef13879b9512b","56744722958ef13879b951bb","56744720958ef13879b947e1"],"responseCount":0,"replyCount":0,"isActive":true,"bookmarkedIn":[],"reactions":[],"totalReactions":0,"reactionsByCurrentUser":[],"isPinnedToBlog":false,"title":"646. Maximum Length of Pair Chain | LeetCode | Java","subtitle":"","type":"story","partOfPublication":true,"publication":"60116f742426ce4197073339","slug":"646-maximum-length-of-pair-chain-or-leetcode-or-java","dateAdded":"2021-07-07T17:59:39.619Z","contributors":[],"cuid":"ckqtsd1pr00tog9s12qem7qbx","author":{"_id":"60116f482426ce419707331d","socialMedia":{"twitter":"","github":"","stackoverflow":"","facebook":"","website":"https://gowthy.com/","linkedin":"http://linkedin.com/in/gowthy"},"location":"India","isDeactivated":false,"numFollowers":3,"numFollowing":0,"storiesCreated":[],"totalUpvotesReceived":0,"tagManagerOf":[],"isEvangelist":false,"isAmbassador":false,"hasGoldRing":false,"name":"Gowthaman Ravi","username":"gowthy","tagline":"Developer | Learner | DSA ","photo":"https://cdn.hashnode.com/res/hashnode/image/upload/v1611755336749/uytW_oRcJ.png","dateJoined":"2021-01-27T13:48:56.325Z","publicationDomain":"blog.gowthy.com","numPosts":39,"numReactions":17,"bio":"

I love solving problems and building tech stuffs. I leverage my expertise to assist others and make better world.

\n"},"followersCount":1,"readTime":1},{"_id":"60de02ef2c9e6e178047612f","isAnonymous":false,"views":17,"coverImage":"","brief":"Given the roots of two binary trees p and q, write a function to check if they are the same or not.\nTwo binary trees are considered the same if they are structurally identical, and the nodes have the same value.\nExample 1:\n\nInput: p = [1,2,3], q = [1...","upvotes":0,"tags":["56744722958ef13879b951bb","56744722958ef13879b9512b","56fb79d4da7018d48c208e91","56744720958ef13879b947e1","56744721958ef13879b948b7"],"responseCount":0,"replyCount":0,"isActive":true,"bookmarkedIn":[],"reactions":[],"totalReactions":0,"reactionsByCurrentUser":[],"isPinnedToBlog":false,"title":"101. Same Tree | LeetCode | Trees | DSA","subtitle":"","type":"story","partOfPublication":true,"publication":"60116f742426ce4197073339","slug":"101-same-tree-or-leetcode-or-trees-or-dsa","dateAdded":"2021-07-01T18:01:19.667Z","contributors":[],"cuid":"ckql7s2vs00ipn4s1dfv0fbgi","author":{"_id":"60116f482426ce419707331d","socialMedia":{"twitter":"","github":"","stackoverflow":"","facebook":"","website":"https://gowthy.com/","linkedin":"http://linkedin.com/in/gowthy"},"location":"India","isDeactivated":false,"numFollowers":3,"numFollowing":0,"storiesCreated":[],"totalUpvotesReceived":0,"tagManagerOf":[],"isEvangelist":false,"isAmbassador":false,"hasGoldRing":false,"name":"Gowthaman Ravi","username":"gowthy","tagline":"Developer | Learner | DSA ","photo":"https://cdn.hashnode.com/res/hashnode/image/upload/v1611755336749/uytW_oRcJ.png","dateJoined":"2021-01-27T13:48:56.325Z","publicationDomain":"blog.gowthy.com","numPosts":39,"numReactions":17,"bio":"

I love solving problems and building tech stuffs. I leverage my expertise to assist others and make better world.

\n"},"followersCount":1,"readTime":1,"series":null,"dateUpdated":"2021-07-01T18:02:50.424Z"},{"_id":"60d860ffcb0aa8118c23c94a","isAnonymous":false,"views":82,"coverImage":"","brief":"You are given an m x n grid where each cell can have one of three values:\n0 representing an empty cell,\n1 representing a fresh orange, or\n2 representing a rotten orange.\nEvery minute, any fresh orange that is 4-directionally adjacent to a rotten oran...","upvotes":0,"tags":["56744722958ef13879b951bb","56fb79d4da7018d48c208e91","56744721958ef13879b94c9f","56744720958ef13879b947e1","56744722958ef13879b9512b"],"responseCount":0,"replyCount":0,"isActive":true,"bookmarkedIn":[],"reactions":[],"totalReactions":0,"reactionsByCurrentUser":[],"isPinnedToBlog":false,"title":"994. Rotting Oranges | LeetCode | Java | Problem Solving","subtitle":"","type":"story","partOfPublication":true,"publication":"60116f742426ce4197073339","slug":"994-rotting-oranges-or-leetcode-or-java-or-problem-solving","dateAdded":"2021-06-27T11:29:03.674Z","contributors":[],"cuid":"ckqf407rg0knagss1doxs6das","author":{"_id":"60116f482426ce419707331d","socialMedia":{"twitter":"","github":"","stackoverflow":"","facebook":"","website":"https://gowthy.com/","linkedin":"http://linkedin.com/in/gowthy"},"location":"India","isDeactivated":false,"numFollowers":3,"numFollowing":0,"storiesCreated":[],"totalUpvotesReceived":0,"tagManagerOf":[],"isEvangelist":false,"isAmbassador":false,"hasGoldRing":false,"name":"Gowthaman Ravi","username":"gowthy","tagline":"Developer | Learner | DSA ","photo":"https://cdn.hashnode.com/res/hashnode/image/upload/v1611755336749/uytW_oRcJ.png","dateJoined":"2021-01-27T13:48:56.325Z","publicationDomain":"blog.gowthy.com","numPosts":39,"numReactions":17,"bio":"

I love solving problems and building tech stuffs. I leverage my expertise to assist others and make better world.

\n"},"followersCount":1,"readTime":2}]