Data Structures and Algorithms for Job Interviews

Other Books by Alejandro

1. Recommended Resources

Introduction

1. Who is this book for ?
2. What this book covers ?

Chapter 1: Bit Manipulation

1. Check whether a given number n is a power of 2 or 0
2. Count number of bits needed to be flipped to convert A to B
3. Find the two non-repeating elements in an array of repeating elements
4. Find the next greater and next smaller number with same number of set bits

Chapter 2: Dynamic Programming

1. 0-1 Knapsack Problem
2. Cutting Rod problem
3. Minimum number of edits (operations) required to convert ‘str1’ into ‘str2’
4. Given a 2-D matrix of 0s and 1s, find the Largest Square which contains all 1s in itself
5. Given two sequences, print the longest subsequence present in both of them.
6. Length of the longest subsequence in an array such that all elements of the subsequence are sorted in increasing order
7. Find minimum cost path in a matrix from (0,0) to given point (m,n)
8. Partition a set into two subsets such that the difference of subset sums is minimum
9. Minimum number of umbrellas of m different sizes required to accomodate N people
10. Determine if there is a subset of the given set with sum equal to given sum
11. Given a distance ‘dist, count total number of ways to cover the distance with 1, 2 and 3 steps

Chapter 3: Graph

1. Find all possible words in a board of characters
2. Breadth First Search Traversal
3. Depth First Search Traversal
4. Detect Cycle in directed graph
5. Detect cycle in undirected graph
6. Dijkstra’s Shortest Path Algorithm
7. Find shortest distances between each pair of vertices in a given edge weighted directed Graph
8. Graph implementation
9. Kruskal’s Algorithm for Minimum Spanning Tree
10. Topological Sort

Chapter 4: Heaps

1. Heap Sort algorithm
2. Max Heap implementation
3. Min Heap implementation
4. Find the median for an incoming stream of numbers after each insertion in the list of numbers

Chapter 5: Linked List

1. Clone a linked list with next and random pointer
2. Given a linked list of line segments, remove middle points if any
3. Construct a Maximum Sum Linked List out of two Sorted Linked Lists having some Common nodes.
4. Merge a linked list into another linked list at alternate positions
5. Perform Merge Sort
6. Point to next higher value node in a linked list with an arbitrary pointer
7. Find if linked list contains any cycle
8. To select a random node in a singly linked list
9. Find and remove cycle if any
10. Reverse alternate sub list of K nodes each
11. Reverse a linked list
12. Bring even valued nodes to the front
13. Implementation of Singly Linked List

Chapter 6: Mathematics

1. Fine the number of trailing zeros in factorial of a number
2. Find the greatest common divisor of 2 numbers
3. Print all prime factors of a given number
4. Sieve of Eratosthenes (find prime numbers up to n efficiently)

Chapter 7: Matrix

1. Given the Coordinates of King and Queen on a chessboard, check if queen threatens the king
2. Search in a row wise and column wise sorted matrix
3. Given a 2D array, print it in spiral form

Chapter 8: Strings or Arrays

1. Find the longest substring with k unique characters in a given string
2. Find a pattern in a string using KMP search algorithm
3. Find the Kth smallest element in the array
4. Find a pair in an array with sum x
5. Print all valid (properly opened and closed) combinations of n pairs of parentheses
6. Reverse the order of the words in the array
7. Find index of given number in a sorted array shifted by an unknown offset
8. Print all permutations of a given string
9. Linear Search in an array
10. Binary Search in an array
11. Interpolation Search in an array
12. Bubble sort Algorithm
13. Counting sort Algorithm (non-comparision based sorting)
14. Insertion sort Algorithm
15. Sort an array where each element is at most k places away from its sorted position
16. Merge Sort Algorithm
17. Quick Sort Algorithm using last element as pivot
18. Selection sort Algorithm

Chapter 9: Tree

1. Binary Search Tree implementation
2. Check if a given array can represent Preorder Traversal of Binary Search Tree
3. Find the in-order ancestor of a given node in BST
4. Find the Lowest Common Ancestor
5. Given a sorted array, create a BST with minimal height
6. Print Nodes in Bottom View of Binary Tree
7. Check if a binary tree is height balanced
8. Check whether a binary tree is a full binary tree or not
9. Given two binary trees, check if the first tree is subtree of the second one
10. Find the Lowest Common Ancestor in a Binary Tree
11. Create a list of all nodes at each depth
12. Find the maximum path sum i.e. max sum of a path in a binary tree
13. Find minimum depth of a binary tree
14. Remove nodes on root to leaf paths of length < K
15. Given a Perfect Binary Tree, reverse the alternate level nodes of the tree
16. Print Nodes in Top View of Binary Tree
17. Implementation of Trie data structure

Keep developing your programming skills

About the Author