Darbar · Bit Manipulation 25 slots in the Leetcode Darbar catalog. Darbar Slot Problem Subtopic Difficulty 060 Count Number Of Maximum Bitwise Or Subsets backtracking medium 061 Letter Case Permutation backtracking medium 062 Subsets backtracking medium 063 Circular Permutation In Binary Representation backtracking medium 064 Beautiful Arrangement backtracking medium 065 Counting Bits dp based easy 066 Number Of Good Ways To Split A String dp based medium 067 Beautiful Arrangement dp based medium 068 Maximum Compatibility Score Sum dp based medium 069 Maximum Product Of The Length Of Two Palindromic Subsequences dp based medium 070 Count The Number Of Consistent Strings hashing easy 071 Divide Array Into Equal Pairs hashing easy 072 Longest Nice Substring hashing easy 073 Missing Number hashing easy 074 Find The Difference hashing easy 075 Power Of Two recursion easy 076 Power Of Four recursion easy 077 Maximum Points In An Archery Competition recursion medium 078 Number Of Steps To Reduce A Number To Zero simple bit manipulation easy 079 Decode Xored Array simple bit manipulation easy 080 Xor Operation In An Array simple bit manipulation easy 081 Count The Number Of Consistent Strings simple bit manipulation easy 082 Minimum Bit Flips To Convert Number simple bit manipulation easy 083 Longest Nice Substring sliding window easy 084 Repeated Dna Sequences sliding window medium All topics · Syllabus