Leetcode 456. 132 Pattern O(N) Solution

O(N) solution for
leetcode.com/p...

[@abhijitroy1958]

your logic was right and explanation was also good , but there were a little wrong in your code
here my c++ code with your logic
//class Solution {
public:
bool find132pattern(vector& nums) {
if(nums.size()=0;i--){
if(mini >nums[i])return true;

while(!st.empty() and st.top()

[@kunal_chand]

Best visual diargram for this question.

[@elitecode9383]

Thanks mate!

[@SAUMILPatel2]

You have not traversed the array from last to first .

[@tiger7858]

👎 for not traversing array from left to right while explaining

[@kc8478]

Does not work. Please dry run for array containing 132