Answer Posted / navneet kang

++26 + -1324
METHOD:-
Start scanning the string from the right one character at a time.
If it is an operand, push it in stack.
If it is an operator, pop opnd1, opnd2 and perform the operation, specified by the operator. Push the result in the stack.
Repeat these steps until arr of input prefix strings ends.
Solution
1)Push 4,2,13 in stack one by one
2) - operator encountered
3)Take out 13 and 2 from stack and perform operation
4)Now Stack consist of 4,11
5)+ operator encountered
6)Now Stack consist of 15
7)Now push 6 in stack,Hence Now Stack consist of 15,6,2
8)Perform add operation + encountered
9)Now Stack consist of 15,8
10)+ operator encountered
11)Now Stack consist of 23

Hence Answer is 23

Why merge sort is better than insertion sort?

820

---

Can you sort a hashmap?

854

---

What is the difference between collections class vs collections interface?

962

---

Can we use ordered set for performing binary search?

915

---

What is an array vs list?

859

---

How do I use quick sort?

856

---

Is quicksort a stable algorithm?

963

---

Does treemap preserve order?

847

---

Why do we need searching algorithms?

1086

---

What is a tech stack?

871

---

What is arraylist load factor?

1076

---

Is hashmap sorted?

948

---

What is the difference between hashset and arraylist?

979

---

Is hashtable better than dictionary?

956

---

Can hashtable have duplicate values?

912

---