not3

1st approachclass Solution {public: vector> subsets(vector& nums) { int n = nums.size(); int tablesize = pow(2,n); vector> res; vector arr(tablesize); for (int i = 0; i  solclass Solution {public: vector> subsets(vector& nums) { int n = nums.size(); int tablesize = pow(2, n); // 2^n possible subsets vector> res(tablesize); // Initial..

class Solution {public: int findKthLargest(vector& nums, int k) { priority_queue, greater> minheap; for(int i =0; iminheap.top()){ minheap.pop(); minheap.push(nums[i]); } } return minheap.top(); }};  1.create a min heap using priority queue. first parameter int is identifying the type of the variables in the heap...

You are given a string allowed consisting of distinct characters and an array of strings words. A string is consistent if all characters in the string appear in the string allowed.Return the number of consistent strings in the array words. Example 1:Input: allowed = "ab", words = ["ad","bd","aaab","baa","badab"] Output: 2 Explanation: Strings "aaab" and "baa" are consistent since they only conta..

if we want to declare and allocate the number "4" in an integer variable, the bit state will be something like "..0100".but the same number "4" in real number data types 4.0, the bit state will be very different. for ex.int a = 4 + 4.0; it can look like it is just 4+4=8, but because "a" is an int variable, the 4.0 float is type casted to an int, then added together to store integer "8" into vari..

Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You must write an algorithm with O(log n) runtime complexity.Example 1:Input: nums = [1,3,5,6], target = 5 Output: 2Example 2:Input: nums = [1,3,5,6], target = 2 Output: 1Example 3:Input: nums = [1,3,5,6], target = 7 Output..

You are given an array arr of positive integers. You are also given the array queries where queries[i] = [lefti, righti].For each query i compute the XOR of elements from lefti to righti (that is, arr[lefti] XOR arr[lefti + 1] XOR ... XOR arr[righti] ).Return an array answer where answer[i] is the answer to the ith query.Example 1:Input: arr = [1,3,4,8], queries = [[0,1],[1,2],[0,3],[3,3]]Output..

1 byte = 8 bits. 2^8 가지의 상태를 나타낼수있음.8비트를 2진수로 나타낸다면 0~255 를 표현가능 정수형: char(1), short(2), int(4), long(4), long long(8) (size in bytes)실수형: float(4), double(8) char 을 declare 할때 기본적으로 char은 signed이다.char라는 메모리공간 declare 할때unsigned char로 declare 하면 0~255char로 declare 하면 -128~127 range 를 표현하고싶다고 말하는것과같다char c1 = 0; //-128~127c1 = -1; bit 연산만약에 10의 음수인 bit 상태를 구하고싶을때10 + (-10) 을했을때 0이나오는 bit의상태를 그수의..