https://pankajpipada.com/tech-interview-prep/levels/ Recent content in Path: Levels on Tech Interview Prep Hugo en-us Copyright © 2016-Present Pankaj Pipada. All Rights Reserved. https://pankajpipada.com/tech-interview-prep/levels/problems/ Mon, 01 Jan 0001 00:00:00 +0000 https://pankajpipada.com/tech-interview-prep/levels/problems/ <h1 id="levels-problems">Levels: Problems<a class="anchor" href="#levels-problems">#</a></h1> <p>Work problems in increasing difficulty.</p> <ul><li> <a href="#level-0">Level 0</a> (4) </li><li> <a href="#level-1">Level 1</a> (7) </li><li> <a href="#level-2">Level 2</a> (12) </li><li> <a href="#level-3">Level 3</a> (20) </li><li> <a href="#level-4">Level 4</a> (26) </li><li> <a href="#level-5">Level 5</a> (12) </li></ul> <h2 id="level-0">Level 0</h2> <ul><li><a href="https://pankajpipada.com/tech-interview-prep/problems/contains-duplicate/">Contains duplicate</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/invert-binary-tree/">Invert a binary tree</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/maximum-depth-of-binary-tree/">Maximum depth of binary tree</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/two-sum/">Two sum</a></li></ul><h2 id="level-1">Level 1</h2> <ul><li><a href="https://pankajpipada.com/tech-interview-prep/problems/best-time-to-buy-and-sell-stock/">Best time to buy and sell stock</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/linked-list-cycle/">Linked list cycle</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/number-of-1-bits/">Number of 1 bits</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/reverse-linked-list/">Reverse linked list</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/sum-of-two-integers/">Sum of two integers</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/valid-anagram/">Valid anagram</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/valid-parentheses/">Valid parentheses</a></li></ul><h2 id="level-2">Level 2</h2> <ul><li><a href="https://pankajpipada.com/tech-interview-prep/problems/container-with-most-water/">Container with most water</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/find-minimum-in-rotated-sorted-array/">Find minimum in rotated sorted array</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/string-is-subsequence/">Is Subsequence</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/lowest-common-ancestor-of-a-bst/">Lowest common ancestor of a binary search tree</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/maximum-subarray/">Maximum subarray</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/missing-number/">Missing number</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/reverse-bits/">Reverse bits</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/same-tree/">Same tree</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/spiral-matrix/">Spiral matrix</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/three-sum/">Three sum</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/valid-palindrome/">Valid palindrome</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/validate-binary-search-tree/">Validate a binary search tree</a></li></ul><h2 id="level-3">Level 3</h2> <ul><li><a href="https://pankajpipada.com/tech-interview-prep/problems/binary-tree-level-order-traversal/">Binary tree level order traversal</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/climbing-stairs/">Climbing stairs</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/clone-graph/">Clone graph</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/coin-change/">Coin change</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/construct-binary-tree-from-preorder-and-inorder-traversal/">Construct binary tree from preorder and inorder traversal</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/group-anagrams/">Group anagrams</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/house-robber/">House robber</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/kth-smallest-element-in-a-bst/">Kth smallest element in a BST</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/maximum-product-subarray/">Maximum product subarray</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/merge-intervals/">Merge intervals</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/make-parentheses-valid/">Minimum Remove To Make Parentheses Valid</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/product-of-array-except-self/">Product of array except self</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/remove-nth-node-from-end-of-list/">Remove n&#39;th node from end of list</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/reorder-list/">Reorder list</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/rotate-image/">Rotate image</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/search-in-rotated-sorted-array/">Search in rotated sorted array</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/set-matrix-zeroes/">Set matrix zeroes</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/subtree-of-another-tree/">Subtree of another tree</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/top-k-frequent-elements/">Top k frequent elements</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/verify-lexicographic-sort-custom/">Verify Lexicographic Sort With Custom Alphabet</a></li></ul><h2 id="level-4">Level 4</h2> <ul><li><a href="https://pankajpipada.com/tech-interview-prep/problems/add-and-search-word/">Add and search word - data structure design</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/bigram-model-next-word-prediction/">Bigram Model - Next Word Prediction</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/combination-sum-iv/">Combination sum IV</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/counting-bits/">Counting bits</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/course-schedule/">Course schedule</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/decode-ways/">Decode ways</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/encode-and-decode-strings/">Encode and decode strings</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/eval-precedence-expression/">Evaluate Precedence Expression With &#43; And *</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/house-robber-ii/">House robber II</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/implement-trie-prefix-tree/">Implement trie (prefix tree)</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/level-order-binary-tree-insert/">Insert Into Complete Binary Tree (Level-Order)</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/jump-game/">Jump game</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/longest-increasing-subsequence/">Longest increasing subsequence</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/longest-palindromic-substring/">Longest palindromic substring</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/longest-repeating-character-replacement/">Longest repeating character replacement</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/longest-substring-without-repeating-characters/">Longest substring without repeating characters</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/meeting-rooms/">Meeting rooms</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/meeting-rooms-ii/">Meeting rooms II</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/non-overlapping-intervals/">Non overlapping intervals</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/number-of-islands/">Number of islands</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/pacific-atlantic-water-flow/">Pacific-Atlantic water flow</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/palindromic-substrings/">Palindromic substrings</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/set-card-game-validate-find/">SET Card Game - Validate Set And Find Set</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/unique-paths/">Unique paths</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/word-break/">Word break</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/word-search/">Word search</a></li></ul><h2 id="level-5">Level 5</h2> <ul><li><a href="https://pankajpipada.com/tech-interview-prep/problems/alien-dictionary/">Alien dictionary</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/binary-tree-maximum-path-sum/">Binary tree maximum path sum</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/count-distinct-subsequences/">Count Distinct Subsequences</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/find-median-from-data-stream/">Find median from data stream</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/graph-valid-tree/">Graph valid tree</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/insert-interval/">Insert interval</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/longest-consecutive-sequence/">Longest consecutive sequence</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/merge-k-sorted-lists/">Merge k sorted lists</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/minimum-window-substring/">Minimum window substring</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/number-of-connected-components-in-an-undirected-graph/">Number of connected components in an undirected graph</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/serialize-and-deserialize-binary-tree/">Serialize and deserialize a binary tree</a></li><li><a href="https://pankajpipada.com/tech-interview-prep/problems/word-search-ii/">Word search II</a></li></ul>