Thursday, 14 May 2020

Reverse First K elements of Queue using STACK | Python

Prerequisite: Stacks and Queues using List | Data Structures | Python | Castor Classes https://www.youtube.com/watch?v=bMVBW... Python for beginners: https://www.youtube.com/watch?v=egq7Z...
Code:


def reverseK(queue,k,n):
    # code here
    stacka=[];
    queue2=queue[k:];
    i=0;
    while(i<k):
        f=queue.pop(0);
        stacka.append(f);
        i=i+1;
    queue=[];
    i=0;
    while(i<k):
        f=stacka.pop(-1);
        queue.append(f);
        i=i+1;
    queue=queue+queue2;
    return queue


Telegram: https://t.me/clcoding_python
https://www.facebook.com/pirawenpython/
https://www.facebook.com/groups/pirawenpython/

0 Comments:

Post a comment

Popular Posts

Categories

Android (21) AngularJS (1) Assembly Language (2) Books (10) C (75) C# (4) C++ (81) Data Strucures (4) Downloads (1) Engineering (13) FPL (17) Hadoop (1) HTML&CSS (38) IS (25) Java (87) Leet Code (4) PHP (20) Python (214) R (69) Selenium Webdriver (2) Software (14) SQL (27)