# Programming Puzzles ## Programming Puzzles - [Introduction](https://maksimdan.gitbook.io/interview-practice-problems/master.md) - [CTCI](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions.md) - [Arrays and Strings](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions1.md) - [Is Unique](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions1/is-unique.md) - [Check Permutation](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions1/check-permutation.md) - [URLify](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions1/urlify.md) - [Palindrome Permutation](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions1/palindrome-permutation.md) - [One Away](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions1/one-away.md) - [String Compression](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions1/string-compression.md) - [Rotate Matrix](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions1/rotate-matrix.md) - [Zero Matrix](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions1/zero-matrix.md) - [String Rotation](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions1/string-rotation.md) - [Linked Lists](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/linked_lists.md) - [Remove Dups](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/linked_lists/remove-dups.md) - [Return Kth to Last](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/linked_lists/return-kth-to-last.md) - [Delete Middle Node](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/linked_lists/delete-middle-node.md) - [Sum Lists](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/linked_lists/sum-lists.md) - [Palindrome](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/linked_lists/palindrome.md) - [Intersection](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/linked_lists/intersection.md) - [Trees](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions.md) - [Route Between Nodes](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions/route-between-nodes.md) - [Minimal Tree](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions/minimal-tree.md) - [Check Balanced](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions/check-balanced.md) - [Build Order](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions/build-order.md) - [First Common Ancestor](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions/first-common-ancestor.md) - [BST Sequences](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions/bst-sequences.md) - [Check Subtree](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions/check-subtree.md) - [Random Node](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions/random-node.md) - [Stacks and Queues](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/stacks_and_queues.md) - [Three in One](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/stacks_and_queues/three-in-one.md) - [Stack Min](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/stacks_and_queues/stack-min.md) - [Stack of Plates](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/stacks_and_queues/stack-of-plates.md) - [Queue via Stacks](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/stacks_and_queues/queue-via-stacks.md) - [Sort Stack](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/stacks_and_queues/sort-stack.md) - [Sorting and Searching](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_4.md) - [Sorted Merge](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_4/sorted-merge.md) - [Group Anagrams](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_4/group-anagrams.md) - [Search in Rotated Array](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_4/search-in-rotated-array.md) - [Sorted Search, No Size](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_4/sorted-search-no-size.md) - [Sparse Search](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_4/sparse-search.md) - [Sort Big File](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_4/sort-big-file.md) - [Missing Int](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_4/missing-int.md) - [Find Duplicates](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_4/find-duplicates.md) - [Sorted Matrix Search](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_4/sorted-matrix-search.md) - [Bit Manipulation](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_5.md) - [Insertion](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_5/insertion.md) - [Math and Puzzles](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/math_and_puzzles.md) - [Two Ropes](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/math_and_puzzles/two-ropes.md) - [Nine Balls](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/math_and_puzzles/nine-balls.md) - [The Heavy Pill](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/math_and_puzzles/the-heavy-pill.md) - [Basketball](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/math_and_puzzles/basketball.md) - [Dominos](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/math_and_puzzles/dominos.md) - [Recursion and Dynamic Programming](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/recursion_and_dynamic_programming.md) - [Triple Step](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/recursion_and_dynamic_programming/triple-step.md) - [Robot in a Grid](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/recursion_and_dynamic_programming/robot-in-a-grid.md) - [Magic Index](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/recursion_and_dynamic_programming/magic-index.md) - [Power Set](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/recursion_and_dynamic_programming/power-set.md) - [Recursive Multiply](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/recursion_and_dynamic_programming/recursive-multiply.md) - [Towers of Hanoi](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/recursion_and_dynamic_programming/towers-of-hanoi.md) - [Permutations without Dups](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/recursion_and_dynamic_programming/permutations-without-dups.md) - [Parens](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/recursion_and_dynamic_programming/parens.md) - [Paint Fill](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/recursion_and_dynamic_programming/paint-fill.md) - [Coins](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/recursion_and_dynamic_programming/coins.md) - [Object Oriented Design](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_7.md) - [Circular Array](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/interview_questions_7/circular-array.md) - [Moderate](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate.md) - [Number Swapper](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/number-swapper.md) - [Word Frequencies](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/word-frequencies.md) - [Intersection](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/intersection.md) - [Tic Tac Win](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/tic-tac-win.md) - [Factorial Zeros](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/factorial-zeros.md) - [Smallest Difference](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/smallest-difference.md) - [Number Max](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/number-max.md) - [Operations](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/operations.md) - [Living People](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/living-people.md) - [Diving Board](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/diving-board.md) - [Bisect Squares](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/bisect-squares.md) - [Best Line](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/best-line.md) - [Sub Sort](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/sub-sort.md) - [Contiguous Sequence](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/contiguous-sequence.md) - [Pattern Matching](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/pattern-matching.md) - [Pond sizes](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/pond-sizes.md) - [T9](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/t9.md) - [Sum Swap](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/sum-swap.md) - [Pairs with Sum](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/moderate/pairs-with-sum.md) - [Hard](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/hard.md) - [Add Without Plus](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/hard/add-without-plus.md) - [Shuffle](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/hard/shuffle.md) - [Random Set](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/hard/random-set.md) - [Count of 25](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/hard/count-of-25.md) - [Baby Names](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/hard/baby-names.md) - [Majority Element](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/hard/majority-element.md) - [Word Distance](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/hard/word-distance.md) - [The Masseuse](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/hard/the-masseuse.md) - [Word Transformer](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/hard/word-transformer.md) - [Sparse Similarity](https://maksimdan.gitbook.io/interview-practice-problems/coding_practice_questions/hard/sparse-similarity.md) - [EoPI](https://maksimdan.gitbook.io/interview-practice-problems/eopi.md) - [Arrays and Strings](https://maksimdan.gitbook.io/interview-practice-problems/eopi/arrays_and_strings.md) - [LeetCode](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions.md) - [3 Longest Substring Without Repeating Characters](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/3-longest-substring-without-repeating-characters.md) - [4 Median of Two Sorted Arrays](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/4-median-of-two-sorted-arrays.md) - [5 Longest Palindromic Substring](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/5-longest-palindromic-substring.md) - [6 ZigZag Conversion](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/6_zigzag_conversion.md) - [7 Reverse Integer](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/7_reverse_integer.md) - [8 String to Integer (atoi)](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/8-string-to-integer-atoi.md) - [9 Palindrome Number](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/9-palindrome-number.md) - [11 Container With Most Water](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/11-container-with-most-water.md) - [14 Longest Common Prefix](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/14_longest_common_prefix.md) - [15 3Sum](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/15_3sum.md) - [16 3Sum Closest](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/16_3sum_closest.md) - [17 Letter Combinations of a Phone Number](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/17-letter-combinations-of-a-phone-number.md) - [19 Remove Nth Node From End of List](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/19_remove_nth_node_from_end_of_list.md) - [20 Valid Parentheses](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/20_valid_parentheses.md) - [21 Merge Two Sorted Lists](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/21_merge_two_sorted_lists.md) - [22 Generate Parentheses](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/22-generate-parentheses.md) - [23 Merge k Sorted Lists](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/23_merge_k_sorted_lists.md) - [24 Swap Nodes in Pairs](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/24_swap_nodes_in_pairs.md) - [26 Remove Duplicates from Sorted Array](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/26_remove_duplicates_from_sorted_array.md) - [27 Remove Element](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/27_remove_element.md) - [28 Implement strStr()](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/28_implement_strstr.md) - [29 Divide Two Integers](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/29_divide_two_integers.md) - [30 Substring with Concatenation of All Words](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/30_substring_with_concatenation_of_all_words.md) - [32 Longest Valid Parentheses](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/32-longest-valid-parentheses.md) - [33 Search in Rotated Sorted Array](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/33_search_in_rotated_sorted_array.md) - [34 Search for a Range](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/34_search_for_a_range.md) - [35 Search Insert Position](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/35_search_insert_position.md) - [36 Valid Sudoku](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/36_valid_sudoku.md) - [37 Sudoku Solver](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/37_sudoku_solver.md) - [38 Count and Say](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/38_count_and_say.md) - [40 Combination Sum II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/40-combination-sum-ii.md) - [41 First Missing Positive](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/41-first-missing-positive.md) - [42 Trapping Rain Water](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/42_trapping_rain_water.md) - [43 Multiply Strings](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/43_multiply_strings.md) - [44 Wildcard Matching](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/44_wildcard_matching.md) - [45 Jump Game II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/45-jump-game-ii.md) - [46 Permutations](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/46-permutations.md) - [48 Rotate Image](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/48_rotate_image.md) - [49 Group Anagrams](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/49_group_anagrams.md) - [53 Maximum Subarray](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/53_maximum_subarray.md) - [54 Spiral Matrix](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/54_spiral_matrix.md) - [59 Spiral Matrix II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/59-spiral-matrix-ii.md) - [62 Unique Paths](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/62-unique-paths.md) - [64 Minimum Path Sum](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/64-minimum-path-sum.md) - [66 Plus One](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/66-plus-one.md) - [67 Add Binary](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/67-add-binary.md) - [68 Text Justification](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/68-text-justification.md) - [69 Sqrt(x)](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/69-sqrtx.md) - [70 Climbing Stairs](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/70_climbing_stairs.md) - [71 Simplify Path](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/71-simplify-path.md) - [73 Set Matrix Zeroes](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/73-set-matrix-zeroes.md) - [74 Search a 2D Matrix](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/74-search-a-2d-matrix.md) - [75 Sort Colors](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/75-sort-colors.md) - [80 Remove Duplicates from Sorted Array II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/80-remove-duplicates-from-sorted-array-ii.md) - [83 Remove Duplicates from Sorted List](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/83-remove-duplicates-from-sorted-list.md) - [90 Subsets II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/90-subsets-ii.md) - [91 Decode Ways](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/91-decode-ways.md) - [99 Recover Binary Search Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/99-recover-binary-search-tree.md) - [100 Same Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/100_same_tree.md) - [103 Binary Tree Zigzag Level Order Traversal](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/103-binary-tree-zigzag-level-order-traversal.md) - [104 Maximum Depth of Binary Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/104_maximum_depth_of_binary_tree.md) - [105 Construct Binary Tree from Preorder and Inorder Traversal](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/105-construct-binary-tree-from-preorder-and-inorder-traversal.md) - [112 Path Sum](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/112-path-sum.md) - [114 Flatten Binary Tree to Linked List](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/114_flatten_binary_tree_to_linked_list.md) - [119 Pascal's Triangle II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/119-pascals-triangle-ii.md) - [120 Triangle](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/120-triangle.md) - [128 Longest Consecutive Sequence](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/128-longest-consecutive-sequence.md) - [129 Sum Root to Leaf Numbers](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/129-sum-root-to-leaf-numbers.md) - [133 Clone Graph](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/133-clone-graph.md) - [136 Single Number](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/single_number_136.md) - [137 Single Number II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/137-single-number-ii.md) - [138 Copy List with Random Pointer](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/138-copy-list-with-random-pointer.md) - [144 Binary Tree Preorder Traversal](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/144_binary_tree_preorder_traversal.md) - [146 LRU Cache](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/146-lru-cache.md) - [148 Sort List](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/148-sort-list.md) - [150 Evaluate Reverse Polish Notation](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/150_evaluate_reverse_polish_notation.md) - [155 Min Stack](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/155-min-stack.md) - [157 Read N Characters Given Read4](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/157-read-n-characters-given-read4.md) - [161 One Edit Distance](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/161-one-edit-distance.md) - [162 Find Peak Element](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/162-find-peak-element.md) - [163 Missing Ranges](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/163-missing-ranges.md) - [167 Two Sum II - Input array is sorted](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/167_two_sum_ii_-_input_array_is_sorted.md) - [168 Excel Sheet Column Title](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/168_excel_sheet_column_title.md) - [170 Two Sum III - Data structure design](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/170-two-sum-iii-data-structure-design.md) - [173 Binary Search Tree Iterator](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/173-binary-search-tree-iterator.md) - [186 Reverse Words in a String II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/186-reverse-words-in-a-string-ii.md) - [189 Rotate Array](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/189-rotate-array.md) - [199 Binary Tree Right Side View](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/199-binary-tree-right-side-view.md) - [200 Number of Islands](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/200-number-of-islands.md) - [202 Happy Number](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/202-happy-number.md) - [207 Course Schedule](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/207-course-schedule.md) - [210 Course Schedule II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/210-course-schedule-ii.md) - [214 Shortest Palindrome](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/214-shortest-palindrome.md) - [216 Combination Sum III](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/216_combination_sum_iii.md) - [217 Contains Duplicate](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/217-contains-duplicate.md) - [221 Maximal Square](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/221-maximal-square.md) - [226 Invert Binary Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/226_invert_binary_tree.md) - [227 Basic Calculator II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/227-basic-calculator-ii.md) - [228 Summary Ranges](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/228-summary-ranges.md) - [229 Majority Element II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/229-majority-element-ii.md) - [230 Kth Smallest Element in a BST](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/230-kth-smallest-element-in-a-bst.md) - [234 Palindrome Linked List](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/234-palindrome-linked-list.md) - [236 Lowest Common Ancestor of a Binary Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/236-lowest-common-ancestor-of-a-binary-tree.md) - [237 Delete Node in a Linked List](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/237_delete_node_in_a_linked_list.md) - [239 Sliding Window Maximum](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/239-sliding-window-maximum.md) - [240 Search a 2D Matrix II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/240-search-a-2d-matrix-ii.md) - [242 Valid Anagram](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/242_valid_anagram.md) - [243 Shortest Word Distance](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/243_shortestword_distance.md) - [245 Shortest Word Distance III](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/245_shortestword_distance_iii.md) - [246 Strobogrammatic Number](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/246-strobogrammatic-number.md) - [247 Strobogrammatic Number II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/247-strobogrammatic-number-ii.md) - [253 Meeting Rooms II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/253-meeting-rooms-ii.md) - [255 Verify Preorder Sequence in Binary Search Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/255-verify-preorder-sequence-in-binary-search-tree.md) - [256 Paint House](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/256-paint-house.md) - [258 Add Digits](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/258_add_digits.md) - [260 Single Number III](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/260_single_number_iii.md) - [261 Graph Valid Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/261-graph-valid-tree.md) - [263 Ugly Number](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/263-ugly-number.md) - [264 Ugly Number II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/264-ugly-number-ii.md) - [266 Palindromic Permutation](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/palindromic_permutation_266.md) - [270 Closest Binary Search Tree Value](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/270-closest-binary-search-tree-value.md) - [271 Encode and Decode Strings](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/271-encode-and-decode-strings.md) - [277 Find the Celebrity](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/277-find-the-celebrity.md) - [279 Perfect Squares](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/279-perfect-squares.md) - [280 Wiggle Sort](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/280_wiggle_sort.md) - [281 Zigzag Iterator](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/281-zigzag-iterator.md) - [283 Move Zeroes](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/283_move_zeroes.md) - [284 Peeking Iterator](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/284-peeking-iterator.md) - [285 Inorder Successor in BST](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/285-inorder-successor-in-bst.md) - [286 Walls and Gates](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/286_walls_and_gates.md) - [288 Unique Word Abbreviation](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/288-unique-word-abbreviation.md) - [290 Word Pattern](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/290-word-pattern.md) - [292 Nim Game](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/nim_game_292.md) - [293 Flip Game](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/flip_game_293.md) - [296 Best Meeting Point](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/296_best_meeting_point.md) - [297 Serialize and Deserialize Binary Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/297-serialize-and-deserialize-binary-tree.md) - [298 Binary Tree Longest Consecutive Sequence](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/298-binary-tree-longest-consecutive-sequence.md) - [301 Remove Invalid Parentheses](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/301_remove_invalid_parentheses.md) - [304 Range Sum Query 2D - Immutable](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/304-range-sum-query-2d-immutable.md) - [310 Minimum Height Trees](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/310-minimum-height-trees.md) - [311 Sparse Matrix Multiplication](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/311_sparse_matrix_multiplication.md) - [312 Burst Balloons](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/312_burst_balloons.md) - [313 Super Ugly Number](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/313_super_ugly_number.md) - [315 Count of Smaller Numbers After Self](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/315-count-of-smaller-numbers-after-self.md) - [316 Remove Duplicate Letters](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/316_remove_duplicate_letters.md) - [317 Shortest Distance from All Buildings](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/317-shortest-distance-from-all-buildings.md) - [319 Bulb Switcher](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/319_bulb_switcher.md) - [322 Coin Change](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/322_coin_change.md) - [323 Number of Connected Components in an Undirected Graph](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/323-number-of-connected-components-in-an-undirected-graph.md) - [326 Power of Three](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/326-power-of-three.md) - [330 Patching Arrays](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/330_patching_arrays.md) - [333 Largest BST Subtree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/333-largest-bst-subtree.md) - [334 Increasing Triplet Subsequence](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/334-increasing-triplet-subsequence.md) - [335 Self Crossing](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/335_self_crossing.md) - [338 Counting Bits](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/338-counting-bits.md) - [340 Longest Substring with At Most K Distinct Characters](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/340-longest-substring-with-distinct-characters.md) - [344 Reverse String](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/344-reverse-string.md) - [345 Reverse Vowels of a String](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/345-reverse-vowels-of-a-string.md) - [346 Moving Average from Data Stream](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/346-moving-average-from-data-stream.md) - [347 Top K Frequent Elements](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/347_top_k_frequent_elements.md) - [349 Intersection of Two Arrays](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/349_intersection_of_two_arrays.md) - [356 Line Reflection](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/356-line-reflection.md) - [357 Count Numbers with Unique Digits](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/357-count-numbers-with-unique-digits.md) - [359 Logger Rate Limiter](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/359-logger-rate-limiter.md) - [361 Bomb Enemy](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/361_bomb_enemy.md) - [362 Design Hit Counter](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/362_design_hit_counter.md) - [366 Find Leaves of Binary Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/366-find-leaves-of-binary-tree.md) - [367 Valid Perfect Square](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/367_valid_perfect_square.md) - [369 Plus One Linked List](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/369-plus-one-linked-list.md) - [379 Design Phone Directory](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/379-design-phone-directory.md) - [387 First Unique Character in a String](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/387-first-unique-character-in-a-string.md) - [389 Find the Difference](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/389-find-the-difference.md) - [394 Decode String](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/394-decode-string.md) - [395 Longest Substring with At Least K Repeating Characters](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/395-longest-substring-with-at-least-k-repeating-characters.md) - [396 Rotate Function](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/396-rotate-function.md) - [399 Evaluate Division](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/399-evaluate-division.md) - [403 Frog Jump](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/403-frog-jump.md) - [404 Sum of Left Leaves](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/404-sum-of-left-leaves.md) - [406 Queue Reconstruction by Height](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/406-queue-reconstruction-by-height.md) - [409 Longest Palindrome](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/409-longest-palindrome.md) - [417 Pacific Atlantic Water Flow](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/417-pacific-atlantic-water-flow.md) - [418 Sentence Screen Fitting](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/418-sentence-screen-fitting.md) - [422 Valid Word Square](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/422-valid-word-square.md) - [425 Word Squares](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/425-word-squares.md) - [434 Number of Segments in a String](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/434-number-of-segments-in-a-string.md) - [435 Non-overlapping Intervals](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/435-non-overlapping-intervals.md) - [438 Find All Anagrams in a String](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/438-find-all-anagrams-in-a-string.md) - [441 Arranging Coins](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/441-arranging-coins.md) - [445 Add Two Numbers II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/445-add-two-numbers-ii.md) - [453 Minimum Moves to Equal Array Elements](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/453-minimum-moves-to-equal-array-elements.md) - [476 Number Complement](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/476-number-complement.md) - [482 License Key Formatting](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/482-license-key-formatting.md) - [494 Target Sum](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/494-target-sum.md) - [496 Next Greater Element I](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/496-next-greater-element-i.md) - [500 Keyboard Row](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/500-keyboard-row.md) - [503 Next Greater Element II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/503-next-greater-element-ii.md) - [505 The Maze II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/505-the-maze-ii.md) - [506 Relative Ranks](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/506-relative-ranks.md) - [507 Perfect Number](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/507-perfect-number.md) - [513 Find Bottom Left Tree Value](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/513-find-bottom-left-tree-value.md) - [514 Freedom Trail](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/514-freedom-trail.md) - [517 Super Washing Machines](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/517-super-washing-machines.md) - [523 Continuous Subarray Sum](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/523-continuous-subarray-sum.md) - [530 Minimum Absolute Difference in BST](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/530-minimum-absolute-difference-in-bst.md) - [531 Lonely Pixel I](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/531-lonely-pixel-i.md) - [534 Design TinyURL](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/534-design-tinyurl.md) - [545 Boundary of Binary Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/545-boundary-of-binary-tree.md) - [551 Student Attendance Record I](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/551-student-attendance-record-i.md) - [554 Brick Wall](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/554-brick-wall.md) - [563 Binary Tree Tilt](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/563-binary-tree-tilt.md) - [567 Permutation in String](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/567-permutation-in-string.md) - [572 Subtree of Another Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/572-subtree-of-another-tree.md) - [604 Design Compressed String Iterator](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/604-design-compressed-string-iterator.md) - [605 Can Place Flowers](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/605-can-place-flowers.md) - [606 Construct String from Binary Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/606-construct-string-from-binary-tree.md) - [624 Maximum Distance in Arrays](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/624-maximum-distance-in-arrays.md) - [630 Course Schedule III](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/630-course-schedule-iii.md) - [652 Find Duplicate Subtrees](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/652-find-duplicate-subtrees.md) - [654 Maximum Binary Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/654-maximum-binary-tree.md) - [657 Judge Route Circle](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/657-judge-route-circle.md) - [665 Non-decreasing Array](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/665-non-decreasing-array.md) - [669 Trim a Binary Search Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/669-trim-a-binary-search-tree.md) - [672 Bulb Switcher II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/672-bulb-switcher-ii.md) - [677 Map Sum Pairs](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/677-map-sum-pairs.md) - [681 Next Closest Time](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/681-next-closest-time.md) - [684 Redundant Connection](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/684-redundant-connection.md) - [686 Repeated String Match](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/686-repeated-string-match.md) - [690 Employee Importance](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/690-employee-importance.md) - [692 Top K Frequent Words](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/692-top-k-frequent-words.md) - [212 Word Search II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/212-word-search-ii.md) - [360 Sort Transformed Array](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/360-sort-transformed-array.md) - [616 Add Bold Tag in String](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/616-add-bold-tag-in-string.md) - [318 Maximum Product of Word Lengths](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/318-maximum-product-of-word-lengths.md) - [341 Flatten Nested List Iterator](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/341-flatten-nested-list-iterator.md) - [272 Closest Binary Search Tree Value II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/272-closest-binary-search-tree-value-ii.md) - [56 Merge Intervals](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/56-merge-intervals.md) - [215 Kth Largest Element in an Array](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/215-kth-largest-element-in-an-array.md) - [98 Validate Binary Search Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/98-validate-binary-search-tree.md) - [351 Android Unlock Patterns](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/351-android-unlock-patterns.md) - [289 Game of Life](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/289-game-of-life.md) - [575 Distribute Candies](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/575-distribute-candies.md) - [47 Permutations II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/47-permutations-ii.md) - [267 Palindrome Permutation II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/267-palindrome-permutation-ii.md) - [308 Range Sum Query 2D - Mutable](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/308-range-sum-query-2d-mutable.md) - [348 Design Tic-Tac-Toe](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/348-design-tic-tac-toe.md) - [68 Text Justification](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/68-text-justification-1.md) - [125 Valid Palindrome](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/125-valid-palindrome.md) - [139 Word Break](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/139-word-break.md) - [661 Image Smoother](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/661-image-smoother.md) - [485 Max Consecutive Ones](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/485-max-consecutive-ones.md) - [208 Implement Trie (Prefix Tree)](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/208-implement-trie-prefix-tree.md) - [140 Word Break II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/140_word_break_ii.md) - [487 Max Consecutive Ones II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/487-max-consecutive-ones-ii.md) - [61 Rotate List](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/61-rotate-list.md) - [498 Diagonal Traverse](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/498-diagonal-traverse.md) - [231 Power of Two](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/231-power-of-two.md) - [520 Detect Capital](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/520-detect-capital.md) - [473 Matchsticks to Square](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/473-matchsticks-to-square.md) - [127 Word Ladder](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/127-word-ladder.md) - [251 Flatten 2D Vector](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/251-flatten-2d-vector.md) - [244 Shortest Word Distance II](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/244-shortest-word-distance-ii.md) - [245 Shortest Word Distance III](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/245-shortest-word-distance-iii.md) - [423 Reconstruct Original Digits from English](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/423-reconstruct-original-digits-from-english.md) - [676 Implement Magic Dictionary](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/676-implement-magic-dictionary.md) - [332 Reconstruct Itinerary](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/332-reconstruct-itinerary.md) - [718 Maximum Length of Repeated Subarray](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/718-maximum-length-of-repeated-subarray.md) - [172 Factorial Trailing Zeroes](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/172-factorial-trailing-zeroes.md) - [713 Subarray Product Less Than K](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/713-subarray-product-less-than-k.md) - [36 Valid Sudoku](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/36-valid-sudoku.md) - [752 Open the Lock](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/752-open-the-lock.md) - [65 Valid Number](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/65-valid-number.md) - [760 Find Anagram Mappings](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/760-find-anagram-mappings.md) - [582 Kill Process](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/582-kill-process.md) - [594 Longest Harmonious Subsequence](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/594-longest-harmonious-subsequence.md) - [581 Shortest Unsorted Continuous Subarray](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/581-shortest-unsorted-continuous-subarray.md) - [599 Minimum Index Sum of Two Lists](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/599-minimum-index-sum-of-two-lists.md) - [635 Design Log Storage System](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/635-design-log-storage-system.md) - [642 Design Search Autocomplete System](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/642-design-search-autocomplete-system.md) - [379 Design Phone Directory](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/379-design-phone-directory-1.md) - [295 Find Median from Data Stream](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/295-find-median-from-data-stream.md) - [232 Implement Queue using Stacks](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/232-implement-queue-using-stacks.md) - [383 Ransom Note](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/383-ransom-note.md) - [278 First Bad Version](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/278-first-bad-version.md) - [206 Reverse Linked List](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/206-reverse-linked-list.md) - [787 Cheapest Flights Within K Stops](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/787-cheapest-flights-within-k-stops.md) - [818 Race Car](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/818-race-car.md) - [Categorical](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/catagorical.md) - [Array and Strings](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings.md) - [Max Avg Number](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/max-avg-number.md) - [Circular Array Cycle](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/circular-array-cycle.md) - [Molecular Weight](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/molecular-weight.md) - [Itoa](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/itoa.md) - [Average GPA](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/average-gpa.md) - [In Fibonacci Sequence](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/in-fibonacci-sequence.md) - [Shortest Rotated Distance](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/shortest-rotated-distance.md) - [Sub-array Factor](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/sub-array-factor.md) - [Matrix Convolution](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/matrix-convolution.md) - [Add One to Array](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/add-one-to-array.md) - [Sum Two Arrays](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/sum-array.md) - [Array Transformation](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/array_transformation.md) - [Unique Sub Arrays](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/unique-sub-arrays.md) - [Reverse and Simplify String](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/reverse-and-simplify-string.md) - [Reverse String](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/reverse-string.md) - [Information Masking](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/information-masking.md) - [Minimum Array Reduction](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/minimum-array-reduction.md) - [Add Numbers in Unclean Data](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/add-numbers-in-unclean-data.md) - [Array Operations](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/array-operations.md) - [Equilibrium Index](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/equilibrium-index.md) - [Visit All Places in Minimum Time](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/array-and-strings/visit-all-places-in-minimum-time.md) - [Linked List](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/linked-list.md) - [Double Linked List Connected Components](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/linked-list/double-linked-list-connected-components.md) - [Trees and Graphs](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs.md) - [Directory Sum](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/directory_sum.md) - [Largest Subtree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/largest-subtree.md) - [Shortest Path DAG Source to Sink](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/lowest-cost-path-in-graph-from-a-to-b.md) - [HTML Parser](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/html-parser.md) - [Infix to Postfix Expression Evaluater](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/infix-to-postfix-expression-evaluater.md) - [Longest Path in Undirected Acyclic Graph](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/longest-path-in-undirected-acyclic-graph.md) - [Decompress String](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/uncompress-string.md) - [Pythagoras Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/pythagoras-tree.md) - [Kings](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/kings.md) - [All Paths](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/all_paths.md) - [Leaf Nodes](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/leaf-nodes.md) - [Proper Locking](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/proper-locking.md) - [Number of Cities at each Distance](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/number-of-cities-at-each-distance.md) - [Root Path as DLL](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/root-path-as-dll.md) - [Binary Replacement](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/binary-replacement.md) - [All Root to Leaf Paths](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/trees-and-graphs/all_root_to_leaf_paths.md) - [Recursion and Dynamic Programming](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/recursion-and-dynamic-programming.md) - [Recursive to\_string](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/recursion-and-dynamic-programming/recursive_string.md) - [N Loop](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/recursion-and-dynamic-programming/n-loop.md) - [Divisible by Set](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/recursion-and-dynamic-programming/divisible-by-set.md) - [Brute Force Seam Carving](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/recursion-and-dynamic-programming/brute-force-seam-carving.md) - [Perimeter Island](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/recursion-and-dynamic-programming/perimeter-island.md) - [Knight on a Phone](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/recursion-and-dynamic-programming/knight-on-a-phone.md) - [Coin Change Problem](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/recursion-and-dynamic-programming/coin-change-problem.md) - [Maximum Product in Matrix](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/recursion-and-dynamic-programming/maximum-product-in-matrix.md) - [Largest Sum of a Path in a Triangle](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/recursion-and-dynamic-programming/largest-sum-of-a-path-in-a-triangle.md) - [Linked List Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/recursion-and-dynamic-programming/linked-list-tree.md) - [Sorting and Searching](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching.md) - [Three Highest Numbers](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/three-highest-numbers.md) - [Common Elements in Sorted Arrays](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/common-elements-in-sorted-arrays.md) - [Inverse Spiral Matrix](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/inverse-spiral-matrix.md) - [Number Negatives in Sorted Matrix](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/number-negatives-in-sorted-matrix.md) - [Number of Bombs in Minesweeper](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/number-of-bombs-in-minesweeper.md) - [Two Sum Less Than](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/two-sum-less-than.md) - [Frequency Compression](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/frequency-compression.md) - [N Closest Points](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/n-closest-points.md) - [Find Sum Pairs](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/find-sum-pairs.md) - [Max with no Comparitor](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/max-with-no-comparitor.md) - [Largest Subarray](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/largest-subarray.md) - [Single Missing Number](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/single-missing-number.md) - [Ternary Search](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/ternary-search.md) - [Fastest Frog Jump](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/sorting-and-searching/fastest-frog-jump.md) - [Design](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/design.md) - [Random Hash DS](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/design/random_hash_ds.md) - [Road Trip](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/design/road_trip.md) - [Load Balancer](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/design/load-balancer.md) - [Haircut Appointment Scheduler](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/design/haircut_appointment_scheduler.md) - [Conway's Game of Life](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/design/conways-game-of-life.md) - [Design Twitter](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/design/design_twitter.md) - [LogParser](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/design/logparser.md) - [Permission Management for a General Tree](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/design/permission-management-for-a-general-tree.md) - [Max Stack](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/design/max-stack.md) - [Parking Lot](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/design/parking-lot.md) - [Probability](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/probability.md) - [Simplified Blackjack](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/probability/simplified-blackjack.md) - [Rand7](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/probability/rand7.md) - [Shuffle](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/probability/shuffle.md) - [Combinatorics](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/combinatorics.md) - [Binary Permutation](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/combinatorics/binary-permutation.md) - [N Queens](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/combinatorics/n-queens.md) - [Prefix Permutation](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/combinatorics/prefix-permutation.md) - [Mathematics](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/mathematics.md) - [Angle Between Time](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/mathematics/angle-between-time.md) - [Line Segment Intersection](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/mathematics/line-segment-intersection.md) - [Maximum Points View Angle](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/mathematics/maximum-points-view-angle.md) - [Collatz Conjecture](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/mathematics/collatz-conjecture.md) - [Convex Hull](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/mathematics/convex-hull.md) - [Swap In Place](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/mathematics/swap-in-place.md) - [Powers of 2](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/mathematics/powers-of-2.md) - [Monte Carlo Approximation of PI](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/mathematics/monte-carlo-approximation-of-pi.md) - [Perfect Power](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/mathematics/perfect-power.md) - [Derivative of a Polynomial](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/mathematics/derivative-of-a-polynomial.md) - [Bit Manipulation](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/bit-manipulation.md) - [Reverse Binary](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/bit-manipulation/reverse-binary.md) - [Cryptography](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/cryptography.md) - [Message Encyption and Decryption](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/cryptography/message-encyption-and-decryption.md) - [Encryption](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/cryptography/encryption.md) - [Other](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/other.md) - [Maximum Time Combination](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/other/maximum-time-combination.md) - [Polish Notation String Calculator](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/other/polish-notation-string-calculator.md) - [Competition](https://maksimdan.gitbook.io/interview-practice-problems/competition.md) - [CodeDavis](https://maksimdan.gitbook.io/interview-practice-problems/competition/codedavis.md) - [Project Eular](https://maksimdan.gitbook.io/interview-practice-problems/project_eular.md) - [1 Multiples of 3 and 5](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/1_multiples_of_3_and_5.md) - [2 Even Fibonacci numbers](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/2_even_fibonacci_numbers.md) - [3 Largest Prime Factor](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/3_largest_prime_factor.md) - [4 Largest Palindrome Product](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/4_largest_palindrome_product.md) - [5 Smallest Multiple](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/5_smallest_multiple.md) - [6 Sum Square Difference](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/6_sum_square_difference.md) - [7 10001st Prime](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/7_10001st_prime.md) - [8 Largest Product in a Series](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/8_largest_product_in_a_series.md) - [9 Special Pythagorean Triplet](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/9_special_pythagorean_triplet.md) - [10 Summation of Primes](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/10_summation_of_primes.md) - [11 Largest Product in a Grid](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/11_largest_product_in_a_grid.md) - [12 Highly Divisible Triangular Number](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/12_highly_divisible_triangular_number.md) - [13 Large Sum](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/13_large_sum.md) - [14 Longest Collatz Sequence](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/14_longest_collatz_sequence.md) - [15 Lattice Paths](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/15_lattice_paths.md) - [16 Power Digit Sum](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/16_power_digit_sum.md) - [17 Number Letter Counts](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/17_number_letter_counts.md) - [18 Maximum path sum I](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/18_maximum_path_sum_i.md) - [19 Counting Sundays](https://maksimdan.gitbook.io/interview-practice-problems/project_eular/19_counting_sundays.md)