Specialist Programmer

You are given a string ‘expression’ consists of characters ‘+’, ‘-’, ‘*’, ‘/’, ‘(‘, ‘)’ and ‘0’ to ‘9’, that represents an Arithmetic Expression in Infix Notation. Your task is to evaluate this Arithmetic Expression.

In Infix Notation, operators are written in-between their operands.

Note :

1. We consider the ‘/’ operator as the floor division.

2. Operators ‘*’ and ‘/’ expression has higher precedence over operators‘+’ and ‘-’ 

3. String expression always starts with ‘(‘ and ends with ‘)’.

4. It is guaranteed that ‘expression’ represents’ a valid expression in Infix notation.

5. It is guaranteed that there will be no case that requires division by 0.

6. No characters other than those mentioned above are present in the string. 

7. It is guaranteed that the operands and final result will fit in a 32-bit integer.

For example :

Consider string ‘expression’ = ‘((2+3)*(5/2))’. 
Then it’s value after evaluation will be ((5)*(2)) = 10. 

You are given a string str consisting of lowercase English letters. You are also given M queries

The queries will be
Type 1:query of form (1 i v): set str[i] as vth character in alphabet. Means for v=0 replace with ‘a’ and v=1 replace with ‘b’ and so on
Type 2:query of form (2 l r) : count the number of distinct elements in the range [l,r]

Your task is to find the XOR of all the values of all the queries of type 2

Given a list of strings print the strings in the ascending order based on length if two strings have same length then we need to print the string which is lexicographically small.
 

There was a discussion going on regarding the projects I have included in the resume.