Stock Span Problem – LeetCode Solution [Medium]
The stock span problem is a financial problem defined as the maximum number of consecutive days (starting from today and going backward)
Category: Competitive Programming
Competitive Programming (Draughts) | CodeChef
This problem was asked in February challenge 2014. Around 900 people were able to solve this problem.
It’s not very intuitive for beginners. And also not very straightforward for someone not doing competitive programming.
Segment Tree (Update) for Range Min Query and Range Sum Query
Update query (Range min query) For update query, we are given an index which needs to be updated. Let val be the value needed to be changed of a given node x. We start from the root of the segment tree and update all nodes (containing minimum value from given index) which have given index in their range. If a node doesn’t have a given index in its range, we don’t make any changes to that node.
Trie – LeetCode Solution [Medium]
A Trie (pronounced as “try”) or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. Trie is an efficient information reTrieval data structure and hence the name Trie. It is a special data structure used to store strings. It consists of nodes and edges like a tree.
Segment Tree
Segment tree is a data structure that is used to solve a certain problem, called RMQ (Range Minimum Query).
Sieve of Eratosthenes | HackerRank Solution
The sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking numbers in the range as composite by marking the multiples of each prime as non-prime.
Custom Sort String – LeetCode Solution [Medium]
You are given two strings order and t. All the words of order are unique and were sorted in some custom order previously.
A Chocolate Fiesta | HackerRank
While it is given that if two numbers are same in the given set, they have different colors. It means that if a1 = a2, then choosing a1 and choosing a2 will be considered as different sets.
Max Area of Island – LeetCode Solution [Medium]
You are given an m x n binary matrix grid. An island is a group of 1’s (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.