nedushy123的专栏

Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, whe

Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For exa

#include#include#includeusing namespace std;void perm(int start,int end,vector in,vector > &res){ if(start==end) { res.push_back(in); return ;

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space?

#include#include#includeusing namespace std;void com(int depth,int n,int k,vector v,vector > &res){ if(v.size()==k) { res.push_back(v); return ;

#include#include#includeusing namespace std;vector plusOne(vector &digits){ int len=digits.size(); vector res(digits); int carrybit=1,i; for(i=len-1;i>=0;i--)

Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?

There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least on

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo

Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a timeEach intermediate word m

int sqrt(int x){return std::sqrt(x);}

There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without u