Pinterest Interview Questions — 49 DSA Problems

38 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Pinterest LeetCode questions for software engineering interviews.

• Count and Say (MEDIUM) — String
• Reconstruct Itinerary (HARD) — Depth-First Search, Graph, Eulerian Circuit
• Shortest Path in a Grid with Obstacles Elimination (HARD) — Array, Breadth-First Search, Matrix
• Optimal Account Balancing (HARD) — Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask
• Count Subarrays With Score Less Than K (HARD) — Array, Binary Search, Sliding Window, Prefix Sum
• Maximum Profit in Job Scheduling (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Bus Routes (HARD) — Array, Hash Table, Breadth-First Search
• Expression Add Operators (HARD) — Math, String, Backtracking
• Find Median from Data Stream (HARD) — Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream
• Shortest Way to Form String (MEDIUM) — Two Pointers, String, Binary Search, Greedy
• Is Subsequence (EASY) — Two Pointers, String, Dynamic Programming
• Reorganize String (MEDIUM) — Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting
• Longest Word in Dictionary (MEDIUM) — Array, Hash Table, String, Trie, Sorting
• Design Search Autocomplete System (HARD) — String, Depth-First Search, Design, Trie, Sorting, Heap (Priority Queue), Data Stream
• Find Median Given Frequency of Numbers (HARD) — Database
• Jump Game III (MEDIUM) — Array, Depth-First Search, Breadth-First Search
• Find K-th Smallest Pair Distance (HARD) — Array, Two Pointers, Binary Search, Sorting
• Coin Change (MEDIUM) — Array, Dynamic Programming, Breadth-First Search
• String Compression (MEDIUM) — Two Pointers, String
• Sparse Matrix Multiplication (MEDIUM) — Array, Hash Table, Matrix
• Meeting Rooms III (HARD) — Array, Hash Table, Sorting, Heap (Priority Queue), Simulation
• Target Sum (MEDIUM) — Array, Dynamic Programming, Backtracking
• Unique Paths II (MEDIUM) — Array, Dynamic Programming, Matrix
• Minimize Result by Adding Parentheses to Expression (MEDIUM) — String, Enumeration
• The Number of Weak Characters in the Game (MEDIUM) — Array, Stack, Greedy, Sorting, Monotonic Stack
• Is Graph Bipartite? (MEDIUM) — Depth-First Search, Breadth-First Search, Union Find, Graph
• Employee Free Time (HARD) — Array, Line Sweep, Sorting, Heap (Priority Queue)
• Unique Paths III (HARD) — Array, Backtracking, Bit Manipulation, Matrix
• Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
• Accounts Merge (MEDIUM) — Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union Find, Sorting
• Combination Sum (MEDIUM) — Array, Backtracking
• Split Array Largest Sum (HARD) — Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum
• Multiply Strings (MEDIUM) — Math, String, Simulation
• Letter Combinations of a Phone Number (MEDIUM) — Hash Table, String, Backtracking
• Possible Bipartition (MEDIUM) — Depth-First Search, Breadth-First Search, Union Find, Graph
• Single Element in a Sorted Array (MEDIUM) — Array, Binary Search
• Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
• Snakes and Ladders (MEDIUM) — Array, Breadth-First Search, Matrix
• The Maze (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Matrix
• Find the Celebrity (MEDIUM) — Two Pointers, Graph, Interactive
• Find First and Last Position of Element in Sorted Array (MEDIUM) — Array, Binary Search
• Shortest Path to Get All Keys (HARD) — Array, Bit Manipulation, Breadth-First Search, Matrix
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Candy Crush (MEDIUM) — Array, Two Pointers, Matrix, Simulation
• Dot Product of Two Sparse Vectors (MEDIUM) — Array, Hash Table, Two Pointers, Design
• Implement Trie (Prefix Tree) (MEDIUM) — Hash Table, String, Design, Trie
• Sudoku Solver (HARD) — Array, Hash Table, Backtracking, Matrix
• Find Minimum Time to Finish All Jobs (HARD) — Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask
• Smallest Range Covering Elements from K Lists (HARD) — Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue)