Aj’s Guide To algorithm and Data Structure in C/ C++

Student Testimonials :

Rashmi says: This book has covered all the important topics for placement interviews.

Gowtam says: I have taken printout of the book and studied. Got placed in TCS !!

Vishal says: One stop shop for all the DSA topics, please write a Competitive Coding book

Introduction

Chapter 1: Introduction to algorithm and their types Chapter 2: Performance analysis of an algorithm: Space Complexity Chapter 3: Performance analysis of an algorithm: Time Complexity Chapter 4: Asymptotic Notations Chapter 5: Asymptotic Notation Big O Chapter 6: Asymptotic Notation Big Omega and Theta

Sorting Algorithms:

Sorting Algorithm 1: Bubble sort Sorting Algorithm 2: Selection Sort Sorting Algorithm 3: Insertion Sort Sorting Algorithm 4: Merge Sort Sorting Algorithm 5: Quick Sort Sorting Algorithm 6: Pigeonhole Sort Sorting Algorithm 7: 3-Way Quicksort (Dutch National Flag) algorithm Sorting Algorithm 8: Cocktail Sort Sorting Algorithm 9: Radix Sort Sorting Algorithm 10: Bucket Sort Sorting Algorithm 11: Counting Sort Sorting Algorithm 12: Shell Sort Sorting Algorithm 13: Topological sort Sorting Algorithm 14: Comb sort

Searching Algorithm

Searching Algorithm 1: Linear Search Searching Algorithm 2: Binary Search Searching Algorithm 3: Jump Search Searching Algorithm 4: Interpolation Search Searching Algorithm 5: Exponentail Search Searching Algorithm 6: Ternary Search

Basic Data Structures:

Data structure tutorial 1: Stack Data structure and Implementation using arrays. Data structure tutorial 2: Stack Data structure and Implementation using Linked List. Data structure tutorial 3: Singly Linked List. Data structure tutorial 4: Doubly Linked List [DLL] . Data structure tutorial 5: Circular Singly Linked List. Data structure tutorial 6: Circular Doubly Linked List. Data structure tutorial 7: Queue Data Structure with implementation using arrays. Data structure tutorial 8: Queue Data Structure with implementation using linked list. Data structure tutorial 9: Circular Queues Data structure with Implementation using arrays. Data structure tutorial 10: Circular Queue Data structure with Implementation using Linked List.

Trees Data Structure Tutorials:

Tree data structure tutorial 1. Tree DataStructure Introduction Tree data structure tutorial 2. Introduction to Binary Tree Tree data structure tutorial 3. Binary Tree Traversal Tree data structure tutorial 4. Binary Search Tree Introduction Tree data structure tutorial 5. Implementation of BST Tree data structure tutorial 6. Implementation of Binary tree Tree data structure tutorial 7. TRIE Data structure Tree data structure tutorial 8. Heaps Tree data structure tutorial 9. Priority Queue Tree data structure tutorial 10. AVL tree Tree data structure tutorial 11. Introduction m segment trees Tree data structure tutorial 12. Performing minimum Range query in Segment Tree and implemenation Tree data structure tutorial 13. Lazy propagation of segment trees Tree data structure tutorial 14. Fenwick trees and implemenation

Graph Data Structure Tutorials:

Graph data structure tutorial 1. Graph Introduction Graph data structure tutorial 2. Graph Representation Adjacency Matrix Graph data structure tutorial 3. Graph Representation Adjacency List Graph data structure tutorial 4. Graph Traversal
Graph data structure tutorial 5. Graph Traversal using Stack and Queue Graph data structure tutorial 6. Bipartite graph Graph data structure tutorial 7. Graph colouring problem Graph data structure tutorial 8. Isomorphic Graph
Graph data structure tutorial 9. Euler Graph Graph data structure tutorial 10. Hamiltonian Graph

Different types of problem solving technique

1. Brute force approach
2. Recursion
3. Dynamic programming approach
4. Backtracking approach
5. Greedy approach approach
6. Two pointer approach

Minimum Spanning Tree:

Mnimum Spanning Tree tutorial 1. Introduction to minimum spanning tree Mnimum Spanning Tree tutorial 2. Kruskals algorithm Mnimum Spanning Tree tutorial 3. Prims Algorithm

Find shortest path algorithm

Finding shortest path algorithm tutorial 1. Bellman ford Finding shortest path algorithm tutorial 2. Dijkstras Finding shortest path algorithm tutorial 3. Floyd warshalls

String matching algorithms

String matching algorithms tutorial 1. Knuth Morris Pratt String matching algorithm String matching algorithms tutorial 2. Rabin Karp algorithm String matching algorithms tutorial 3. Boyer–Moore string-search algorithm

Knapsack Problem:

1. Fractional knapsack
2. Knapsack

Additional Problems:

1. P, NP, NP hard, NP Complete
2. Tower of hanoi
3. Sieve of Eratosthenes
4. Kadane Algorithm
5. Sliding Window Approach
6. Travelling Salesman problem
7. Minimum Coin Change Problem
8. Total number of ways to get denomination of coins.
9. Job Sequencing problem
10. Activity Selection Problem
11. House Robber Problem

HR Interview questions and tips to answer them

1. Expectations on oncoming topics
2. Mistakes to avoid in an interview.
3. Tell me about yourself
4. Why should we hire you?
5. Why do you want to work for us?
6. What are your greatest strengths and weakness?
7. What are your greatest achievements/ accomplishments?
8. Any questions for us?
9. Where do you want to see yourself in 5 years?
10. How to you work under pressure?
11. How do you make important decisions?
12. What motivates you to do the best on job?
13. Do you prefer working alone or in a team?
14. What do you know about our company?
15. Are you planning for further studies?
16. What is your salary expectations?

Tips for Developers to improve their skills

1. How to prepare for coding interview in 3 months.
2. Tips to solve coding interview questions
3. How to write a resume for coding interview?
4. Tips to become good at programming

This is an ebook