LeetCode 332. Reconstruct ItineraryLeetCode-332 You are given a list of airline tickets where tickets[i] = [from, to] re

LeetCode 169. Majority ElementLeetCode-169 Given an array nums of size n, return the majority element. The majority elem

LeetCode 102. Binary Tree Level Order TraversalLeetCode-102 Given the root of a binary tree, return the level order trav

LeetCode 46. PermutationsLeetCode-46 Given an array nums of distinct integers, return all the possible permutations. You

LeetCode 491. Increasing SubsequencesLeetCode-491 Given an integer array nums, return all the different possible increas

LeetCode 78. SubsetsLeetCode-78 Given an integer array nums of unique elements, return all possible subsets (the power s

LeetCode 93. Restore IP AddressesLeetCode-93 Given a string s containing only digits, return all possible valid IP addre

LeetCode 94. Binary Tree Inorder TraversalLeetCode-94 Given the root of a binary tree, return the inorder traversal of i

LeetCode 131. Palindrome PartitioningLeetCode-131 Given a string s, partition s such that every substring of the partiti

LeetCode 39. Combination SumLeetCode-39 Given an array of distinct integers candidates and a target integer target, retu

LeetCode 77. CombinationsLeetCode-77 Given two integers n and k, return all possible combinations of k numbers out of th

LeetCode 50. PowLeetCode Implement pow(x, n), which calculates x raised to the power n. Example 1:Input: x = 2.00000, n