Bitmask Interview Questions

Array Hash Table Math Dynamic Programming Bit Manipulation Meet in the Middle Bitmask

#10

Rank

#823HardFrequency: 34.3%

Split Array With Same Average

Asked at Microsoft

#11

Rank

#2162HardFrequency: 34.2%

Partition Array Into Two Arrays to Minimize Sum Difference

Array Two Pointers Binary Search Dynamic Programming Bit Manipulation Meet in the Middle Sorting Ordered Set Bitmask

#12

Rank

#3092MediumFrequency: 33%

Minimum Moves to Spread Stones Over Grid

Asked at TikTok

Array Dynamic Programming Backtracking Bit Manipulation Matrix Bitmask

#13

Rank

#3851HardFrequency: 31.3%

Find Sum of Array Product of Magical Sequences

Asked at Infosys

Array Math Dynamic Programming Bit Manipulation Combinatorics Bitmask

#14

Rank

#351MediumFrequency: 29.7%

Android Unlock Patterns

Dynamic Programming Backtracking Bit Manipulation Bitmask

#15

Rank

#877HardFrequency: 29.7%

Shortest Path Visiting All Nodes

Dynamic Programming Bit Manipulation Breadth-First Search Graph Theory Bitmask

#16

Rank

#691HardFrequency: 29.5%

Stickers to Spell Word

Asked at Meta

Array Hash Table String Dynamic Programming Backtracking Bit Manipulation Memoization Bitmask

#17

Rank

#1799HardFrequency: 27.3%

Minimum Incompatibility

Asked at Microsoft

Array Hash Table Dynamic Programming Bit Manipulation Bitmask

#18

Rank

#1825HardFrequency: 26.5%

Find Minimum Time to Finish All Jobs

Array Dynamic Programming Backtracking Bit Manipulation Bitmask

#19

Rank

#2322MediumFrequency: 25.4%

Number of Ways to Build Sturdy Brick Wall

#20

Rank

#1381HardFrequency: 25.1%

Maximum Score Words Formed by Letters

Array Hash Table String Dynamic Programming Backtracking Bit Manipulation Counting Bitmask

#21

Rank

#1418MediumFrequency: 25.1%

Fair Distribution of Cookies

Array Dynamic Programming Backtracking Bit Manipulation Bitmask

#22

Rank

#1587HardFrequency: 24.4%

Parallel Courses II

Dynamic Programming Bit Manipulation Graph Theory Bitmask Directed Acyclic Graph

#23

Rank

#2078MediumFrequency: 21.5%

Maximum Compatibility Score Sum

Asked at Meta

Array Dynamic Programming Backtracking Bit Manipulation Bitmask Hungarian Algorithm Bipartite Graph Successive Shortest Path Algorithm Matching (Graph)Perfect Matching Minimum-Cost Flow Flow Network

#24

Rank

#526MediumFrequency: 19.5%

Beautiful Arrangement

Array Dynamic Programming Backtracking Bit Manipulation Bitmask

#25

Rank

#1717HardFrequency: 18%

Minimum Cost to Connect Two Groups of Points

Array Dynamic Programming Bit Manipulation Matrix Bitmask Bipartite Graph Successive Shortest Path Algorithm Matching (Graph)Minimum-Cost Flow Flow Network

#26

Rank

#1758HardFrequency: 18%

Distribute Repeating Integers

Array Hash Table Dynamic Programming Backtracking Bit Manipulation Counting Bitmask

#27

Rank

#1924HardFrequency: 18%

Maximum Number of Groups Getting Fresh Donuts

Array Dynamic Programming Bit Manipulation Memoization Bitmask

#28

Rank

#2291HardFrequency: 18%

Maximum AND Sum of Array

#29

Rank

#1067MediumFrequency: 16.4%

Campus Bikes II

Array Dynamic Programming Backtracking Bit Manipulation Bitmask Hungarian Algorithm Bipartite Graph Successive Shortest Path Algorithm Matching (Graph)Minimum-Cost Flow Flow Network

#30

Rank

#980HardFrequency: 16.4%

Find the Shortest Superstring

Array String Dynamic Programming Bit Manipulation Bitmask Hamiltonian Path

#31

Rank

#3431HardFrequency: 14.6%

Find the Minimum Cost Array Permutation

#32

Rank

#2709MediumFrequency: 14.6%

Count the Number of Square-Free Subsets

Array Math Dynamic Programming Bit Manipulation Number Theory Bitmask

#33

Rank

#1471HardFrequency: 12.6%

Maximum Students Taking Exam

Array Dynamic Programming Bit Manipulation Matrix Bitmask Maximum Flow Maximum Matching Bipartite Graph Edmonds–Karp Algorithm MPM Algorithm Push-Relabel Algorithm Minimum Cut Matching (Graph)Flow Network Dinic's Algorithm

#34

Rank

#1881HardFrequency: 8.1%

Closest Subsequence Sum

Array Two Pointers Dynamic Programming Bit Manipulation Meet in the Middle Sorting Bitmask

#35

Rank

#3841HardFrequency: 8%

Concatenated Divisibility

Asked at Meta

#36

Rank

#2130MediumFrequency: 5.5%

Maximum Product of the Length of Two Palindromic Subsequences

String Dynamic Programming Backtracking Bit Manipulation Bitmask

#37

Rank

#3560HardFrequency: 5%

Maximum Number of Moves to Kill All Pawns

Array Math Bit Manipulation Breadth-First Search Game Theory Bitmask

#38

Rank

#3930HardFrequency: 5%

Longest Palindromic Path in Graph

String Dynamic Programming Bit Manipulation Graph Theory Bitmask

#39

Rank

#2114MediumFrequency: 5%

Minimum Number of Work Sessions to Finish the Tasks