Vaibhav Gupta - OpenGenus IQ: Learn Computer Science

Find Minimum Swaps required for Bracket Balancing

Given a string of 2N characters consisting of N '[' brackets and N ']' brackets, our target is to find the minimum number of swaps required to make the set of brackets balanced.

Data Structures

Understand everything about Binary Search Tree

Binary search tree is a data structure that quickly allows us to maintain a sorted list of numbers in a tree data structure. It can be used to search for the presence of a number in O(log(n)) time and a simple traversal gives the numbers in sorted order.

Data Structures

Implementing Stack using queues in two ways

A stack is based on the principle of Last-in-First-Out(LIFO). It is commonly used abstract data type with two major operations, namely pop and push. Push() and pop() are carried out in the topmost element, which is the item most recently added to the stack. Push operation adds an element to stack

Software Engineering

Understand Inheritance in depth

Inheritance is the process by which objects of one class acquire the properties of objects of another class. It supports the concept of hierarchical classification. The different types of inheritance are single, multilevel, hierarchical, hybrid, multipath and multiple inheritance