How to avoid 10 common mistakes in shell scripting

In this post, we will see 10 common syntactical mistakes that we do while writing a shell script. The prerequisite for this post is an EC2 instance for Linux OS on AWS, putty, or GitBash tool and knowledge of shell scripting. Below scenarios are common in shell scripting.

Want to make storage of docker persistent ?

Make storage of docker container permanent. wordpress and mysql database running on docker. docker-compose file . wordpress , mysql.

Getting Started with Docker

In this post we will seeing how someone can get started with Docker .Docker is a set of platform as a service products that uses OS-level virtualization to deliver software in packages called containers

Tower of Hanoi Using Recursion

Tower of Hanoi Using Recursion The tower of Hanoi is a famous puzzle where we have three rods and N disks. The objective of the puzzle is to move the entire stack to another rod. You are given the number of discs N. Initially, these discs are in the rod 1. You need to print all the steps of discs movement so that all the discs reach the 3rd rod. Also, you need to find the total moves. Note: The discs are arranged such that the top disc is numbered 1 and the bottom-most disc is numbered N. Also, all the discs have different sizes and a bigger disc cannot be put on the top of a smaller disc. Refer the provided link to get a better clarity about the puzzle.

Palindrome of String Using Recursion

Palindrome of String Using Recursion Company tags: Amazon, Cisco, D-E_Shaw, Facebook.. etc.

Rotate a matrix by 90 degree without using any extra space(Anticlockwise)

Rotate a matrix by 90 degree without using any extra space(Anticlockwise) (Asked by MICROSOFT, PAYTM, SAMSUNG, AMAZON, SNAPDEAL...)

Merge two sorted linked lists Hackerrank Solution.

Insert a node at a specific position in a linked list HackerRank Solution.

Insert a node at a specific position in a linked list HackerRank Solution. You’re given the pointer to the head node of a linked list, an integer to add to the list and the position at which the integer must be inserted. Create a new node with the given integer, insert this node at the desired position and return the head node.