1. Description2. SolutionVersion 1class Solution {public: bool isHappy(int n) { int

1. Description2. SolutionVersion 1class Solution {public: int findDuplicate(vector<int>& num

1. Description2. SolutionVersion 1class Solution {public: vector<int> findDisappearedNumbers

1. Description2. SolutionVersion 1class Solution {public: int removeElement(vector<int>& num

1. Description2. SolutionVersion 1class Solution {public: void moveZeroes(vector<int>& nums)

1. Description2. SolutionVersion 1class Solution {public: int findPeakElement(vector<int>& n

1. Description2. SolutionVersion 1class Solution {public: int countPrimes(int n) { i

1. Description2. SolutionVersion 1class Solution {public: string getHint(string secret, stri

1. Description2. SolutionVersion 1/** * Definition for singly-linked list. * struct ListNode {

1. Description2. SolutionVersion 1class Solution {public: void merge(vector<int>& nums1, int