interview

interview.md

Linked list

Problems:

• Find the middle element of a linked list. Can you do the work with one pass over the list? See here.

• Reverse a linked list. Can you reverse the list with O(1) space complexity? See here.

• Given a singly linked list, determine if it is a palindrome. Could you do it in O(n) time and O(1) space? See here.

• Given a linked list, determine if it has a cycle in it. Can you solve it using O(1) memory? See here.

• Merge two sorted linked lists. See here.

• Write a program to find the node at which the intersection of two singly linked lists begins. Can you solve the problem with O(1) space? See here.

Resources:

• Top 20 Linked List Interview Question
• Linked List Interview Questions and Practice Problems
• Top 30 Linked List Algorithm Questions from Programming/Coding Interviews

Trees

Problems:

• Find the Lowest Common Ancestor of two given nodes in a Binary Tree.

  • leetcode
  • Tushar Roy

• Binary Search Tree traversal - inorder, preorer and postorder

• Serialize and Deserialize a Binary Tree. See this.

• Binary Heap

  • Good explained here and here

• Prefix tree

  • explained here
  • practice and solution here

• Segment tree

• Given a binary tree, determine if it is a valid binary search tree (BST). See here.