{
    "componentChunkName": "component---src-templates-list-series-js",
    "path": "/series/stack/",
    "result": {"data":{"site":{"siteMetadata":{"name":"CalliCoder","title":"Programming, Web development, System design & Devops Tutorials","description":"CalliCoder is a one stop destination for software developers looking for practical guides and tutorials on Programming languages, Web Development, System Design, DevOps, Java, Kotlin, Golang, Spring Boot and Node.js.","author":"Rajeev Singh"}},"allMdx":{"totalCount":4,"edges":[{"node":{"excerpt":"Problem Statement The stock span problem is a financial problem where we have a series of  n  daily price quotes for a stock and we need to…","timeToRead":1,"fields":{"slug":"/stock-span-problem/"},"frontmatter":{"date":"September 09, 2021","title":"Stock Span Problem","type":"post","description":"The stock span problem is a financial problem where we have a series of n daily price quotes for a stock and we need to calculate span of stock’s price for all n days. The span S[i] of the stock’s price on a given day i is defined as the maximum number of consecutive days (starting from today and going backward) for which the stock price was less than or equal to its price on day i.","categories":["algorithms"],"image":{"publicURL":"/static/18b4e4a4138160d348ea4b13642916c0/stock-span-problem.jpg","childImageSharp":{"gatsbyImageData":{"layout":"constrained","backgroundColor":"#084898","images":{"fallback":{"src":"/static/18b4e4a4138160d348ea4b13642916c0/5dfc8/stock-span-problem.jpg","srcSet":"/static/18b4e4a4138160d348ea4b13642916c0/5f9d5/stock-span-problem.jpg 163w,\n/static/18b4e4a4138160d348ea4b13642916c0/123ee/stock-span-problem.jpg 325w,\n/static/18b4e4a4138160d348ea4b13642916c0/5dfc8/stock-span-problem.jpg 650w","sizes":"(min-width: 650px) 650px, 100vw"},"sources":[{"srcSet":"/static/18b4e4a4138160d348ea4b13642916c0/79f7a/stock-span-problem.webp 163w,\n/static/18b4e4a4138160d348ea4b13642916c0/e4f3d/stock-span-problem.webp 325w,\n/static/18b4e4a4138160d348ea4b13642916c0/612f6/stock-span-problem.webp 650w","type":"image/webp","sizes":"(min-width: 650px) 650px, 100vw"}]},"width":650,"height":347}}}}}},{"node":{"excerpt":"Problem Statement Given an array of integers, find the nearest (not considering distance, but value) greater element to the left of every…","timeToRead":1,"fields":{"slug":"/nearest-greater-to-left/"},"frontmatter":{"date":"September 08, 2021","title":"Nearest greater element to the left of every element","type":"post","description":"Given an array of integers, find the nearest (not considering distance, but value) greater element on the left of every element. If an element has no greater value on the left side, print -1.","categories":["algorithms"],"image":{"publicURL":"/static/8edf504d5a2c55fc19aea2d35678fd65/nearest-greater-to-left.jpg","childImageSharp":{"gatsbyImageData":{"layout":"constrained","backgroundColor":"#0858a8","images":{"fallback":{"src":"/static/8edf504d5a2c55fc19aea2d35678fd65/5dfc8/nearest-greater-to-left.jpg","srcSet":"/static/8edf504d5a2c55fc19aea2d35678fd65/5f9d5/nearest-greater-to-left.jpg 163w,\n/static/8edf504d5a2c55fc19aea2d35678fd65/123ee/nearest-greater-to-left.jpg 325w,\n/static/8edf504d5a2c55fc19aea2d35678fd65/5dfc8/nearest-greater-to-left.jpg 650w","sizes":"(min-width: 650px) 650px, 100vw"},"sources":[{"srcSet":"/static/8edf504d5a2c55fc19aea2d35678fd65/79f7a/nearest-greater-to-left.webp 163w,\n/static/8edf504d5a2c55fc19aea2d35678fd65/e4f3d/nearest-greater-to-left.webp 325w,\n/static/8edf504d5a2c55fc19aea2d35678fd65/612f6/nearest-greater-to-left.webp 650w","type":"image/webp","sizes":"(min-width: 650px) 650px, 100vw"}]},"width":650,"height":347}}}}}},{"node":{"excerpt":"Problem Statement Given an array, print the Next Greater Element (NGE) for every element. The Next greater element for an element x is the…","timeToRead":1,"fields":{"slug":"/nearest-greater-to-right/"},"frontmatter":{"date":"September 07, 2021","title":"Nearest/Next greater element to the right of every element","type":"post","description":"Given an array, print the Next Greater Element (NGE) for every element. The Next greater element for an element x is the first greater element on the right side of x in the array. If an element has no greater value on the right side, print -1.","categories":["algorithms"],"image":{"publicURL":"/static/0f724e8129fa090ffe0ed5a3ed3961f7/nearest-greater-to-right.jpg","childImageSharp":{"gatsbyImageData":{"layout":"constrained","backgroundColor":"#182838","images":{"fallback":{"src":"/static/0f724e8129fa090ffe0ed5a3ed3961f7/5dfc8/nearest-greater-to-right.jpg","srcSet":"/static/0f724e8129fa090ffe0ed5a3ed3961f7/5f9d5/nearest-greater-to-right.jpg 163w,\n/static/0f724e8129fa090ffe0ed5a3ed3961f7/123ee/nearest-greater-to-right.jpg 325w,\n/static/0f724e8129fa090ffe0ed5a3ed3961f7/5dfc8/nearest-greater-to-right.jpg 650w","sizes":"(min-width: 650px) 650px, 100vw"},"sources":[{"srcSet":"/static/0f724e8129fa090ffe0ed5a3ed3961f7/79f7a/nearest-greater-to-right.webp 163w,\n/static/0f724e8129fa090ffe0ed5a3ed3961f7/e4f3d/nearest-greater-to-right.webp 325w,\n/static/0f724e8129fa090ffe0ed5a3ed3961f7/612f6/nearest-greater-to-right.webp 650w","type":"image/webp","sizes":"(min-width: 650px) 650px, 100vw"}]},"width":650,"height":347}}}}}},{"node":{"excerpt":"Valid Parentheses problem statement Given a string containing just the characters  ( ,  ) ,  { ,  } ,  [  and  ] , determine if the input…","timeToRead":1,"fields":{"slug":"/valid-parentheses/"},"frontmatter":{"date":"October 05, 2019","title":"Valid Parentheses problem","type":"post","description":"Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: Open brackets must be closed by the same type of brackets. Open brackets must be closed in the correct order. Note that an empty string is also considered valid.","categories":["algorithms"],"image":{"publicURL":"/static/cfa01afca3475d2926414926d76517b5/valid-parentheses-problem.jpg","childImageSharp":{"gatsbyImageData":{"layout":"constrained","backgroundColor":"#c88898","images":{"fallback":{"src":"/static/cfa01afca3475d2926414926d76517b5/5dfc8/valid-parentheses-problem.jpg","srcSet":"/static/cfa01afca3475d2926414926d76517b5/5f9d5/valid-parentheses-problem.jpg 163w,\n/static/cfa01afca3475d2926414926d76517b5/123ee/valid-parentheses-problem.jpg 325w,\n/static/cfa01afca3475d2926414926d76517b5/5dfc8/valid-parentheses-problem.jpg 650w","sizes":"(min-width: 650px) 650px, 100vw"},"sources":[{"srcSet":"/static/cfa01afca3475d2926414926d76517b5/79f7a/valid-parentheses-problem.webp 163w,\n/static/cfa01afca3475d2926414926d76517b5/e4f3d/valid-parentheses-problem.webp 325w,\n/static/cfa01afca3475d2926414926d76517b5/612f6/valid-parentheses-problem.webp 650w","type":"image/webp","sizes":"(min-width: 650px) 650px, 100vw"}]},"width":650,"height":347}}}}}}]}},"pageContext":{"basePath":"/series/stack/","series":"stack","seriesSlug":"stack","limit":10,"skip":0,"numPages":1,"currentPage":1}},
    "staticQueryHashes": ["2935368691","3127135171"]}