Leet Code problem 1410: – HTML Entity Parser

HTML entity parser is the parser that takes HTML code as input and replace all the entities of the special characters by the characters itself. The special characters and their entities for HTML are: Given the input text string to the HTML parser, you have to implement the entity parser. Return the text after replacing…

Leetcode problem 1409:- Queries on a Permutation With Key

Given the array queries of positive integers between 1 and m, you have to process all queries[i] (from i=0 to i=queries.length-1) according to the following rules: Return an array containing the result for the given queries. Example 1: Input: queries = [3,1,2,1], m = 5Output: [2,1,2,1]Explanation: The queries are processed as follow:For i=0: queries[i]=3, P=[1,2,3,4,5],…