Scribd Logo
Upload

Welcome to Scribd!

    • 213 views

    Python & Leetcode - The Ultimate Interview Bootcamp: Strings

    Uploaded by

    Sam Flynn
    The document presents an overview of common data structures and algorithms questions from LeetCode organized into different categories such as Strings, Dynamic Programming, Arrays, Intervals, Matrix, Linked Lists, Trees and Graphs, and Heaps. It provides example LeetCode problems for each category and notes some problems marked as "Now You Try" that encourage practicing the concept. The document is intended as an interview bootcamp guide to help prepare for technical interviews.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Python & Leetcode - The Ultimate Interview Bootcamp: Strings

    Uploaded by

    Sam Flynn
    213 views3 pages
    The document presents an overview of common data structures and algorithms questions from LeetCode organized into different categories such as Strings, Dynamic Programming, Arrays, Intervals, Matrix, Linked Lists, Trees and Graphs, and Heaps. It provides example LeetCode problems for each category and notes some problems marked as "Now You Try" that encourage practicing the concept. The document is intended as an interview bootcamp guide to help prepare for technical interviews.

    Original Title

    code

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document presents an overview of common data structures and algorithms questions from LeetCode organized into different categories such as Strings, Dynamic Programming, Arrays, Intervals, Matrix, Linked Lists, Trees and Graphs, and Heaps. It provides example LeetCode problems for each category and notes some problems marked as "Now You Try" that encourage practicing the concept. The document is intended as an interview bootcamp guide to help prepare for technical interviews.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    213 views3 pages

    Python & Leetcode - The Ultimate Interview Bootcamp: Strings

    Uploaded by

    Sam Flynn
    The document presents an overview of common data structures and algorithms questions from LeetCode organized into different categories such as Strings, Dynamic Programming, Arrays, Intervals, Matrix, Linked Lists, Trees and Graphs, and Heaps. It provides example LeetCode problems for each category and notes some problems marked as "Now You Try" that encourage practicing the concept. The document is intended as an interview bootcamp guide to help prepare for technical interviews.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

     

     
    presents 

    Python & LeetCode | The Ultimate Interview Bootcamp 


     

    Strings 
    125 – ​Valid Palindrome 
    5 – ​Longest Palindromic Substring 
    3 – ​Longest Substring Without Repeating Characters 
    242 –​ Valid Anagram 
    49 – ​Group Anagrams 
    20 – ​Valid Parentheses 
    844 – ​Backspace String Compare​ – [Now You Try] 
    271 – ​Encode and Decode Strings 

    Dynamic Programming 
    70 – ​Climbing Stairs 
    198 – ​House Robber 
    55 – ​Jump Game 
    300 – ​Longest Increasing Subsequence 
    322 – ​Coin Change 
    62 – ​Unique Paths 

    Arrays 
    217 – ​Contains Duplicate 
    238 – ​Product of Array Except Self 
    11 –​ Container With Most Water 

    kaeducation.com 
    121 – ​Best Time to Buy and Sell Stock 
    1 – ​Two Sum 
    15 – ​3Sum 
    128 – ​Longest Consecutive Sequence 
    53 – ​Maximum Subarray 
    152 – ​Maximum Product Subarray 
    153 – ​Find Minimum in Rotated Sorted Array 

    Intervals 
    252 – ​Meeting Rooms 
    435 – ​Non-overlapping Intervals 
    56 – ​Merge Intervals 
    253 – ​Meeting Rooms II 

    Matrix 
    54 – ​Spiral Matrix 
    73 – ​Set Matrix Zeroes 
    79 – ​Word Search 

    Design 
    384 – ​Shuffle an Array 
    346 – ​Moving Average from Data Stream 
    303 – ​Range Sum Query - Immutable 
    155 – ​Min Stack 
    232 – ​Implement Queue using Stacks 
    380 – ​Insert Delete GetRandom O(1) 

    Linked Lists 
    206 – ​Reverse Linked List 
    141 – ​Linked List Cycle 
    876 – ​Middle of the Linked List​ – [Now You Try] 
    19 – ​Remove Nth Node From End of List 
    203 – ​Remove Linked List Elements​ – [Now You Try] 
    21 – ​Merge Two Sorted Lists 
    143 – ​Reorder List 
    138 – ​Copy List with Random Pointer 

    Trees and Graphs 


    200 – ​Number of Islands 
    226 – ​Invert Binary Tree 
    104 – ​Maximum Depth of Binary Tree 
    104 – ​Maximum Depth of Binary Tree​ (Iterative) – [Now You Try] 
    102 – ​Binary Tree Level Order Traversal 
    100 – ​Same Tree 
    572 – ​Subtree of Another Tree 
    kaeducation.com 
    98 – ​Validate Binary Search Tree 
    235 – ​Lowest Common Ancestor of a Binary Search Tree 
    230 – ​Kth Smallest Element in a BST 
    331 – ​Verify Preorder Serialization of a Binary Tree 
    208 – ​Implement Trie 
    211 – ​Add and Search Word 
    323 – ​Number of Connected Components in an Undirected Graph 
    Detect Cycle in Directed Graph – [Now You Try] 
    207 – ​Course Schedule 
    Detect Cycle in an Undirected Graph – [Now You Try] 
    261 – ​Graph Valid Tree 
    133 – ​Clone Graph 

    Heaps 
    215 – ​Kth Largest Element in an Array 
    973 – ​K Closest Points to Origin 
    347 – ​Top K Frequent Elements 
    23 – ​Merge k Sorted Lists 

    kaeducation.com 

    You might also like