Files

infosys.csv

1	ID	Title	URL	Is Premium	Acceptance %	Difficulty	Frequency %
2	1	Two Sum	/problems/two-sum	N	49.1%	Easy	1.8711%;
3	3	Longest Substring Without Repeating Characters	/problems/longest-substring-without-repeating-characters	N	33.8%	Medium	1.96468%;
4	5	Longest Palindromic Substring	/problems/longest-palindromic-substring	N	32.4%	Medium	23.0059%;
5	7	Reverse Integer	/problems/reverse-integer	N	27.2%	Medium	3.91579%;
6	15	3Sum	/problems/3sum	N	32.3%	Medium	3.1356%;
7	22	Generate Parentheses	/problems/generate-parentheses	N	71.9%	Medium	8.31998%;
8	62	Unique Paths	/problems/unique-paths	N	62.3%	Medium	8.19893%;
9	121	Best Time to Buy and Sell Stock	/problems/best-time-to-buy-and-sell-stock	N	54.4%	Easy	2.28302%;
10	125	Valid Palindrome	/problems/valid-palindrome	N	43.7%	Easy	4.05125%;
11	198	House Robber	/problems/house-robber	N	48.8%	Medium	14.6975%;
12	300	Longest Increasing Subsequence	/problems/longest-increasing-subsequence	N	51.6%	Medium	9.53401%;
13	315	Count of Smaller Numbers After Self	/problems/count-of-smaller-numbers-after-self	N	42.8%	Hard	43.7007%;
14	354	Russian Doll Envelopes	/problems/russian-doll-envelopes	N	38.3%	Hard	61.3063%;
15	387	First Unique Character in a String	/problems/first-unique-character-in-a-string	N	59.0%	Easy	9.24088%;
16	540	Single Element in a Sorted Array	/problems/single-element-in-a-sorted-array	N	58.5%	Medium	27.1132%;
17	560	Subarray Sum Equals K	/problems/subarray-sum-equals-k	N	44.0%	Medium	11.3171%;
18	871	Minimum Number of Refueling Stops	/problems/minimum-number-of-refueling-stops	N	39.9%	Hard	100%;
19	509	Fibonacci Number	/problems/fibonacci-number	N	69.2%	Easy	24.1511%;
20	2035	Partition Array Into Two Arrays to Minimize Sum Difference	/problems/partition-array-into-two-arrays-to-minimize-sum-difference	N	18.3%	Hard	80.6532%;