Contains various technical interview questions and answers on data structures and algorithms, including binary search trees, linked lists, graphs, and string manipulation. Questions are solved only using Python and its standard library. Each file contains a question description, an example answer, and several test cases that are guaranteed to pass. Source of each question is noted where appropriate.
Example Questions:
- Determine if an anagram of string t is a substring of string s
- Find the least common ancestor of two nodes in a binary search tree
- Find the mth element from the end of a singly linked list
- Find the longest palindromic substring
- Find the mininum spanning tree in an undirected graph