# Equivalence of Boolean Expressions

1 vote
158 views
Write an object oriented code for representing boolean expressions and then a function for checking the equivalence of two boolean expressions.

## Related questions

1 vote
1
679 views
According to me first we sort the array in O(nlogn) time and then in O(k) time , find the product , so total time complexity is O(nlogn) , so am I right or can it be done in lesser time ?
Given an array of $n$ elements find the maximum continuous sum in it. For example consider the below array of $n=6$. 23 4 -10 2 15 1 Answer is 35.