SYMBOL INDEX (188 symbols across 89 files)

FILE: 3_segment.cpp
  function main (line 8) | int main() {

FILE: Best_Time_To_Buy_And_Sell_Stock_.cpp
  function best_time (line 6) | int best_time(vector<int>&arr,int n){
  function main (line 19) | int main(){

FILE: BitonicSequence.cpp
  function main (line 3) | int main() {

FILE: Box_Stacking_Problem.cpp
  type Box (line 4) | struct Box{
  function comparator (line 10) | bool comparator(Box b1, Box b2){
  function maxStackHeight (line 13) | int maxStackHeight(int h[],int d[],int w[],int n){

FILE: Circular_Kadene.cpp
  function maxMoney (line 6) | int  maxMoney(int arr[], int num)

FILE: Coin_Changing_1.cpp
  function Max_ways (line 4) | int Max_ways(int coins[],int size,int sum){
  function main (line 32) | int main() {

FILE: Coin_Changing_2.cpp
  function Minm_Coins (line 4) | int Minm_Coins(int coins[],int size,int sum) {
  function main (line 24) | int main(){

FILE: Count_All_Increasing_Subsequences.cpp
  function Count_AIS (line 4) | int Count_AIS(int a[],int size){
  function AIS (line 27) | int AIS(int a[],int size){
  function main (line 41) | int main(){

FILE: Count_All_Pallindromic_Subsequence.cpp
  function CountLPS (line 4) | int CountLPS(string s){
  function main (line 24) | int main(){

FILE: Count_Distinct_Subsequences.cpp
  function CDS (line 4) | int CDS(string s,int size){
  function main (line 17) | int main(){

FILE: Count_Number_of_hops.cpp
  function solve (line 3) | void solve(int n){
  function main (line 11) | int main()

FILE: Count_Pallindromic_SubString_Of_String_gfg.cpp
  function expandAroundCenter (line 4) | int expandAroundCenter(string s,int left,int right){
  function CountLPSubstring (line 14) | int CountLPSubstring(string s){
  function main (line 23) | int main(){

FILE: Count_Subsets_of_given_Sum.cpp
  function CountSubsets (line 4) | int CountSubsets(int a[],int size,int sum) {
  function main (line 31) | int main() {

FILE: Count_ways_to_N'th_Stair.cpp
  function countWays (line 1) | long long countWays(int m){

FILE: Diameter_Of_Binary_Tree.cpp
  function helper (line 2) | int helper(Node* node,int &res){
  function diameter (line 11) | int diameter(Node* node) {

FILE: Distinct_Occurences.cpp
  function Count_All_Distinct_Occurences (line 4) | int Count_All_Distinct_Occurences(string s1,string s2){
  function main (line 28) | int main(){

FILE: Edit_Distance.cpp
  function Edit_Distance (line 4) | int Edit_Distance(string s1,string s2){
  function main (line 28) | int main(){

FILE: Equal_Sum_Partition.cpp
  function EqualSubsetSum (line 4) | bool EqualSubsetSum(int a[],int size) {
  function main (line 30) | int main() {

FILE: Friends_Pairing_Problem.cpp
  function main (line 4) | int main()

FILE: Get_Minimum_Squares.cpp
  function getMinimumSquares (line 3) | int getMinimumSquares(int n){
  function main (line 19) | int main(){

FILE: GoldMine_Problem.cpp
  function main (line 3) | int main(){

FILE: Jump_Game_3.cpp
  class Solution (line 1) | class Solution {
    method canReach (line 3) | bool canReach(vector<int>& arr, int start) {
    method help (line 8) | bool help(vector<int>& arr, int start, vector<int>& tab, int N) {

FILE: Jump_Game_5.cpp
  function helper (line 6) | int helper(vector<int>& arr,int d,int i){
  function maxJumps (line 15) | int maxJumps(vector<int>& arr, int d) {

FILE: Kadane.cpp
  function Kadane (line 4) | int Kadane(int a[],int size){
  function main (line 13) | int main(){

FILE: Knapsack_0_1.cpp
  function knapsack (line 3) | int knapsack(int wt[],int val[],int W,int size){
  function main (line 21) | int main() {

FILE: Last_Stone_3.cpp
  function helper (line 6) | int helper(vector<int>& s,int i){
  function string (line 16) | string stoneGameIII(vector<int>& s) {
  function helper (line 24) | int helper(vector<int>&s,int i){
  function string (line 35) | string stoneGameIII(vector<int>& s) {
  function string (line 43) | string stoneGameIII(vector<int>& s) {
  function main (line 60) | int main(){

FILE: Longest_Common_Subsequence.cpp
  function Lcs (line 3) | int Lcs(string s1,string s2){
  function main (line 26) | int main(){

FILE: Longest_Common_Substring.cpp
  function LCSub (line 3) | int LCSub(string s1,string s2){
  function main (line 22) | int main(){

FILE: Longest_Consequetive_Subsequence.cpp
  function main (line 3) | int main()

FILE: Longest_Decreasing_Subsequence.cpp
  function LDS (line 4) | int LDS(int a[],int size){
  function main (line 19) | int main(){

FILE: Longest_Increasing_Subsequence.cpp
  function LIS (line 4) | int LIS(int a[],int size){
  function main (line 19) | int main(){

FILE: Longest_Pallindromic_Subsequence.cpp
  function longestPalindromeSubseq (line 5) | int longestPalindromeSubseq(string s) {
  function main (line 27) | int main(){

FILE: Longest_Pallindromic_Substring.cpp
  function expandAroundCenter (line 4) | int expandAroundCenter(string s,int left,int right){
  function string (line 12) | string LPSubstring(string s){
  function main (line 26) | int main(){

FILE: Longest_Repeating_Subsequence.cpp
  function LRS (line 4) | int LRS(string s){
  function main (line 23) | int main() {

FILE: Matrix_Chain_Multiplication.cpp
  function MCM (line 5) | int MCM(int a[],int i,int j){
  function main (line 16) | int main(){

FILE: Max_Path_Sum_in_Triangle.cpp
  function Max_Sum_Tri (line 5) | int Max_Sum_Tri(int t[][N],int m,int n){
  function main (line 14) | int main(){

FILE: Max_path_sum.cpp
  function largest_sum (line 6) | int largest_sum(int child,int parent) {
  function main (line 17) | int main() {

FILE: Maximize_the_cutting.cpp
  function main (line 3) | int main()

FILE: Maximum_Dot_Product_Subsequence.cpp
  function maxDotProduct (line 5) | int maxDotProduct(vector<int>& A, vector<int>& B,int size1,int size2) {
  function main (line 19) | int main(){
  class Solution (line 34) | class Solution {
    method maxDotProduct (line 36) | int maxDotProduct(vector<int>& nums1, vector<int>& nums2) {

FILE: Maximum_Path_Sum_in_Binary_tree.cpp
  class Solution (line 2) | class Solution {
    method maxToRoot (line 3) | int maxToRoot(TreeNode *root, int &re) {
    method maxPathSum (line 13) | int maxPathSum(TreeNode *root) {

FILE: Maximum_Product_Increasing_Subsequence.cpp
  function MPIS (line 3) | int MPIS(int a[],int size){
  function main (line 24) | int main(){

FILE: Maximum_Size_Submatrix_Square.cpp
  function Max_Square (line 5) | int Max_Square(int M[r][c]){
  function main (line 31) | int main(){

FILE: Maximum_Sum_Decreasing_Subsequence.cpp
  function MSDS (line 3) | int MSDS(int a[],int size){
  function main (line 24) | int main(){

FILE: Maximum_Sum_Dividing_Recurssive.cpp
  function main (line 3) | int main()

FILE: Maximum_Sum_Increasing_Subsequence.cpp
  function MSIS (line 3) | int MSIS(int a[],int size){
  function main (line 24) | int main(){

FILE: Maximum_length_of_pairs.cpp
  function findLongestChain (line 1) | int findLongestChain(vector<vector<int>>& pairs) {

FILE: Minimum_Ascii_Sum_deletion_To_Make_two_Strings_equal.cpp
  function minimumDeleteSum (line 3) | int minimumDeleteSum(string s1, string s2) {
  function main (line 35) | int main(){

FILE: Minimum_Initial_Points_To_Reach_Destinaion.cpp
  function MinmIniPoints (line 8) | int MinmIniPoints(int a[][3]){
  function main (line 22) | int main(){

FILE: Minimum_Jumps_To_Reach_End.cpp
  function Min_Jumps (line 5) | int Min_Jumps(int a[],int size){
  function minJumps (line 20) | int minJumps(int a[],int n){
  function main (line 40) | int main(){

FILE: Minimum_Subset_Sum_Difference.cpp
  function Minm_SubsetSum_Diff (line 3) | int Minm_SubsetSum_Diff(int a[],int size){
  function main (line 34) | int main(){

FILE: Minm_Cost_To_Fill_Bag.cpp
  function minm_Cost (line 6) | int minm_Cost(int cost[],int n,int W){
  function main (line 46) | int main()

FILE: Minm_Deletion_To_Make_Pallindrome.cpp
  function DelPallin (line 4) | int DelPallin(string s){
  function main (line 26) | int main() {

FILE: Minm_Insertion_Deletion_Convert.cpp
  function Idconvert (line 4) | int Idconvert(string s1,string s2){
  function main (line 26) | int main() {

FILE: No_Of_Ways_To_Tile.cpp
  function main (line 3) | int main()

FILE: Number_of_ways_to_decode_a_string.cpp
  function countWays (line 5) | int countWays(string s){
  function main (line 23) | int main(){

FILE: Optimal_Strategy_To_Play_A_Game.cpp
  function OptimalStrategy (line 7) | int OptimalStrategy(int coins[],int i,int j){
  function main (line 22) | int main(){

FILE: Path_In_A_Matrix.cpp
  function solve (line 4) | void solve(int n,int cost[][1000]){
  function main (line 21) | int main(){

FILE: Print_Longest_Common_Subsequence.cpp
  function string (line 3) | string PrintLcs(string s1,string s2){
  function main (line 36) | int main(){

FILE: Procuct_of_array_except_self.cpp
  class Solution (line 3) | class Solution {
    method productExceptSelf (line 5) | vector<int> productExceptSelf(vector<int>& nums) {

FILE: Reach_a_given_score.cpp
  function solve (line 3) | void solve(int sum){
  function main (line 12) | int main()

FILE: Rod_Cutting.cpp
  function rodCutting (line 4) | int rodCutting(int cost[],int len[],int size) {
  function main (line 28) | int main() {

FILE: Russian_Doll_Envelope.cpp
  function maxEnvelopes (line 7) | int maxEnvelopes(vector<vector<int>>& envelopes) {

FILE: Shortest_Common_Supersequence.cpp
  function Scs (line 4) | int Scs(string s1,string s2){
  function main (line 23) | int main(){

FILE: SubsetSum.cpp
  function SubsetSum (line 3) | bool SubsetSum(int a[],int size,int sum) {
  function main (line 24) | int main() {

FILE: Tiling_Problem.cpp
  function CountWays (line 4) | int CountWays(int n, int m)
  function main (line 18) | int main()

FILE: Unbounded_Knapsack.cpp
  function knapsack (line 3) | int knapsack(int wt[],int val[],int W,int size){
  function main (line 27) | int main() {

FILE: Uncrossed_Lines.cpp
  function maxUncrossedLines (line 4) | int maxUncrossedLines(vector<int>& A, vector<int>& B,int n,int m) {
  function main (line 20) | int main(){

FILE: count_submatrices_with_all_ones.cpp
  class Solution (line 6) | class Solution {
    method countSquares (line 8) | int countSquares(vector<vector<int>>& m) {

FILE: count_subsets_of_given_difference.cpp
  function count (line 9) | int count(vector<int> &nums,int sum) {
  function main (line 31) | int main() {

FILE: flip_game_1.cpp
  class Solution (line 6) | class Solution {
    method generatePossibleNextMoves (line 8) | vector<string> generatePossibleNextMoves(string &s) {

FILE: flip_game_2.cpp
  class Solution (line 7) | class Solution {
    method canWin (line 9) | bool canWin(string &s) {
    method flipGame (line 15) | bool flipGame(string &s){

FILE: jump_game_2..cpp
  class Solution (line 7) | class Solution {
    method jump (line 9) | int jump(vector<int>& nums) {

FILE: longest_alternating_subsequence.cpp
  class Solution (line 7) | class Solution {
    method wiggleMaxLength (line 9) | int wiggleMaxLength(vector<int>& nums) {
    method wiggleMaxLength (line 33) | int wiggleMaxLength(vector<int>& nums) {
    method wiggleMaxLength (line 61) | int wiggleMaxLength(vector<int>& nums) {
  class Solution (line 31) | class Solution {
    method wiggleMaxLength (line 9) | int wiggleMaxLength(vector<int>& nums) {
    method wiggleMaxLength (line 33) | int wiggleMaxLength(vector<int>& nums) {
    method wiggleMaxLength (line 61) | int wiggleMaxLength(vector<int>& nums) {
  class Solution (line 59) | class Solution {
    method wiggleMaxLength (line 9) | int wiggleMaxLength(vector<int>& nums) {
    method wiggleMaxLength (line 33) | int wiggleMaxLength(vector<int>& nums) {
    method wiggleMaxLength (line 61) | int wiggleMaxLength(vector<int>& nums) {

FILE: maximal_square.cpp
  class Solution (line 6) | class Solution {
    method maximalSquare (line 8) | int maximalSquare(vector<vector<char>>& matrix) {

FILE: maximum_product_subarray.cpp
  class Solution (line 6) | class Solution {
    method maxProduct (line 8) | int maxProduct(vector<int>& nums) {

FILE: minm_number_of_taps_to_open_water.cpp
  class Solution (line 6) | class Solution {
    method minTaps (line 8) | int minTaps(int n, vector<int>& ranges) {

FILE: nim_game.cpp
  class Solution (line 7) | class Solution {
    method canWinNim (line 9) | bool canWinNim(int n) {
    method canWinNim (line 25) | bool canWinNim(int n) {
  class Solution (line 23) | class Solution {
    method canWinNim (line 9) | bool canWinNim(int n) {
    method canWinNim (line 25) | bool canWinNim(int n) {

FILE: nth_catlan_number.cpp
  function nCatlan (line 5) | int nCatlan(int n) {
  function binomial (line 19) | int binomial(int n,int r){
  function catlan (line 30) | int catlan(int n){
  function main (line 37) | int main(){

FILE: num_products.cpp
  function divisors (line 6) | void divisors() {
  function main (line 18) | int main() {

FILE: number_of_permutations_such_that_no_three_forms_increasing_sequence.cpp
  function binomial (line 7) | int binomial(int n,int r){
  function catlan (line 18) | int catlan(int n){
  function main (line 25) | int main(){

FILE: number_of_valid_parenthesis.cpp
  function binomial (line 7) | int binomial(int n,int r){
  function catlan (line 18) | int catlan(int n){
  function main (line 25) | int main(){

FILE: spoj/ABA12C - Buying Apples!.cpp
  function main (line 6) | signed main(){

FILE: spoj/ACODE - Alphacode.cpp
  function main (line 34) | signed main()

FILE: spoj/AIBOHP - Aibohphobia.cpp
  function main (line 5) | signed main(){

FILE: spoj/ANARC09A - Seinfeld.cpp
  function main (line 6) | signed main(){

FILE: unique_paths_1.cpp
  class Solution (line 6) | class Solution {
    method uniquePaths (line 8) | int uniquePaths(int m, int n) {

FILE: unique_paths_2.cpp
  class Solution (line 6) | class Solution {
    method uniquePathsWithObstacles (line 8) | int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {

FILE: video_stiching.cpp
  class Solution (line 6) | class Solution {
    method videoStitching (line 8) | int videoStitching(vector<vector<int>>& clips, int T) {

FILE: zerosAndOnes.cpp
  class Solution (line 5) | class Solution {
    method Solution (line 7) | Solution(){}
    method findMaxForm (line 8) | int findMaxForm(vector<string>& strs, int m, int n) {
  function main (line 31) | int main(){