SYMBOL INDEX (372 symbols across 142 files)

FILE: 3Sum/3Sum.cpp
  class Solution (line 1) | class Solution {
    method threeSum (line 3) | vector<vector<int> > threeSum(vector<int> &num) {

FILE: 3SumClosest/3SumClosest.cpp
  class Solution (line 1) | class Solution {
    method threeSumClosest (line 3) | int threeSumClosest(vector<int> &num, int target) {

FILE: 4Sum/4Sum.cpp
  type twoSum (line 2) | struct twoSum {
    method twoSum (line 4) | twoSum(int _lf, int _rt, int _val)
  class Solution (line 11) | class Solution {
    method fourSum (line 13) | vector<vector<int>> fourSum(vector<int>& num, int target) {
    method find_lower_bound (line 46) | int find_lower_bound(vector<twoSum>& twosums, int l, int r, int val) {
    method find_upper_bound (line 56) | int find_upper_bound(vector<twoSum>& twosums, int l, int r, int val) {

FILE: AddBinary/AddBinary.cpp
  class Solution (line 1) | class Solution {
    method string (line 3) | string addBinary(string a, string b) {

FILE: AddTwoNumbers/AddTwoNumbers.cpp
  class Solution (line 9) | class Solution {
    method ListNode (line 11) | ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {

FILE: Anagrams/Anagrams.cpp
  class Solution (line 1) | class Solution {
    method anagrams (line 3) | vector<string> anagrams(vector<string> &strs) {

FILE: BalancedBinaryTree/BalancedBinaryTree.cpp
  class Solution (line 10) | class Solution {
    method isBalanced (line 12) | bool isBalanced(TreeNode *root) {
    method dfs (line 19) | int dfs(TreeNode* node, bool& flag) {

FILE: BestTimetoBuyandSellStock/BestTimetoBuyandSellStock.cpp
  class Solution (line 1) | class Solution {
    method maxProfit (line 3) | int maxProfit(vector<int> &prices) {

FILE: BestTimetoBuyandSellStockII/BestTimetoBuyandSellStockII.cpp
  class Solution (line 1) | class Solution {
    method maxProfit (line 3) | int maxProfit(vector<int>& prices) {
    method maxProfit2 (line 24) | int maxProfit2(vector<int> &prices) {

FILE: BestTimetoBuyandSellStockIII/BestTimetoBuyandSellStockIII.cpp
  class Solution (line 1) | class Solution {
    method maxProfit (line 3) | int maxProfit(vector<int> &prices) {

FILE: BinaryTreeInorderTraversal/BinaryTreeInorderTraversal.cpp
  class Solution (line 10) | class Solution {
    method inorderTraversal (line 12) | vector<int> inorderTraversal(TreeNode *root) {
    method inorderTraversal (line 39) | vector<int> inorderTraversal(TreeNode *root) {
  class Solution (line 37) | class Solution {
    method inorderTraversal (line 12) | vector<int> inorderTraversal(TreeNode *root) {
    method inorderTraversal (line 39) | vector<int> inorderTraversal(TreeNode *root) {

FILE: BinaryTreeLevelOrderTraversal/BinaryTreeLevelOrderTraversal.cpp
  class Solution (line 10) | class Solution {
    method levelOrder (line 12) | vector<vector<int> > levelOrder(TreeNode *root) {

FILE: BinaryTreeLevelOrderTraversalII/BinaryTreeLevelOrderTraversalII.cpp
  class Solution (line 10) | class Solution {
    method levelOrderBottom (line 12) | vector<vector<int> > levelOrderBottom(TreeNode *root) {

FILE: BinaryTreeMaximumPathSum/BinaryTreeMaximumPathSum.cpp
  class Solution (line 10) | class Solution {
    method maxPathSum (line 12) | int maxPathSum(TreeNode *root) {
    method dfs (line 21) | int dfs(TreeNode* node, int* maxsum) {

FILE: BinaryTreePostorderTraversal/BinaryTreePostorderTraversal.cc
  class Solution (line 10) | class Solution {
    method print (line 12) | void print(vector<int>& result, TreeNode* from, TreeNode* to) {
    method postorderTraversal (line 26) | vector<int> postorderTraversal(TreeNode *root) {

FILE: BinaryTreePreorderTraversal/BinaryTreePreorderTraversal.cpp
  class Solution (line 10) | class Solution {
    method preorderTraversal (line 12) | vector<int> preorderTraversal(TreeNode *root) {

FILE: BinaryTreeZigzagLevelOrderTraversal/BinaryTreeZigzagLevelOrderTraversal.cpp
  class Solution (line 10) | class Solution {
    method zigzagLevelOrder (line 12) | vector<vector<int>> zigzagLevelOrder(TreeNode *root) {

FILE: ClimbingStairs/ClimbingStairs.cpp
  class Matrix (line 3) | class Matrix {
    method Matrix (line 7) | Matrix() {}
    method Matrix (line 8) | Matrix(int _x00, int _x01, int _x10, int _x11)
    method Matrix (line 10) | Matrix operator * (const Matrix& o) {
  class Solution (line 20) | class Solution {
    method climbStairs (line 22) | int climbStairs(int n) {

FILE: CloneGraph/CloneGraph.cc
  class Solution (line 9) | class Solution {
    method UndirectedGraphNode (line 11) | UndirectedGraphNode* clone(UndirectedGraphNode* node, map<UndirectedGr...
    method UndirectedGraphNode (line 27) | UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {

FILE: CombinationSum/CombinationSum.cpp
  class Solution (line 1) | class Solution {
    method combinationSum (line 3) | vector<vector<int> > combinationSum(vector<int> &candidates, int targe...
    method DFS (line 14) | void DFS(vector<int>& nums, int target, vector<int>& candidates, int p...

FILE: CombinationSumII/CombinationSumII.cpp
  class Solution (line 1) | class Solution {
    method combinationSum2 (line 3) | vector<vector<int>> combinationSum2(vector<int>& candidates, int targe...
    method DFS (line 14) | void DFS(vector<int>& nums, int target, vector<int>& candidates, int p...

FILE: Combinations/Combinations.cpp
  class Solution (line 1) | class Solution {
    method combine (line 3) | vector<vector<int> > combine(int n, int k) {
    method DFS (line 13) | void DFS(vector<int>& comb, int step, int p, int k, int n, vector<vect...

FILE: ConstructBinaryTreefromInorderandPostorderTraversal/ConstructBinaryTreefromInorderandPostorderTraversal.cpp
  class Solution (line 10) | class Solution {
    method TreeNode (line 12) | TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder) {
    method TreeNode (line 18) | TreeNode* dfs(vector<int>& inorder, int l1, int r1, vector<int>& posto...

FILE: ConstructBinaryTreefromPreorderandInorderTraversal/ConstructBinaryTreefromPreorderandInorderTraversal.cpp
  class Solution (line 10) | class Solution {
    method TreeNode (line 12) | TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) {
    method TreeNode (line 19) | TreeNode* dfs(vector<int>& preorder, int l1, int r1, vector<int>& inor...

FILE: ContainerWithMostWater/ContainerWithMostWater.cpp
  class Solution (line 1) | class Solution {
    method maxArea (line 3) | int maxArea(vector<int>& height) {

FILE: ConvertSortedArraytoBinarySearchTree/ConvertSortedArraytoBinarySearchTree.cpp
  class Solution (line 10) | class Solution {
    method TreeNode (line 12) | TreeNode *sortedArrayToBST(vector<int> &num) {
    method TreeNode (line 15) | TreeNode* dfs(vector<int>& num, int start, int limit) {

FILE: ConvertSortedListtoBinarySearchTree/ConvertSortedListtoBinarySearchTree.cpp
  class Solution (line 18) | class Solution {
    method TreeNode (line 20) | TreeNode *sortedListToBST(ListNode *head) {

FILE: CountandSay/CountandSay.cpp
  class Solution (line 1) | class Solution {
    method string (line 3) | string countAndSay(int n) {

FILE: DecodeWays/DecodeWays.cpp
  class Solution (line 1) | class Solution {
    method numDecodings (line 3) | int numDecodings(string s) {

FILE: DistinctSubsequences/DistinctSubsequences.cpp
  class Solution (line 1) | class Solution {
    method numDistinct (line 3) | int numDistinct(string S, string T) {

FILE: DivideTwoIntegers/DivideTwoIntegers.cpp
  class Solution (line 1) | class Solution {
    method divide (line 3) | int divide(int dividend, int divisor) {

FILE: EditDistance/EditDistance.cpp
  class Solution (line 1) | class Solution {
    method minDistance (line 3) | int minDistance(string word1, string word2) {

FILE: EvaluateReversePolishNotation/EvaluateReversePolishNotation.cpp
  class Solution (line 1) | class Solution {
    method evalRPN (line 3) | int evalRPN(vector<string> &tokens) {

FILE: FirstMissingPositive/FirstMissingPositive.cpp
  class Solution (line 1) | class Solution {
    method firstMissingPositive (line 3) | int firstMissingPositive(int A[], int n) {

FILE: FlattenBinaryTreetoLinkedList/FlattenBinaryTreetoLinkedList.cpp
  class Solution (line 10) | class Solution {
    method flatten (line 12) | void flatten(TreeNode *root) {
    method flatten (line 46) | void flatten(TreeNode *root) {
    method dfs (line 50) | pair<TreeNode*, TreeNode*> dfs(TreeNode* root) {
  class Solution (line 44) | class Solution {
    method flatten (line 12) | void flatten(TreeNode *root) {
    method flatten (line 46) | void flatten(TreeNode *root) {
    method dfs (line 50) | pair<TreeNode*, TreeNode*> dfs(TreeNode* root) {

FILE: GenerateParentheses/GenerateParentheses.cpp
  class Solution (line 1) | class Solution {
    method generateParenthesis (line 3) | vector<string> generateParenthesis(int n) {
    method dfs (line 12) | void dfs(vector<string>& result, string& s, int left, int right) {

FILE: GrayCode/GrayCode.cpp
  class Solution (line 1) | class Solution {
    method grayCode (line 3) | vector<int> grayCode(int n) {
    method grayCode (line 17) | vector<int> grayCode(int n) {
  class Solution (line 15) | class Solution {
    method grayCode (line 3) | vector<int> grayCode(int n) {
    method grayCode (line 17) | vector<int> grayCode(int n) {

FILE: ImplementstrStr/ImplementstrStr.cpp
  class Solution (line 1) | class Solution {

FILE: InsertInterval/InsertInterval.cpp
  class Solution (line 10) | class Solution {
    method insert (line 12) | vector<Interval> insert(vector<Interval> &intervals, Interval newInter...

FILE: IntegertoRoman/IntegertoRoman.cpp
  class Solution (line 1) | class Solution {
    method string (line 3) | string intToRoman(int num) {
    method appendRoman (line 20) | void appendRoman(int n, string& s, char symbol[]) {

FILE: InterleavingString/InterleavingString.cpp
  class Solution (line 1) | class Solution {
    method isInterleave (line 3) | bool isInterleave(string s1, string s2, string s3) {

FILE: JumpGame/JumpGame.cpp
  class Solution (line 1) | class Solution {
    method canJump (line 3) | bool canJump(int A[], int n) {

FILE: JumpGameII/JumpGameII.cpp
  class Solution (line 1) | class Solution {
    method jump (line 3) | int jump(int A[], int n) {

FILE: LRUCache/LRUCache.cc
  class LRUCache (line 1) | class LRUCache{
    method LRUCache (line 3) | LRUCache(int capacity) {
    method get (line 9) | int get(int key) {
    method set (line 22) | void set(int key, int value) {
    type entry (line 50) | struct entry {
    type entry (line 59) | struct entry

FILE: LargestRectangleinHistogram/LargestRectangleinHistogram.cpp
  class Solution (line 1) | class Solution {
    method largestRectangleArea (line 3) | int largestRectangleArea(vector<int>& height) {

FILE: LengthofLastWord/LengthofLastWord.cpp
  class Solution (line 1) | class Solution {
    method lengthOfLastWord (line 3) | int lengthOfLastWord(const char *s) {

FILE: LetterCombinationsofaPhoneNumber/LetterCombinationsofaPhoneNumber.cpp
  class Solution (line 1) | class Solution {
    method letterCombinations (line 3) | vector<string> letterCombinations(string digits) {
    method dfs (line 19) | void dfs(vector<string>& result, string& letter, string& digits, int p...

FILE: LongestCommonPrefix/LongestCommonPrefix.cpp
  class Solution (line 1) | class Solution {
    method string (line 3) | string longestCommonPrefix(vector<string> &strs) {

FILE: LongestConsecutiveSequence/LongestConsecutiveSequence.cpp
  class Solution (line 1) | class Solution {
    method longestConsecutive (line 3) | int longestConsecutive(vector<int> &num) {
    method longestConsecutive (line 34) | int longestConsecutive(vector<int> &num) {
  class Solution (line 32) | class Solution {
    method longestConsecutive (line 3) | int longestConsecutive(vector<int> &num) {
    method longestConsecutive (line 34) | int longestConsecutive(vector<int> &num) {

FILE: LongestPalindromicSubstring/LongestPalindromicSubstring.cpp
  class Solution (line 1) | class Solution {
    method string (line 3) | string longestPalindrome(string s) {

FILE: LongestSubstringWithoutRepeatingCharacters/LongestSubstringWithoutRepeatingCharacters.cpp
  class Solution (line 1) | class Solution {
    method lengthOfLongestSubstring (line 3) | int lengthOfLongestSubstring(string s) {

FILE: LongestValidParentheses/LongestValidParentheses.cpp
  class Solution (line 1) | class Solution {
    method longestValidParentheses (line 3) | int longestValidParentheses(string s) {

FILE: MaxPointsOnALine/MaxPointsOnALine.cpp
  class Solution (line 25) | class Solution {
    method maxPoints (line 27) | int maxPoints(vector<Point> &points) {
    method gcd (line 69) | int gcd(int a, int b) {

FILE: MaximalRectangle/MaximalRectangle.cpp
  class Solution (line 1) | class Solution {
    method maximalRectangle (line 3) | int maximalRectangle(vector<vector<char> > &matrix) {
    method getLargestRectInHistogram (line 28) | int getLargestRectInHistogram(const int height[], int n) {

FILE: MaximumDepthofBinaryTree/MaximumDepthofBinaryTree.cpp
  class Solution (line 10) | class Solution {
    method maxDepth (line 12) | int maxDepth(TreeNode *root) {

FILE: MaximumProductSubarray/MaximumProductSubarray.cpp
  class Solution (line 1) | class Solution {
    method maxProduct (line 3) | int maxProduct(int A[], int n) {

FILE: MaximumSubarray/MaximumSubarray.cpp
  class Solution (line 1) | class Solution {
    method maxSubArray (line 3) | int maxSubArray(int A[], int n) {
    method maxSubArray (line 23) | int maxSubArray(int A[], int n) {
    method maxSubArray (line 30) | int maxSubArray(int A[], int left, int right) {
  class Solution (line 21) | class Solution {
    method maxSubArray (line 3) | int maxSubArray(int A[], int n) {
    method maxSubArray (line 23) | int maxSubArray(int A[], int n) {
    method maxSubArray (line 30) | int maxSubArray(int A[], int left, int right) {

FILE: MedianofTwoSortedArrays/MedianofTwoSortedArrays.cpp
  class Solution (line 1) | class Solution {
    method findMedianSortedArrays (line 3) | double findMedianSortedArrays(int A[], int m, int B[], int n) {
    method findKth (line 12) | int findKth(int k, int A[], int l1, int r1, int B[], int l2, int r2) {

FILE: MergeIntervals/MergeIntervals.cpp
  class Solution (line 18) | class Solution {
    method merge (line 20) | vector<Interval> merge(vector<Interval> &intervals) {

FILE: MergeSortedArray/MergeSortedArray.cpp
  class Solution (line 1) | class Solution {
    method merge (line 3) | void merge(int A[], int m, int B[], int n) {

FILE: MergeTwoSortedLists/MergeTwoSortedLists.cpp
  class Solution (line 9) | class Solution {
    method ListNode (line 11) | ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {

FILE: MergekSortedLists/MergekSortedLists.cpp
  class Solution (line 9) | class Solution {
    method ListNode (line 11) | ListNode *mergeKLists(vector<ListNode *> &lists) {
    method ListNode (line 14) | ListNode* merge(vector<ListNode*>& lists, int left, int right) {

FILE: MinimumDepthofBinaryTree/MinimumDepthofBinaryTree.cpp
  class Solution (line 10) | class Solution {
    method minDepth (line 12) | int minDepth(TreeNode *root) {

FILE: MinimumPathSum/MinimumPathSum.cpp
  class Solution (line 1) | class Solution {
    method minPathSum (line 3) | int minPathSum(vector<vector<int>>& grid) {
    method minPathSum (line 30) | int minPathSum(vector<vector<int> > &grid) {
  class Solution (line 28) | class Solution {
    method minPathSum (line 3) | int minPathSum(vector<vector<int>>& grid) {
    method minPathSum (line 30) | int minPathSum(vector<vector<int> > &grid) {

FILE: MinimumWindowSubstring/MinimumWindowSubstring.cpp
  class Solution (line 1) | class Solution {
    method string (line 3) | string minWindow(string S, string T) {

FILE: MultiplyStrings/MultiplyStrings.cpp
  class Solution (line 1) | class Solution {
    method string (line 3) | string multiply(string num1, string num2) {

FILE: N-Queens/N-Queens.cpp
  class Solution (line 1) | class Solution {
    method solveNQueens (line 3) | vector<vector<string> > solveNQueens(int n) {
    method dfs (line 14) | void dfs(vector<vector<string>>& result, vector<string>& sol,  vector<...

FILE: N-QueensII/N-QueensII.cpp
  class Solution (line 1) | class Solution {
    method totalNQueens (line 3) | int totalNQueens(int n) {
    method dfs (line 9) | void dfs(int& result, int n, int col, int l, int r) {

FILE: NextPermutation/NextPermutation.cpp
  class Solution (line 1) | class Solution {
    method nextPermutation (line 3) | void nextPermutation(vector<int> &num) {

FILE: PalindromeNumber/PalindromeNumber.cpp
  class Solution (line 1) | class Solution {
    method isPalindrome (line 3) | bool isPalindrome(int x) {

FILE: PalindromePartitioning/PalindromePartitioning.cpp
  class Solution (line 1) | class Solution {
    method partition (line 3) | vector<vector<string> > partition(string s) {
    method dfs (line 14) | void dfs(string& s, int p, vector<string>& v) {
    method dynamic (line 31) | void dynamic(string& s) {

FILE: PalindromePartitioningII/PalindromePartitioningII.cpp
  class Solution (line 4) | class Solution {
    method minCut (line 6) | int minCut(string s) {

FILE: PartitionList/PartitionList.cpp
  class Solution (line 9) | class Solution {
    method ListNode (line 11) | ListNode *partition(ListNode *head, int x) {

FILE: Pascal'sTriangle/Pascal'sTriangle.cpp
  class Solution (line 1) | class Solution {
    method generate (line 3) | vector<vector<int> > generate(int numRows) {

FILE: Pascal'sTriangleII/Pascal'sTriangleII.cpp
  class Solution (line 1) | class Solution {
    method getRow (line 3) | vector<int> getRow(int rowIndex) {

FILE: PathSum/PathSum.cpp
  class Solution (line 10) | class Solution {
    method hasPathSum (line 12) | bool hasPathSum(TreeNode *root, int sum) {
    method dfs (line 21) | bool dfs(TreeNode *node, int value, int target) {

FILE: PathSumII/PathSumII.cpp
  class Solution (line 10) | class Solution {
    method pathSum (line 12) | vector<vector<int> > pathSum(TreeNode *root, int sum) {
    method dfs (line 21) | void dfs(TreeNode *node, int value, int sum,

FILE: PermutationSequence/PermutationSequence.cpp
  class Solution (line 4) | class Solution {
    method string (line 6) | string getPermutation(int n, int k) {

FILE: Permutations/Permutations.cpp
  class Solution (line 1) | class Solution {
    method permute (line 3) | vector<vector<int>> permute(vector<int>& num) {
    method dfs (line 12) | void dfs(vector<int>& num, int step, vector<vector<int>>& result) {

FILE: PermutationsII/PermutationsII.cpp
  class Solution (line 1) | class Solution {
    method permuteUnique (line 3) | vector<vector<int> > permuteUnique(vector<int> &num) {
    method getNext (line 12) | bool getNext(vector<int>& num) {
    method helper (line 36) | void helper(vector<vector<int>>& result, vector<int>& num, int x) {
    method permuteUnique (line 55) | vector<vector<int> > permuteUnique(vector<int> &num) {
  class Solution (line 34) | class Solution {
    method permuteUnique (line 3) | vector<vector<int> > permuteUnique(vector<int> &num) {
    method getNext (line 12) | bool getNext(vector<int>& num) {
    method helper (line 36) | void helper(vector<vector<int>>& result, vector<int>& num, int x) {
    method permuteUnique (line 55) | vector<vector<int> > permuteUnique(vector<int> &num) {

FILE: PlusOne/PlusOne.cpp
  class Solution (line 1) | class Solution {
    method plusOne (line 3) | vector<int> plusOne(vector<int>& digits) {

FILE: PopulatingNextRightPointersinEachNode/PopulatingNextRightPointersinEachNode.cpp
  class Solution (line 9) | class Solution {
    method connect (line 11) | void connect(TreeLinkNode *root) {

FILE: PopulatingNextRightPointersinEachNodeII/PopulatingNextRightPointersinEachNodeII.cpp
  class Solution (line 9) | class Solution {
    method connect (line 11) | void connect(TreeLinkNode *root) {

FILE: Pow(x, n)/Pow(x, n).cpp
  class Solution (line 1) | class Solution {
    method pow (line 3) | double pow(double x, int n) {

FILE: RecoverBinarySearchTree/RecoverBinarySearchTree.cpp
  class Solution (line 2) | class Solution {
    method recoverTree (line 4) | void recoverTree(TreeNode *root) {

FILE: RegularExpressionMatching/RegularExpressionMatching.cpp
  class Solution (line 1) | class Solution {
    method isMatch (line 3) | bool isMatch(const char *s, const char *p) {

FILE: RemoveDuplicatesfromSortedArray/RemoveDuplicatesfromSortedArray.cpp
  class Solution (line 1) | class Solution {
    method removeDuplicates (line 3) | int removeDuplicates(int A[], int n) {

FILE: RemoveDuplicatesfromSortedArrayII/RemoveDuplicatesfromSortedArrayII.cpp
  class Solution (line 1) | class Solution {
    method removeDuplicates (line 3) | int removeDuplicates(int A[], int n) {

FILE: RemoveDuplicatesfromSortedList/RemoveDuplicatesfromSortedList.cpp
  class Solution (line 9) | class Solution {
    method ListNode (line 11) | ListNode *deleteDuplicates(ListNode *head) {

FILE: RemoveDuplicatesfromSortedListII/RemoveDuplicatesfromSortedListII.cpp
  class Solution (line 9) | class Solution {
    method ListNode (line 11) | ListNode *deleteDuplicates(ListNode *head) {

FILE: RemoveElement/RemoveElement.cpp
  class Solution (line 1) | class Solution {
    method removeElement (line 3) | int removeElement(int A[], int n, int elem) {

FILE: RemoveNthNodeFromEndofList/RemoveNthNodeFromEndofList.cpp
  class Solution (line 9) | class Solution {
    method ListNode (line 11) | ListNode *removeNthFromEnd(ListNode *head, int n) {

FILE: RestoreIPAddresses/RestoreIPAddresses.cpp
  class Solution (line 1) | class Solution {
    method restoreIpAddresses (line 3) | vector<string> restoreIpAddresses(string s) {
    method dfs (line 10) | void dfs(vector<string>& result, vector<int>& sk, const string& s, int...

FILE: ReverseInteger/ReverseInteger.cpp
  class Solution (line 1) | class Solution {
    method reverse (line 3) | int reverse(int x) {

FILE: ReverseLinkedListII/ReverseLinkedListII.cpp
  class Solution (line 9) | class Solution {
    method ListNode (line 11) | ListNode *reverseBetween(ListNode *head, int m, int n) {

FILE: ReverseNodesink-Group/ReverseNodesink-Group.cpp
  class Solution (line 9) | class Solution {
    method ListNode (line 11) | ListNode *reverseKGroup(ListNode *head, int k) {
    method ListNode (line 50) | ListNode* reverse(ListNode* head) {

FILE: ReverseWordsInAString/ReverseWordsInAString.cpp
  class Solution (line 1) | class Solution {
    method reverseWords (line 3) | void reverseWords(string &s) {
    method reverse (line 40) | void reverse(string& s, int i, int j) {
    method reverseWords (line 52) | void reverseWords(string &s) {
  class Solution (line 50) | class Solution {
    method reverseWords (line 3) | void reverseWords(string &s) {
    method reverse (line 40) | void reverse(string& s, int i, int j) {
    method reverseWords (line 52) | void reverseWords(string &s) {

FILE: RomantoInteger/RomantoInteger.cpp
  class Solution (line 1) | class Solution {
    method romanToInt (line 3) | int romanToInt(string s) {

FILE: RotateImage/RotateImage.cpp
  class Solution (line 1) | class Solution {
    method rotate (line 3) | void rotate(vector<vector<int>>& matrix) {

FILE: RotateList/RotateList.cpp
  class Solution (line 9) | class Solution {
    method ListNode (line 11) | ListNode *rotateRight(ListNode *head, int k) {

FILE: SameTree/SameTree.cpp
  class Solution (line 10) | class Solution {
    method isSameTree (line 12) | bool isSameTree(TreeNode *p, TreeNode *q) {

FILE: ScrambleString/ScrambleString.cpp
  class Solution (line 1) | class Solution {
    method isScramble (line 3) | bool isScramble(string s1, string s2) {
    method isScrambleHelper (line 10) | bool isScrambleHelper(string& s1, int l1, string& s2, int l2, int size) {
    method canScramble (line 25) | bool canScramble(string& s1, int l1, string& s2, int l2, int size) {

FILE: SearchInsertPosition/SearchInsertPosition.cpp
  class Solution (line 1) | class Solution {
    method searchInsert (line 3) | int searchInsert(int A[], int n, int target) {

FILE: Searcha2DMatrix/Searcha2DMatrix.cpp
  class Solution (line 1) | class Solution {
    method searchMatrix (line 3) | bool searchMatrix(vector<vector<int>>& matrix, int target) {
    method isValid (line 24) | bool isValid(vector<int>& row, int target) {

FILE: SearchforaRange/SearchforaRange.cpp
  class Solution (line 1) | class Solution {
    method searchRange (line 3) | vector<int> searchRange(int A[], int n, int target) {
    method find_lower_bound (line 13) | int find_lower_bound(int A[], int n, int target) {
    method find_upper_bound (line 29) | int find_upper_bound(int A[], int n, int target) {

FILE: SearchinRotatedSortedArray/SearchinRotatedSortedArray.cpp
  class Solution (line 1) | class Solution {
    method search (line 3) | int search(int A[], int n, int target) {

FILE: SearchinRotatedSortedArrayII/SearchinRotatedSortedArrayII.cpp
  class Solution (line 1) | class Solution {
    method search (line 3) | bool search(int A[], int n, int target) {

FILE: SetMatrixZeroes/SetMatrixZeroes.cpp
  class Solution (line 1) | class Solution {
    method setZeroes (line 3) | void setZeroes(vector<vector<int>>& matrix) {

FILE: SimplifyPath/SimplifyPath.cpp
  class Solution (line 1) | class Solution {
    method string (line 3) | string simplifyPath(string path) {

FILE: SortColors/SortColors.cpp
  class Solution (line 1) | class Solution {
    method sortColors (line 3) | void sortColors(int A[], int n) {
  class Solution2 (line 25) | class Solution2 {
    method sortColors (line 27) | void sortColors(int A[], int n) {
    method split (line 34) | int split(int A[], int low, int high, int pivot) {

FILE: SortList/SortList.cc
  class Solution (line 9) | class Solution {
    method ListNode (line 11) | ListNode *sortList(ListNode *head) {

FILE: SpiralMatrix/SpiralMatrix.cpp
  class Solution (line 1) | class Solution {
    method spiralOrder (line 3) | vector<int> spiralOrder(vector<vector<int> > &matrix) {

FILE: SpiralMatrixII/SpiralMatrixII.cpp
  class Solution (line 1) | class Solution {
    method generateMatrix (line 3) | vector<vector<int> > generateMatrix(int n) {

FILE: Sqrt(x)/Sqrt(x).cpp
  class Solution (line 1) | class Solution {
    method sqrt (line 3) | int sqrt(int x) {

FILE: StringtoInteger(atoi)/StringtoInteger(atoi).cpp
  class Solution (line 1) | class Solution {
    method atoi (line 3) | int atoi(const char *str) {

FILE: Subsets/Subsets.cpp
  class Solution (line 1) | class Solution {
    method subsets (line 3) | vector<vector<int> > subsets(vector<int>& S) {
    method DFS (line 15) | void DFS(vector<int>& subset, int step, vector<int>& S, vector<vector<...

FILE: SubsetsII/SubsetsII.cpp
  class Solution (line 1) | class Solution {
    method subsetsWithDup (line 3) | vector<vector<int>> subsetsWithDup(vector<int>& S) {
    method DFS (line 19) | void DFS(vector<int>& integers, int start, vector<int>& S, vector<vect...

FILE: SubstringwithConcatenationofAllWords/SubstringwithConcatenationofAllWords.cpp
  class Solution (line 1) | class Solution {
    method findSubstring (line 3) | vector<int> findSubstring(string S, vector<string> &L) {

FILE: SudokuSolver/SudokuSolver.cpp
  class Solution (line 1) | class Solution {
    method solveSudoku (line 7) | void solveSudoku(vector<vector<char>>& board) {
    method isValidSudokuHelper (line 29) | bool isValidSudokuHelper(vector<vector<char>>& board, int step) {

FILE: SumRoottoLeafNumbers/SumRoottoLeafNumbers.cpp
  class Solution (line 10) | class Solution {
    method sumNumbers (line 12) | int sumNumbers(TreeNode *root) {
    method dfs (line 20) | void dfs(TreeNode *node, int val, int& sum) {

FILE: SurroundedRegions/SurroundedRegions.cpp
  class Solution (line 5) | class Solution {
    method solve (line 7) | void solve(vector<vector<char>> &board) {
    method dfs (line 32) | void dfs(int x, int y, vector<vector<char>> &board) {
    method check (line 44) | bool check(int x, int y) {

FILE: SwapNodesinPairs/SwapNodesinPairs.cpp
  class Solution (line 9) | class Solution {
    method ListNode (line 11) | ListNode *swapPairs(ListNode *head) {

FILE: SymmetricTree/SymmetricTree_iteratively.cpp
  class Solution (line 10) | class Solution {
    method isSymmetric (line 12) | bool isSymmetric(TreeNode *root) {

FILE: SymmetricTree/SymmetricTree_recursively.cpp
  class Solution (line 10) | class Solution {
    method isSymmetric (line 12) | bool isSymmetric(TreeNode *root) {
    method dfs (line 20) | bool dfs(TreeNode *lhs, TreeNode *rhs) {

FILE: TextJustification/TextJustification.cpp
  class Solution (line 1) | class Solution {
    method fullJustify (line 3) | vector<string> fullJustify(vector<string>& words, int L) {

FILE: TrappingRainWater/TrappingRainWater.cpp
  class Solution (line 2) | class Solution {
    method trap (line 4) | int trap(int A[], int n) {
    method trap (line 32) | int trap(int A[], int n) {
  class Solution (line 30) | class Solution {
    method trap (line 4) | int trap(int A[], int n) {
    method trap (line 32) | int trap(int A[], int n) {

FILE: Triangle/Triangle.cpp
  class Solution (line 1) | class Solution {
    method minimumTotal (line 3) | int minimumTotal(vector<vector<int> > &triangle) {

FILE: TwoSum/TwoSum.cpp
  function lessthan (line 1) | bool lessthan(const pair<int, int>& lhs, const pair<int, int>& rhs) {
  class Solution (line 7) | class Solution {
    method twoSum (line 9) | vector<int> twoSum(vector<int> &numbers, int target) {

FILE: UniqueBinarySearchTrees/UniqueBinarySearchTrees.cpp
  class Solution (line 1) | class Solution {
    method numTrees (line 3) | int numTrees(int n) {

FILE: UniqueBinarySearchTreesII/UniqueBinarySearchTreesII.cpp
  class Solution (line 10) | class Solution {
    method generateTrees (line 12) | vector<TreeNode *> generateTrees(int n) {
    method generateTreesHelper (line 19) | vector<TreeNode *> generateTreesHelper(int left, int right) {

FILE: UniquePaths/UniquePaths.cpp
  class Solution (line 1) | class Solution {
    method uniquePaths (line 3) | int uniquePaths(int m, int n) {

FILE: UniquePathsII/UniquePathsII.cpp
  class Solution (line 1) | class Solution {
    method uniquePathsWithObstacles (line 3) | int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {

FILE: ValidNumber/ValidNumber.cpp
  class Solution (line 2) | class Solution {
    method accept (line 4) | bool accept(const char* s, int& i, string expected) {
    method acceptRun (line 14) | bool acceptRun(const char* s, int& i, string expected) {
    method isNumber (line 36) | bool isNumber(const char *s) {

FILE: ValidPalindrome/ValidPalindrome.cpp
  class Solution (line 1) | class Solution {
    method isPalindrome (line 3) | bool isPalindrome(string s) {

FILE: ValidParentheses/ValidParentheses.cpp
  class Solution (line 1) | class Solution {
    method isValid (line 3) | bool isValid(string s) {

FILE: ValidSudoku/ValidSudoku.cpp
  class Solution (line 1) | class Solution {
    method isValidSudoku (line 3) | bool isValidSudoku(vector<vector<char>> &board) {

FILE: ValidateBinarySearchTree/ValidateBinarySearchTree.cpp
  class Solution (line 10) | class Solution {
    method isValidBST (line 12) | bool isValidBST(TreeNode *root) {
    method valid (line 20) | bool valid(TreeNode *node, int start, int limit) {
    method isValidBST (line 37) | bool isValidBST(TreeNode *root) {
  class Solution (line 35) | class Solution {
    method isValidBST (line 12) | bool isValidBST(TreeNode *root) {
    method valid (line 20) | bool valid(TreeNode *node, int start, int limit) {
    method isValidBST (line 37) | bool isValidBST(TreeNode *root) {

FILE: WildcardMatching/WildcardMatching.cpp
  class Solution (line 1) | class Solution {
    method isMatch (line 3) | bool isMatch(const char *s, const char *p) {

FILE: WordLadder/WordLadder.cpp
  class Solution (line 1) | class Solution {
    method ladderLength (line 3) | int ladderLength(string start, string end, unordered_set<string> &dict) {

FILE: WordLadderII/WordLadderII.cpp
  class Solution (line 1) | class Solution {
    method buildMap (line 7) | void buildMap(const unordered_set<string>& dict) {
    method buildReverseMap (line 32) | void buildReverseMap(int src, int dst) {
    method dfs (line 55) | void dfs(int u, int v, vector<int>& path, vector<vector<string>>& resu...
    method findLadders (line 71) | vector<vector<string>> findLadders(string start, string end, unordered...

FILE: WordSearch/WordSearch.cpp
  class Solution (line 1) | class Solution {
    method exist (line 3) | bool exist(vector<vector<char>>& board, string word) {
    method isValid (line 33) | bool isValid(int x, int y) {
    method DFS (line 40) | bool DFS(int x, int y, int p) {

FILE: ZigZagConversion/ZigZagConversion.cpp
  class Solution (line 1) | class Solution {
    method string (line 3) | string convert(string s, int nRows) {