Check if stack elements are pairwise consecutive

Given a stack of integers, write a function pairWiseConsecutive() that checks whether numbers in the stack are pairwise consecutive or not. The pairs can be increasing or decreasing, and if the stack has an odd number of elements, the element at the top is left out of a pair. The function should retain the original stack content.

Only following standard operations are allowed on stack.

  • push(X): Enter a element X on top of stack.
  • pop(): Removes top element of the stack.
  • empty(): To check if stack is empty.

Examples:

Input : stack = [4, 5, -2, -3, 11, 10, 5, 6, 20]
Output : Yes
Each of the pairs (4, 5), (-2, -3), (11, 10) and
(5, 6) consists of consecutive numbers.

Input : stack = [4, 6, 6, 7, 4, 3]
Output : No
(4, 6) are not consecutive.

The idea is to use another stack.

  1. Create an auxiliary stack aux.
  2. Transfer contents of given stack to aux.
  3. Traverse aux. While traversing fetch top two elements and check if they are consecutive or not. After checking put these elements back to original stack.

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program to check if successive
// pair of numbers in the stack are
// consecutive or not
#include <bits/stdc++.h>
using namespace std;
  
// Function to check if elements are
// pairwise consecutive in stack
bool pairWiseConsecutive(stack<int> s)
{
    // Transfer elements of s to aux.
    stack<int> aux;
    while (!s.empty()) {
        aux.push(s.top());
        s.pop();
    }
  
    // Traverse aux and see if
    // elements are pairwise
    // consecutive or not. We also
    // need to make sure that original
    // content is retained.
    bool result = true;
    while (aux.empty() > 1) {
  
        // Fetch current top two
        // elements of aux and check
        // if they are consecutive.
        int x = aux.top();
        aux.pop();
        int y = aux.top();
        aux.pop();
        if (abs(x - y) != 1)
          result = false;
  
        // Push the elements to original
        // stack.
        s.push(x);
        s.push(y);
    }
  
    if (aux.size() == 1)
        s.push(aux.top());
  
    return result;
}
  
// Driver program
int main()
{
    stack<int> s;
    s.push(4);
    s.push(5);
    s.push(-2);
    s.push(-3);
    s.push(11);
    s.push(10);
    s.push(5);
    s.push(6);
    s.push(20);
  
    if (pairWiseConsecutive(s))
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
  
    cout << "Stack content (from top)"
          " after function call\n";
    while (s.empty() == false)
    {
       cout << s.top() << " ";
       s.pop();
    }
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to check if successive 
// pair of numbers in the stack are 
// consecutive or not 
import java.util.*;
class GfG {
  
// Function to check if elements are 
// pairwise consecutive in stack 
static boolean pairWiseConsecutive(Stack<Integer> s) 
    // Transfer elements of s to aux. 
    Stack<Integer> aux = new Stack<Integer> (); 
    while (!s.isEmpty()) { 
        aux.push(s.peek()); 
        s.pop(); 
    
  
    // Traverse aux and see if 
    // elements are pairwise 
    // consecutive or not. We also 
    // need to make sure that original 
    // content is retained. 
    boolean result = true
    while (aux.size() > 1) { 
  
        // Fetch current top two 
        // elements of aux and check 
        // if they are consecutive. 
        int x = aux.peek(); 
        aux.pop(); 
        int y = aux.peek(); 
        aux.pop(); 
        if (Math.abs(x - y) != 1
        result = false
  
        // Push the elements to original 
        // stack. 
        s.push(x); 
        s.push(y); 
    
  
    if (aux.size() == 1
        s.push(aux.peek()); 
  
    return result; 
  
// Driver program 
public static void main(String[] args) 
    Stack<Integer> s = new Stack<Integer> (); 
    s.push(4); 
    s.push(5); 
    s.push(-2); 
    s.push(-3); 
    s.push(11); 
    s.push(10); 
    s.push(5); 
    s.push(6); 
    s.push(20); 
  
    if (pairWiseConsecutive(s)) 
        System.out.println("Yes"); 
    else
        System.out.println("No"); 
  
    System.out.println("Stack content (from top) after function call"); 
    while (s.isEmpty() == false
    
    System.out.print(s.peek() + " "); 
    s.pop(); 
    
  

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 program to check if successive 
# pair of numbers in the stack are 
# consecutive or not 
  
# Function to check if elements are 
# pairwise consecutive in stack 
def pairWiseConsecutive(s):
      
    # Transfer elements of s to aux. 
    aux = []
    while (len(s) != 0): 
        aux.append(s[-1]) 
        s.pop()
  
    # Traverse aux and see if elements 
    # are pairwise consecutive or not. 
    # We also need to make sure that 
    # original content is retained. 
    result = True
    while (len(aux) > 1): 
  
        # Fetch current top two 
        # elements of aux and check 
        # if they are consecutive. 
        x = aux[-1
        aux.pop() 
        y = aux[-1
        aux.pop() 
        if (abs(x - y) != 1): 
            result = False
  
        # append the elements to 
        # original stack. 
        s.append(x) 
        s.append(y)
  
    if (len(aux) == 1): 
        s.append(aux[-1]) 
  
    return result
  
# Driver Code
if __name__ == '__main__':
  
    s = []
    s.append(4
    s.append(5
    s.append(-2
    s.append(-3
    s.append(11
    s.append(10
    s.append(5
    s.append(6
    s.append(20
  
    if (pairWiseConsecutive(s)): 
        print("Yes"
    else:
        print("No")
  
    print("Stack content (from top)",
               "after function call"
    while (len(s) != 0):
        print(s[-1], end = " "
        s.pop()
  
# This code is contributed by PranchalK

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program to check if successive 
// pair of numbers in the stack are 
// consecutive or not 
using System;
using System.Collections.Generic; 
  
class GfG 
{
  
// Function to check if elements are 
// pairwise consecutive in stack 
static bool pairWiseConsecutive(Stack<int> s) 
    // Transfer elements of s to aux. 
    Stack<int> aux = new Stack<int> (); 
    while (s.Count != 0) 
    
        aux.Push(s.Peek()); 
        s.Pop(); 
    
  
    // Traverse aux and see if 
    // elements are pairwise 
    // consecutive or not. We also 
    // need to make sure that original 
    // content is retained. 
    bool result = true
    while (aux.Count > 1) 
    
  
        // Fetch current top two 
        // elements of aux and check 
        // if they are consecutive. 
        int x = aux.Peek(); 
        aux.Pop(); 
        int y = aux.Peek(); 
        aux.Pop(); 
        if (Math.Abs(x - y) != 1) 
            result = false
  
        // Push the elements to original 
        // stack. 
        s.Push(x); 
        s.Push(y); 
    
  
    if (aux.Count == 1) 
        s.Push(aux.Peek()); 
  
    return result; 
  
// Driver code 
public static void Main() 
    Stack<int> s = new Stack<int> (); 
    s.Push(4); 
    s.Push(5); 
    s.Push(-2); 
    s.Push(-3); 
    s.Push(11); 
    s.Push(10); 
    s.Push(5); 
    s.Push(6); 
    s.Push(20); 
  
    if (pairWiseConsecutive(s)) 
        Console.WriteLine("Yes"); 
    else
        Console.WriteLine("No"); 
  
    Console.WriteLine("Stack content (from top)" +
                        "after function call"); 
    while (s.Count != 0) 
    
        Console.Write(s.Peek() + " "); 
        s.Pop(); 
    
  
  
/* This code contributed by PrinciRaj1992 */

chevron_right



Output:

Yes
Stack content (from top) after function call
20 6 5 10 11 -3 -2 5 4 

Time complexity: O(n).
Auxiliary Space : O(n).

This article is contributed by Prakriti Gupta. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.



My Personal Notes arrow_drop_up



Article Tags :
Practice Tags :


1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.