## HackerRank Solution – Problem Solving – Game of Two Stacks

Alexa has two stacks of non-negative integers, stack a[n] and stack b[m] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack a or stack b. Nick keeps a running sum of the… Read More »HackerRank Solution – Problem Solving – Game of Two Stacks

## HackerRank Solution – Problem Solving – Equal Stacks

You have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. This problem is given by Hacker Rank… Read More »HackerRank Solution – Problem Solving – Equal Stacks

## HackerRank Solution – Problem Solving – Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. The coding problem is defined in Hacker Rank platform. The problem can expand your Data Structure knowledge, as well as can helps you to crack Interviews. Two brackets are considered to be… Read More »HackerRank Solution – Problem Solving – Balanced Brackets

## HackerRank Solution – Problem Solving – Maximum Element

In this post we will solve the Maximum Element Problem give by Hacker Rank. It will give you insight to solve any Data Structure Problem. You have an empty sequence, and you will be given N queries. Each query is one of these three types: Function Description… Read More »HackerRank Solution – Problem Solving – Maximum Element

## Introduction Of Linear And Non Linear Data Structure

Linear data structure: A data structure is said to be linear if its data item form a linear sequence. Examples of the linear data structure are: (a) Array (b) Linked List (c) Stack (d) Queue Array: An array is a collection of data elements of… Read More »Introduction Of Linear And Non Linear Data Structure

## Basic Introduction Of Data Structures

Data structures: A data structure is a way of organizing data items such that data items can be accessed efficiently. Or A data structure is a way of organizing data items that considers not only the items stored, but also their relationship to each other.… Read More »Basic Introduction Of Data Structures

## Stack Push And Pop Operation

Here, We are performing push and pop operation of stack. #include<stdio.h> #include<conio.h> void push(); void pop(); void main() { int ch,c; clrscr(); do { printf(“\n***SELECT OPERATION OF STACK**\n”); printf(“\n1.PUSH OPERATION\n2.POP OPERATION\n”); printf(“\nEnter you choice::”); scanf(“%d”,&ch); switch(ch) { case 1: push(); break; case 2: pop(); break;… Read More »Stack Push And Pop Operation