SYMBOL INDEX (205 symbols across 169 files)

FILE: 3Sum.h
  function class (line 22) | class Solution {

FILE: 3SumClosest.h
  function class (line 17) | class Solution {

FILE: 4Sum.h
  function class (line 26) | class Solution {

FILE: AddBinary.h
  function class (line 18) | class Solution {

FILE: AddTwoNumbers.h
  function class (line 28) | class Solution {

FILE: Anagrams.h
  function class (line 16) | class Solution {

FILE: BalancedBinaryTree.h
  function class (line 25) | class Solution {

FILE: BestTimetoBuyandSellStock.h
  function class (line 16) | class Solution {

FILE: BestTimetoBuyandSellStockII.h
  function class (line 19) | class Solution {

FILE: BestTimetoBuyandSellStockIII.h
  function class (line 18) | class Solution {

FILE: BinarySearchTreeIterator.h
  function class (line 27) | class BSTIterator_1 {
  function class (line 58) | class BSTIterator_2 {

FILE: BinaryTreeInorderTraversal.h
  function class (line 33) | class Solution {

FILE: BinaryTreeLevelOrderTraversal.h
  function class (line 39) | class Solution {
  function levelOrderRe (line 78) | void levelOrderRe(TreeNode *node, int level, vector<vector<int>> &res)

FILE: BinaryTreeLevelOrderTraversalII.h
  function class (line 37) | class Solution {

FILE: BinaryTreeMaximumPathSum.h
  function class (line 30) | class Solution {

FILE: BinaryTreePostorderTraversal.h
  function class (line 42) | class Solution {

FILE: BinaryTreePreorderTraversal.h
  function class (line 32) | class Solution {

FILE: BinaryTreeZigzagLevelOrderTraversal.h
  function class (line 40) | class Solution {

FILE: Candy.h
  function class (line 20) | class Solution {

FILE: ClimbingStairs.h
  function class (line 14) | class Solution {

FILE: CloneGraph.h
  function class (line 38) | class Solution {

FILE: CombinationSum.h
  function class (line 23) | class Solution {

FILE: CombinationSumII.h
  function class (line 25) | class Solution {

FILE: Combinations.h
  function class (line 24) | class Solution {
  function combineRe (line 33) | void combineRe(int n, int k, int start, vector<int> &com, vector<vector<...

FILE: CompareVersionNumbers.h
  function class (line 21) | class Solution {

FILE: ConstructBinaryTreefromInorderandPostorderTraversal.h
  function class (line 24) | class Solution {

FILE: ConstructBinaryTreefromPreorderandInorderTraversal.h
  function class (line 25) | class Solution {

FILE: ContainerWithMostWater.h
  function class (line 17) | class Solution {

FILE: ConvertSortedArraytoBinarySearchTree.h
  function class (line 22) | class Solution {

FILE: ConvertSortedListtoBinarySearchTree.h
  function class (line 32) | class Solution {

FILE: CopyListwithRandomPointer.h
  function class (line 23) | class Solution {

FILE: CountandSay.h
  function class (line 21) | class Solution {

FILE: DecodeWays.h
  function class (line 22) | class Solution {

FILE: DistinctSubsequences.h
  function class (line 19) | class Solution {

FILE: DivideTwoIntegers.h
  function class (line 14) | class Solution {

FILE: DungeonGame.h
  function class (line 51) | class Solution {

FILE: EditDistance.h
  function class (line 20) | class Solution {

FILE: EvaluateReversePolishNotation.h
  function class (line 14) | class Solution {

FILE: ExcelSheetColumnNumber.h
  function class (line 24) | class Solution {

FILE: ExcelSheetColumnTitle.h
  function class (line 24) | class Solution {

FILE: FactorialTrailingZeroes.cpp
  class Solution (line 15) | class Solution {
    method trailingZeroes (line 17) | int trailingZeroes(int n) {

FILE: FindMinimumInRotatedSortedArray.h
  function class (line 15) | class Solution {

FILE: FindMinimumInRotatedSortedArrayII.h
  function class (line 15) | class Solution {

FILE: FindPeakElement.h
  function class (line 16) | class Solution {

FILE: FirstMissingPositive.h
  function class (line 19) | class Solution {

FILE: FlattenBinaryTreetoLinkedList.h
  function class (line 45) | class Solution {
  function flatten_1 (line 51) | void flatten_1(TreeNode *root) {
  function TreeNode (line 63) | TreeNode * dfs (TreeNode * root, TreeNode * tail){
  function flatten_2 (line 69) | void flatten_2(TreeNode *root) {
  function flatten_3 (line 73) | void flatten_3(TreeNode *root) {
  function flatten_4 (line 89) | void flatten_4(TreeNode *root) {
  function flattenRe (line 94) | void flattenRe(TreeNode *node, TreeNode *&end) {

FILE: FractionToRecurringDecimal.h
  function class (line 20) | class Solution {

FILE: GasStation.h
  function class (line 16) | class Solution {

FILE: GenerateParentheses.h
  function class (line 17) | class Solution {

FILE: GrayCode.h
  function class (line 24) | class Solution {

FILE: ImplementstrStr().h
  function class (line 15) | class Solution {

FILE: InsertInterval.h
  function class (line 36) | class Solution {

FILE: InsertionSortList.h
  function class (line 21) | class Solution {

FILE: IntegertoRoman.h
  function class (line 14) | class Solution {

FILE: InterleavingString.h
  function class (line 21) | class Solution {

FILE: IntersectionOfTwoLinkedLists.h
  function class (line 28) | class Solution {

FILE: JumpGame.h
  function class (line 20) | class Solution {

FILE: JumpGameII.h
  function class (line 19) | class Solution {

FILE: LRUCache.h
  function else (line 15) | struct CacheNode{
  function set (line 36) | void set(int key, int value) {

FILE: LargestNumber.h
  function class (line 16) | class Solution {

FILE: LargestRectangleinHistogram.h
  function class (line 19) | class Solution {

FILE: LengthofLastWord.h
  function class (line 18) | class Solution {

FILE: LetterCombinationsofaPhoneNumber.h
  function class (line 19) | class Solution {

FILE: LinkedListCycle.h
  function class (line 24) | class Solution {

FILE: LinkedListCycleII.h
  function class (line 23) | class Solution {

FILE: LongestCommonPrefix.h
  function class (line 13) | class Solution {

FILE: LongestConsecutiveSequence.h
  function class (line 21) | class Solution {

FILE: LongestPalindromicSubstring.h
  function class (line 18) | class Solution {

FILE: LongestSubstringWithoutRepeatingCharacters.h
  function class (line 17) | class Solution {

FILE: LongestValidParentheses.h
  function class (line 18) | class Solution {

FILE: MajorityElement.h
  function class (line 19) | class Solution {

FILE: MaxPointsOnALine.h
  function class (line 22) | class Solution {
  function gcd (line 35) | int gcd(int a, int b) {
  function operator (line 39) | bool operator==(const pt &b) const {
  function operator (line 42) | bool operator<(const pt &b) const {
  function maxPoints_1 (line 48) | int maxPoints_1(vector<Point> &points) {
  function maxPoints_2 (line 71) | int maxPoints_2(vector<Point> &points) {

FILE: MaximalRectangle.h
  function class (line 18) | class Solution {

FILE: MaximumDepthofBinaryTree.h
  function class (line 23) | class Solution {

FILE: MaximumGap.h
  function class (line 24) | class Solution {

FILE: MaximumProductSubarray.h
  function class (line 14) | class Solution {

FILE: MaximumSubarray.h
  function class (line 14) | class Solution {

FILE: MedianofTwoSortedArrays.h
  function class (line 16) | class Solution {

FILE: MergeIntervals.h
  function compare (line 27) | bool compare(Interval a, Interval b)
  function class (line 32) | class Solution {

FILE: MergeSortedArray.h
  function class (line 17) | class Solution {

FILE: MergeTwoSortedLists.h
  function class (line 24) | class Solution {

FILE: MergekSortedLists.h
  function class (line 24) | class Mycompare {
  function class (line 31) | class Solution {

FILE: MinStack.h
  function class (line 15) | class MinStack {

FILE: MinimumDepthofBinaryTree.h
  function class (line 26) | class Solution {

FILE: MinimumPathSum.h
  function class (line 16) | class Solution {

FILE: MinimumWindowSubstring.h
  function class (line 25) | class Solution {

FILE: MultiplyStrings.h
  function class (line 15) | class Solution {

FILE: N-Queens.h
  function class (line 29) | class Solution {
  function solveNQueensRe (line 38) | void solveNQueensRe(int n, int row, int ld, int rd, vector<string> &sol,...

FILE: N-QueensII.h
  function class (line 32) | class Solution {

FILE: NextPermutation.h
  function class (line 27) | class Solution {

FILE: PalindromeNumber.h
  function class (line 22) | class Solution {

FILE: PalindromePartitioning.h
  function class (line 21) | class Solution {
  function dfs (line 65) | void dfs(string s, vector<vector<bool> > &dp, int start, vector<string> ...

FILE: PalindromePartitioningII.h
  function class (line 17) | class Solution {

FILE: PartitionList.h
  function class (line 26) | class Solution {

FILE: Pascal'sTriangle.h
  function class (line 22) | class Solution {

FILE: Pascal'sTriangleII.h
  function class (line 17) | class Solution {

FILE: PathSum.h
  function class (line 35) | class Solution {

FILE: PathSum2.h
  function class (line 38) | class Solution {
  function pathSumRe (line 46) | void pathSumRe(TreeNode *root, int sum, vector<vector<int>> &res, vector...

FILE: PermutationSequence.h
  function class (line 24) | class Solution {

FILE: Permutations.h
  function class (line 17) | class Solution {

FILE: PermutationsII.h
  function class (line 17) | class Solution {

FILE: PlusOne.h
  function class (line 14) | class Solution {

FILE: PopulatingNextRightPointersinEachNode.h
  function class (line 47) | class Solution {
  function connect_1 (line 52) | void connect_1(TreeLinkNode *root) {
  function connect_2 (line 74) | void connect_2(TreeLinkNode *root) {
  function connect_3 (line 97) | void connect_3(TreeLinkNode *root) {

FILE: PopulatingNextRightPointersinEachNodeII.h
  function class (line 40) | class Solution {
  function connect_1 (line 45) | void connect_1(TreeLinkNode *root) {
  function connect_2 (line 67) | void connect_2(TreeLinkNode *root) {
  function connect_3 (line 90) | void connect_3(TreeLinkNode *root) {

FILE: Pow(x,n).h
  function class (line 14) | class Solution {

FILE: RecoverBinarySearchTree.h
  type TreeNode (line 18) | struct TreeNode {
  function inorderTraversal (line 43) | void inorderTraversal(TreeNode *root, vector<TreeNode *> &inorder) {
  function recoverTree_2 (line 51) | void recoverTree_2(TreeNode *root) {
  function recoverTreeRe (line 57) | void recoverTreeRe(TreeNode *curNode, TreeNode *&preNode, TreeNode *&fir...
  function recoverTree_3 (line 70) | void recoverTree_3(TreeNode *root) {
  function compare (line 104) | void compare(TreeNode *last, TreeNode *cur, TreeNode *&first, TreeNode *...

FILE: RegularExpressionMatching.h
  function class (line 30) | class Solution {

FILE: RemoveDuplicatesfromSortedArray.h
  function class (line 18) | class Solution {

FILE: RemoveDuplicatesfromSortedArrayII.h
  function class (line 18) | class Solution {

FILE: RemoveDuplicatesfromSortedList.h
  function class (line 27) | class Solution {

FILE: RemoveDuplicatesfromSortedListII.h
  function class (line 25) | class Solution {

FILE: RemoveElement.h
  function class (line 15) | class Solution {

FILE: RemoveNthNodeFromEndofList.h
  function class (line 30) | class Solution {

FILE: ReorderList.h
  function class (line 25) | class Solution {

FILE: RepeatedDNASequences.h
  function class (line 22) | class Solution {

FILE: RestoreIPAddresses.h
  function class (line 17) | class Solution {

FILE: ReverseInteger.h
  function class (line 21) | class Solution {

FILE: ReverseLinkedListII.h
  function class (line 28) | class Solution {

FILE: ReverseNodesinkGroup.h
  function class (line 29) | class Solution {

FILE: ReverseWordsInAString.h
  function class (line 18) | class Solution {

FILE: RomantoInteger.h
  function class (line 15) | class Solution {

FILE: RotateImage.h
  function class (line 20) | class Solution {

FILE: RotateList.h
  function class (line 26) | class Solution {

FILE: SameTree.h
  function class (line 23) | class Solution {

FILE: ScrambleString.h
  function class (line 45) | class Solution {

FILE: SearchInsertPosition.h
  function class (line 19) | class Solution {

FILE: Searcha2DMatrix.h
  function class (line 27) | class Solution {

FILE: SearchforaRange.h
  function class (line 21) | class Solution {

FILE: SearchinRotatedSortedArray.h
  function class (line 17) | class Solution {

FILE: SearchinRotatedSortedArrayII.h
  function class (line 19) | class Solution {

FILE: SetMatrixZeroes.h
  function class (line 19) | class Solution {

FILE: SimplifyPath.h
  function class (line 24) | class Solution {

FILE: SingleNumber.h
  function class (line 16) | class Solution {

FILE: SingleNumberII.h
  function class (line 20) | class Solution {

FILE: SortColors.h
  function class (line 26) | class Solution {

FILE: SortList.h
  function class (line 22) | class Solution {

FILE: SpiralMatrix.h
  function class (line 22) | class Solution {

FILE: SpiralMatrixII.h
  function class (line 22) | class Solution {

FILE: Sqrt(x).h
  function class (line 16) | class Solution {

FILE: StringtoInteger(atoi).h
  function class (line 35) | class Solution {

FILE: Subsets.h
  function class (line 32) | class Solution {
  function subsetsRe (line 48) | void subsetsRe(vector<int> &S, int L, int start, vector<int> &set, vecto...
  function step (line 118) | size_t step) {

FILE: SubsetsII.h
  function class (line 26) | class Solution {
  function dfs (line 35) | void dfs(vector<int> &S, vector<vector<int>>& res, vector<int>&path, siz...

FILE: SubstringwithConcatenationofAllWords.h
  function class (line 21) | class Solution {

FILE: SudokuSolver.h
  function class (line 16) | class Solution {

FILE: SumRoottoLeafNumbers.h
  function class (line 33) | class Solution {

FILE: SurroundedRegions.h
  function class (line 27) | class Solution {

FILE: SwapNodesinPairs.h
  function class (line 26) | class Solution {

FILE: SymmetricTree.h
  function class (line 36) | class Solution {

FILE: TextJustification.h
  function class (line 34) | class Solution {

FILE: TrappingRainWater.h
  function class (line 18) | class Solution {

FILE: Triangle.h
  function class (line 27) | class Solution {

FILE: TwoSum.h
  function compare (line 26) | bool compare(pair<int, int> a, pair<int, int> b) {
  function class (line 30) | class Solution {

FILE: TwoSumIII.h
  function class (line 17) | class TwoSum {

FILE: UniqueBinarySearchTrees.h
  function class (line 21) | class Solution {

FILE: UniqueBinarySearchTreesII.h
  function class (line 24) | class Solution {

FILE: UniquePaths.h
  function class (line 19) | class Solution {

FILE: UniquePathsII.h
  function class (line 25) | class Solution {

FILE: ValidNumber.h
  function class (line 22) | class Solution {

FILE: ValidPalindrome.h
  function class (line 21) | class Solution {

FILE: ValidParentheses.h
  function class (line 15) | class Solution {

FILE: ValidSudoku.h
  function class (line 15) | class Solution {

FILE: ValidateBinarySearchTree.h
  function class (line 28) | class Solution {

FILE: WildcardMatching.h
  function class (line 26) | class Solution {

FILE: WordBreak.h
  function class (line 18) | class Solution {

FILE: WordBreakII.h
  function class (line 19) | class Solution {

FILE: WordLadder.h
  function class (line 27) | class Solution {

FILE: WordLadderII.h
  function class (line 28) | class Solution {

FILE: WordSearch.h
  function class (line 26) | class Solution {

FILE: ZigZagConversion.h
  function class (line 23) | class Solution {