Given an array count max number of surpassers

Implement stack using linked list

Implement stack using an array

Implement Exponentiation using Bitwise Operator

Currency Exchange Problem as Shortest Path

Integer to English Words

Generate All Strings of n bits

Swap alternate nodes in a singly linked list

Split Linked List at the middle

Merge a Linked list into another at Alternate Positions