Data Structures and Algorithms for Job Interviews
Data Structures and Algorithms for Job Interviews
Prep for the interview and get the job you want
About the Book
Land the Software Engineer job you want by mastering one of the most challenging questions you might face during the interview. This book is a collection of Data Structures and Algorithms to train and win the Interview.
Get ahead of the competition by solving a wide variety of coding problems !!
All the problems are solved in Python code.
The book is divided in 9 chapters covering:
- Bit Manipulation.
- Dynamic Programming.
- Graph.
- Heaps.
- Linked List.
- Mathematics.
- Matrix.
- Strings or Arrays.
- Tree.
Check out other books from the author:
Front End Developer Interview Questions
About the Author
Table of Contents
-
Other Books by Alejandro
- Recommended Resources
-
Introduction
- Who is this book for ?
- What this book covers ?
-
Chapter 1: Bit Manipulation
- Check whether a given number n is a power of 2 or 0
- Count number of bits needed to be flipped to convert A to B
- Find the two non-repeating elements in an array of repeating elements
- Find the next greater and next smaller number with same number of set bits
-
Chapter 2: Dynamic Programming
- 0-1 Knapsack Problem
- Cutting Rod problem
- Minimum number of edits (operations) required to convert ‘str1’ into ‘str2’
- Given a 2-D matrix of 0s and 1s, find the Largest Square which contains all 1s in itself
- Given two sequences, print the longest subsequence present in both of them.
- Length of the longest subsequence in an array such that all elements of the subsequence are sorted in increasing order
- Find minimum cost path in a matrix from (0,0) to given point (m,n)
- Partition a set into two subsets such that the difference of subset sums is minimum
- Minimum number of umbrellas of m different sizes required to accomodate N people
- Determine if there is a subset of the given set with sum equal to given sum
- Given a distance ‘dist, count total number of ways to cover the distance with 1, 2 and 3 steps
-
Chapter 3: Graph
- Find all possible words in a board of characters
- Breadth First Search Traversal
- Depth First Search Traversal
- Detect Cycle in directed graph
- Detect cycle in undirected graph
- Dijkstra’s Shortest Path Algorithm
- Find shortest distances between each pair of vertices in a given edge weighted directed Graph
- Graph implementation
- Kruskal’s Algorithm for Minimum Spanning Tree
- Topological Sort
-
Chapter 4: Heaps
- Heap Sort algorithm
- Max Heap implementation
- Min Heap implementation
- Find the median for an incoming stream of numbers after each insertion in the list of numbers
-
Chapter 5: Linked List
- Clone a linked list with next and random pointer
- Given a linked list of line segments, remove middle points if any
- Construct a Maximum Sum Linked List out of two Sorted Linked Lists having some Common nodes.
- Merge a linked list into another linked list at alternate positions
- Perform Merge Sort
- Point to next higher value node in a linked list with an arbitrary pointer
- Find if linked list contains any cycle
- To select a random node in a singly linked list
- Find and remove cycle if any
- Reverse alternate sub list of K nodes each
- Reverse a linked list
- Bring even valued nodes to the front
- Implementation of Singly Linked List
-
Chapter 6: Mathematics
- Fine the number of trailing zeros in factorial of a number
- Find the greatest common divisor of 2 numbers
- Print all prime factors of a given number
- Sieve of Eratosthenes (find prime numbers up to n efficiently)
-
Chapter 7: Matrix
- Given the Coordinates of King and Queen on a chessboard, check if queen threatens the king
- Search in a row wise and column wise sorted matrix
- Given a 2D array, print it in spiral form
-
Chapter 8: Strings or Arrays
- Find the longest substring with k unique characters in a given string
- Find a pattern in a string using KMP search algorithm
- Find the Kth smallest element in the array
- Find a pair in an array with sum x
- Print all valid (properly opened and closed) combinations of n pairs of parentheses
- Reverse the order of the words in the array
- Find index of given number in a sorted array shifted by an unknown offset
- Print all permutations of a given string
- Linear Search in an array
- Binary Search in an array
- Interpolation Search in an array
- Bubble sort Algorithm
- Counting sort Algorithm (non-comparision based sorting)
- Insertion sort Algorithm
- Sort an array where each element is at most k places away from its sorted position
- Merge Sort Algorithm
- Quick Sort Algorithm using last element as pivot
- Selection sort Algorithm
-
Chapter 9: Tree
- Binary Search Tree implementation
- Check if a given array can represent Preorder Traversal of Binary Search Tree
- Find the in-order ancestor of a given node in BST
- Find the Lowest Common Ancestor
- Given a sorted array, create a BST with minimal height
- Print Nodes in Bottom View of Binary Tree
- Check if a binary tree is height balanced
- Check whether a binary tree is a full binary tree or not
- Given two binary trees, check if the first tree is subtree of the second one
- Find the Lowest Common Ancestor in a Binary Tree
- Create a list of all nodes at each depth
- Find the maximum path sum i.e. max sum of a path in a binary tree
- Find minimum depth of a binary tree
- Remove nodes on root to leaf paths of length < K
- Given a Perfect Binary Tree, reverse the alternate level nodes of the tree
- Print Nodes in Top View of Binary Tree
- Implementation of Trie data structure
- Keep developing your programming skills
- About the Author
The Leanpub 45-day 100% Happiness Guarantee
Within 45 days of purchase you can get a 100% refund on any Leanpub purchase, in two clicks.
See full terms
Do Well. Do Good.
Authors have earned$10,891,199writing, publishing and selling on Leanpub, earning 80% royalties while saving up to 25 million pounds of CO2 and up to 46,000 trees.
Learn more about writing on Leanpub
Free Updates. DRM Free.
If you buy a Leanpub book, you get free updates for as long as the author updates the book! Many authors use Leanpub to publish their books in-progress, while they are writing them. All readers get free updates, regardless of when they bought the book or how much they paid (including free).
Most Leanpub books are available in PDF (for computers), EPUB (for phones and tablets) and MOBI (for Kindle). The formats that a book includes are shown at the top right corner of this page.
Finally, Leanpub books don't have any DRM copy-protection nonsense, so you can easily read them on any supported device.
Learn more about Leanpub's ebook formats and where to read them
Top Books
- #1
Functional event-driven architecture: Powered by Scala 3
Gabriel VolpeExplore the event-driven architecture (EDA) in a purely functional way, mainly powered by Fs2 streams in Scala 3!
Leverage your functional programming skills by designing and writing stateless microservices that scale, powered by stateful message brokers.
- #2
Practical FP in Scala: A hands-on approach
Gabriel VolpeA practical book aimed for those familiar with functional programming in Scala who are yet not confident about architecting an application from scratch.
Together, we will develop a purely functional application using the best libraries in the Cats ecosystem, while learning about design patterns and best practices.
- #3
Ansible for DevOps
Jeff GeerlingAnsible is a simple, but powerful, server and configuration management tool. Learn to use Ansible effectively, whether you manage one server—or thousands.
- #4
Book of Monads
Alejandro Serrano MenaIn functional programming, at the heart of input/output, failure, state, logic, and much more, lies a powerful abstraction called monad. This book provides a journey from the very first concepts, to the myriad of monads available to programmers, down to the categorical foundations.
- #5
Functional Programming Made Easier
Charles ScalfaniA Functional Programming book from beginner to advanced without skipping a single step along the way.
In my 40 years of programming, I've felt that programming books always let me down, especially Functional Programming books. So, I wrote the book I wish I had 5 years ago.
Functional Programming will never be easy, but it can be easier.
- #6
入門 日本語自然言語処理
Masato Hagiwara and Paul O'Leary McCann日本語テキストを処理したい全てのプログラマ・エンジニアの方へ。分かち書きなどの基本から、自然言語生成などの最新の話題までをカバー。動かして学べるコードや、参照文献も付いています。言語学や機械学習の知識が無くても問題ありません。
- #7
Introducing EventStorming
Alberto BrandoliniThe deepest tutorial and explanation about EventStorming, straight from the inventor.
- #8
Visualise, document and explore your software architecture
Simon BrownA short guide to visualising, documenting and exploring your software architecture.
- #9
Introduction to Japanese Natural Language Processing
Masato Hagiwara and Paul O'Leary McCannA thorough guide for programmers working with Japanese text, covering fundamental issues like tokenization and recent research topics like generating natural language texts. Working examples are accompanied by extensive reference to allow problem solving even without a background in Japanese or Machine Learning.
- #10
Cloud Strategy
Gregor Hohpe“Strategy is the difference between making a wish and making it come true.” A successful migration to the cloud can transform your organization, but it shouldn’t be driven by wishes. This book tells you how to develop a sound strategy guided by frameworks and decision models without being overly abstract nor getting lost in product details.
Top Bundles
- #1
Modern C++ Collection
3 Books
Get All about Modern C++C++ Standard Library, including C++20Concurrency with Modern C++, including C++20C++20Each book has about 200 complete code examples. Updates are included. When I update one of the books, you immediately get the updated bundle. You can expect significant updates to each new C++ standard (C++23, C++26, .. ) and also... - #2
Software Architecture for Developers: Volumes 1 & 2 - Technical leadership and communication
2 Books
"Software Architecture for Developers" is a practical and pragmatic guide to modern, lightweight software architecture, specifically aimed at developers. You'll learn:The essence of software architecture.Why the software architecture role should include coding, coaching and collaboration.The things that you really need to think about before... - #3
CCIE Service Provider Ultimate Study Bundle
2 Books
Piotr Jablonski, Lukasz Bromirski, and Nick Russo have joined forces to deliver the only CCIE Service Provider training resource you'll ever need. This bundle contains a detailed and challenging collection of workbook labs, plus an extensively detailed technical reference guide. All of us have earned the CCIE Service Provider certification... - #4
All the Books of The Medical Futurist
6 Books
We put together the most popular books from The Medical Futurist to provide a clear picture about the major trends shaping the future of medicine and healthcare. Digital health technologies, artificial intelligence, the future of 20 medical specialties, big pharma, data privacy, digital health investments and how technology giants such as Amazon... - #6
Abandon Your Job - Leaving the Rat Race with Python
8 Books
Now, get all the great Python and Freelancing books from finxter.com in one single bundle!Coffee Break Python - All Python BasicsCoffee Break Python Workbook - Practice the basics of PythonCoffee Break Python Mastery Workouts - Practice advanced Python conceptsCoffee Break Python Slicing - All about SlicingCoffee Break Python NumPy - Get started... - #8
Mastering Containers
2 Books
Docker and Kubernetes are taking the world by storm! These books will get you up-to-speed fast! Docker Deep Dive is over 400 pages long, and covers all objectives on the Docker Certified Associate exam.The Kubernetes Book includes everything you need to get up and running with Kubernetes! - #10
Pattern-Oriented Memory Forensics and Malware Detection
2 Books
This training bundle for security engineers and researchers, malware and memory forensics analysts includes two accelerated training courses for Windows memory dump analysis using WinDbg. It is also useful for technical support and escalation engineers who analyze memory dumps from complex software environments and need to check for possible...
