Skip to content

PrepBytes Blog

ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING

Log In

Log Out

Menu
  • Language
    • C
    • C++
    • Java
    • Javascript
    • Python
  • Data Structure
    • Array
    • Graphs
    • Heap
    • Linked List
    • Segment Tree
    • Stack
    • Trees
    • Queue
  • Algorithm
    • Backtracking
    • Dynamic Programming
    • Greedy Algorithm
    • RECURSION
    • Searching
    • Sorting
  • CSE Subjects
    • Operating System
  • Company Placement
  • Interview
    • Interview Tips
    • General Interview Questions
    • Algorithms
    • Data Structure
    • Languages
    • Other Topics
  • Competitive
    • Data Structure
      • Array
      • Graph
      • Heap
      • Segment Tree
      • Stack
      • Queue
      • Tree
      • Tries
    • Algorithm
      • Backtracking
      • Dynamic Programming
      • Greedy Algorithm
      • Searching
      • Sorting
    • Other Topics
      • Computational Geometry
      • Game Theory
      • Maths
      • Pointers
      • Recursion
      • String
  • Others
    • Computational Geometry
    • Game Theory
    • Hashing
    • Maths
    • Pointers
    • Recursion
    • String

Sign in to your account

Forgot your password?

New User? Create Account

Login via OTP

We will send you an one time password on your mobile number

New User? Create Account

Login via OTP

An OTP has been sent to your mobile number please verify it below

Resend OTP in 30 sec
Resend
New User? Create Account

Register with PrepBytes

I agree to the terms and conditions.
Already have a account? Login Here

Day: June 29, 2022

Queues

Advantages of Circular Queue over Linear Queue

Ankit KocharJune 29, 2022July 20, 2022
Linear Queue It is a linear data structure that works on the principle of FIFO (First in First out) i.e. the element which is enqueued first will be dequeued first....
Python

Merge two sorted arrays in Python using heapq

Ankit KocharJune 29, 2022July 6, 2022
Heap Heap Data structure primarily focuses on representing priority queue. In Python, there is an inbuilt module “heapq” which is used for implementing Heap data structure. By default, Min Heap...
Heap

Merge two Binary Max-Heaps

Ankit KocharJune 29, 2022June 29, 2022
Binary Max - Heap A binary max - heap follows two conditions: The given tree must be a complete binary tree (All levels are completely filled except the last level...
Heap

K-ary heap

Ankit KocharJune 29, 2022July 20, 2022
K-ary heaps are similar to the binary heap (where K = 2) just having one difference that instead of 2 child nodes, there can be k child nodes for every...
Stacks

Implement stack using Priority Queue or Heap

Ankit KocharJune 29, 2022December 14, 2022
What is a priority queue? The priority queue is a type of queue data structure having one extra feature of giving priority to every element present in the priority queue....
Heap

Fibonacci Heap – Insertion and Union

Abhishek SharmaJune 29, 2022
Fibonacci Heap: Fibonacci heap is a data structure which collectionis a collection of trees having max heap or min-heap properties. These two properties are the characteristics of the fibonacci heap...
Queues

Circular Queue in Data Structure

Abhishek SharmaJune 29, 2022January 30, 2023
In this Blog, we will talk about circular queue in data structure. We will cover the multiple approaches to implement circular queue in data structure. Also we will see the...
Queues

Priority queue in C++ STL

Abhishek SharmaJune 29, 2022July 20, 2022
Priority Queue: Priority queue is an abstract data type, It is a type of queue in which each element has a priority assigned to it. The priority of the element...
Queues

Priority Queue Introduction

Abhishek SharmaJune 29, 2022July 20, 2022
Priority Queue: Priority queue is an abstract data type, It is a type of queue in which each element has a priority assigned to it. The priority of the element...
Linked list articles

Priority Queue Using Linked List

Abhishek SharmaJune 29, 2022December 14, 2022
Priority Queue: Priority queue is an abstract data type, It is a type of queue in which each element has a priority assigned to it. The priority of the element...
Queues

Queue Introduction and Array Implementation

Abhishek SharmaJune 29, 2022July 20, 2022
Queue: A Queue is a linear data structure. Queue follows the FIFO rule i.e. First in First out. In other words we can say the element that goes in first...
Queues

Implementing Queue using Stacks

Ankit KocharJune 29, 2022February 2, 2023
In this tutorial, we will talk about a famous data structure problem “implement queue using stack”. Firstly, we will understand what stack and queue in data structure, then we will...
Queues

Stl Priority Queue For Structure Or Class

Abhishek SharmaJune 29, 2022July 20, 2022
Priority Queue: Priority queue is an abstract data type, It is a type of queue in which each element has a priority assigned to it. The priority of the element...

Pages

  • ALGORITHMS
  • ARRAY
  • BACKTRACKING
  • C PROGRAMMING LANGUAGE
  • C++ PROGRAMMING LANGUAGE
  • CAPGEMINI
  • CIRCULAR LINKED LIST
  • COMPANY PLACEMENT PROCEDURE
  • COMPETITIVE CODING
  • COMPUTATIONAL GEOMETRY
  • CSE SUBJECTS
  • DATA STRUCTURE
  • DOUBLY LINKED LIST
  • DYNAMIC PROGRAMMING
  • GAME THEORY
  • GRAPHS
  • GREEDY ALGORITHM
  • HASHING
  • HEAP
  • INTERVIEW PREPARATION
  • INTERVIEW TIPS
  • JAVA PROGRAMMING LANGUAGE
  • JAVASCRIPT PROGRAMMING LANGUAGE
  • Languages
  • LINKED LIST
  • LINKED LIST USING C
  • MATHEMATICS
  • OPERATING SYSTEM
  • POINTERS
  • PYTHON PROGRAMMING LANGUAGE
  • QUEUE
  • RECURSION
  • SEARCHING
  • SEGMENT TREE
  • SORTING
  • STACK
  • STRING
  • TREES

Recent Articles

  • 1
    February 3, 2023

    Local and Global Variables in Python

  • 2
    February 3, 2023

    Expression in Python

  • 3
    February 3, 2023

    FIFO Page Replacement Algorithm

  • 4
    February 3, 2023

    C Programs

  • 5
    February 2, 2023

    Floyd Warshall Algorithm

  • 6
    February 2, 2023

    Kruskal’s Algorithm

Close
Menu
  • Language
    • C
    • C++
    • Java
    • Javascript
    • Python
  • Data Structure
    • Array
    • Graphs
    • Heap
    • Linked List
    • Segment Tree
    • Stack
    • Trees
    • Queue
  • Algorithm
    • Backtracking
    • Dynamic Programming
    • Greedy Algorithm
    • RECURSION
    • Searching
    • Sorting
  • CSE Subjects
    • Operating System
  • Company Placement
  • Interview
    • Interview Tips
    • General Interview Questions
    • Algorithms
    • Data Structure
    • Languages
    • Other Topics
  • Competitive
    • Data Structure
      • Array
      • Graph
      • Heap
      • Segment Tree
      • Stack
      • Queue
      • Tree
      • Tries
    • Algorithm
      • Backtracking
      • Dynamic Programming
      • Greedy Algorithm
      • Searching
      • Sorting
    • Other Topics
      • Computational Geometry
      • Game Theory
      • Maths
      • Pointers
      • Recursion
      • String
  • Others
    • Computational Geometry
    • Game Theory
    • Hashing
    • Maths
    • Pointers
    • Recursion
    • String
FOLLOW US
CONTACT US
+91-8800 2588 17
contact@prepbytes.com
QUICK LINKS
Interview NotesMock TestsPlacement ProgrammeCoding CoursesMock InterviewAbout UsBlog