SYMBOL INDEX (480 symbols across 204 files)

FILE: 35_hacker_two_strings.cpp
  function main (line 15) | int main()

FILE: 36_codechef_Encoding_message.cpp
  function main (line 15) | int main()

FILE: 37_codechef_spell_bob.cpp
  function main (line 15) | int main()

FILE: 38_codechef_fits_square_in_triangle.cpp
  function main (line 11) | int main()

FILE: 39_codechef_chef_and_Eid.cpp
  function main (line 14) | int main()

FILE: 40_codechef_chef_judges_competition.cpp
  function main (line 14) | int main()

FILE: 41_codechef_chef_and_glove.cpp
  function main (line 13) | int main()

FILE: 42_codechef_the_great_run.cpp
  function main (line 12) | int main()

FILE: 43_codechef_attendance.cpp
  function main (line 12) | int main()

FILE: 44_codechef_making_a_meal.cpp
  function main (line 14) | int main()

FILE: 45_codechef_uncle_johny.cpp
  function main (line 15) | int main()

FILE: 46_drink_codeforce.cpp
  function main (line 11) | int main()

FILE: 47_candles_codeforces.cpp
  function main (line 11) | int main()

FILE: 49_two_buttons_codeforces.cpp
  function main (line 14) | int main()

FILE: 50_vanya_and_books_codeforces.cpp
  function main (line 13) | int main()

FILE: 51_eleven_codeforces.cpp
  function main (line 15) | int main()

FILE: 52_codechef_flatland.cpp
  function main (line 12) | int main()

FILE: 53_codeforces_MUH_and_sticks.cpp
  function main (line 12) | int main()

FILE: 54_print_subset_of_size_k_of_array.cpp
  function main (line 15) | int main()

FILE: 55_codechef_Easy_Fibonacci.cpp
  function main (line 13) | int main()

FILE: 56_codechef_Chef_and_Interesting_Subsequences.cpp
  function ll (line 16) | ll int gcd(ll int a, ll int b)
  function nCr (line 23) | void nCr(int n, int r)
  function main (line 63) | int main()

FILE: 57_codechef_A-books.cpp
  function main (line 11) | int main()

FILE: 58_codechef_phone_prices.cpp
  function main (line 14) | int main()

FILE: 59_codechef_operations_on_a_matrix.cpp
  function main (line 18) | int main()

FILE: 60_Adding_one_to_the_numbers.cpp
  function main (line 13) | int main(){

FILE: Chef and Price Control.cpp
  function main (line 13) | int main(){

FILE: Data Structures/Add a node at the Middle of linked list.cpp
  type node (line 16) | struct node{
  function printList (line 22) | void printList (node *n){
  function push (line 34) | void push(node **head_ref , int newData){
  function insertAfter (line 43) | void insertAfter(node *prev_node , int newData){
  function main (line 50) | int main(){

FILE: Data Structures/Add a node at the end of linked list.cpp
  type node (line 16) | struct node{
  function printList (line 22) | void printList (node *n){
  function push (line 34) | void push(node **head_ref , int newData){
  function insertAfter (line 43) | void insertAfter(node *prev_node , int newData){
  function append (line 53) | void append(node **head_ref, int newData){
  function main (line 75) | int main(){

FILE: Data Structures/Add a node at the front of linked list.cpp
  type node (line 16) | struct node{
  function printList (line 22) | void printList (node *n){
  function push (line 40) | void push(node **head_ref , int newData){
  function main (line 47) | int main(){

FILE: Data Structures/Array_in_data_structures.cpp
  function main (line 11) | int main(){

FILE: Data Structures/Circular Linked List data_structure.cpp
  type node (line 16) | struct node{
  function printList (line 21) | void printList (node *n){
  function printCircularList (line 31) | void printCircularList(node * first){
  function main (line 45) | int main(){

FILE: Data Structures/Delete a node of a linked list.cpp
  type node (line 15) | struct node{
  function printList (line 21) | void printList (node *n){
  function push (line 33) | void push(node **head_ref , int newData){
  function deleteNode (line 43) | void deleteNode(node **head_ref , int key){
  function main (line 74) | int main(){

FILE: Data Structures/Doubly Linked list.cpp
  type node (line 15) | struct node{
  function printList (line 23) | void printList (node *n){
  function push (line 35) | void push(node **head_ref, int new_data){
  function main (line 50) | int main(){

FILE: Data Structures/Find the middle of a given linked list.cpp
  type node (line 16) | struct node{
  function printList (line 21) | void printList (node *n){
  function printMiddleElement (line 32) | void printMiddleElement( node *head){
  function main (line 46) | int main(){

FILE: Data Structures/Insert Node at the End of Doubly Linked List.cpp
  type node (line 15) | struct node{
  function printList (line 23) | void printList (node *n){
  function push (line 35) | void push(node **head_ref, int new_data){
  function insertAfter (line 51) | void insertAfter(node *prev_node, int new_data){
  function append (line 72) | void append(node **head_ref, int new_data){
  function main (line 95) | int main(){

FILE: Data Structures/Insert Node in Middle of Doubly Linkedlist.cpp
  type node (line 15) | struct node{
  function printList (line 23) | void printList (node *n){
  function push (line 35) | void push(node **head_ref, int new_data){
  function insertAfter (line 51) | void insertAfter(node *prev_node, int new_data){
  function main (line 70) | int main(){

FILE: Data Structures/LinkedList_Code_Practice.cpp
  type node (line 16) | struct node{
  function printList (line 21) | void printList (node *n){
  function main (line 28) | int main(){

FILE: Data Structures/Vectors_in_STL_data_structure.cpp
  function main (line 14) | int main(){

FILE: Data Structures/structure_in_c++.cpp
  type student (line 11) | struct student{
    method studentDetails (line 17) | void studentDetails(){
  function main (line 24) | int main(){

FILE: Kadane's_algorithm.cpp
  function main (line 13) | int main(){

FILE: Lecture - 15.cpp
  function main (line 13) | int main()

FILE: Lecture - 16.cpp
  function main (line 12) | int main()

FILE: Lecture - 17.cpp
  function main (line 11) | int main()

FILE: Lecture - 18.cpp
  function main (line 3) | int main()

FILE: Lecture - 19.cpp
  function main (line 5) | int main()

FILE: Lecture - 20.cpp
  function main (line 4) | int main()

FILE: Lecture - 21.cpp
  function main (line 4) | int main()

FILE: Lecture - 22.cpp
  function main (line 5) | int main()

FILE: Lecture - 24.cpp
  function seive (line 13) | void seive( int n)
  function main (line 38) | int main()

FILE: Lecture - 25.cpp
  function gcd (line 12) | int gcd(int a, int b)
  function main (line 20) | int main()

FILE: Lecture - 26.cpp
  function main (line 11) | int main()

FILE: Lecture - 27.cpp
  function main (line 11) | int main()

FILE: Lecture - 31.cpp
  function main (line 11) | int main()

FILE: Lecture - 32.cpp
  function main (line 11) | int main()

FILE: Lecture - 33.cpp
  function main (line 11) | int main()

FILE: Lecture - 34.cpp
  function main (line 11) | int main()

FILE: Leetcode/Add Digits.cpp
  class Solution (line 4) | class Solution {
    method addDigitsHelper (line 7) | int addDigitsHelper(int num){
    method addDigits (line 17) | int addDigits(int num) {

FILE: Leetcode/Add Two Numbers Leetcode Solutions in Linkedlist.cpp
  class Solution (line 14) | class Solution {
    method ListNode (line 16) | ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {

FILE: Leetcode/Binary Search leetcode Solution.cpp
  class Solution (line 4) | class Solution {
    method search (line 6) | int search(vector<int>& nums, int target) {

FILE: Leetcode/Boolean Matrix.cpp
  function booleanMatrix (line 3) | void booleanMatrix(vector<vector<int> > &matrix)

FILE: Leetcode/Count the Number of Consistent Strings.cpp
  class Solution (line 3) | class Solution {
    method countConsistentStrings (line 5) | int countConsistentStrings(string allowed, vector<string>& words) {

FILE: Leetcode/Graph/All Paths From Source to Target.cpp
  class Solution (line 3) | class Solution {
    method dfs (line 6) | void dfs(vector<vector<int>>& graph, vector<vector<int>>& ans, vector<...
    method allPathsSourceTarget (line 22) | vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {

FILE: Leetcode/Graph/Course Schedule.cpp
  class Solution (line 3) | class Solution {
    method DFSRec (line 6) | bool DFSRec(int s, vector<bool>&visited, vector<bool>&currVisited, vec...
    method canFinish (line 26) | bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {

FILE: Leetcode/Graph/Detect cycle in a directed graph.cpp
  class Solution (line 3) | class Solution {
    method cycle (line 7) | bool cycle(int s, vector<bool>&visited, vector<bool>&currVisited, vect...
    method isCyclic (line 25) | bool isCyclic(int V, vector<int> adj[]) {

FILE: Leetcode/Graph/Find Eventual Safe States.cpp
  class Solution (line 3) | class Solution {
    method DFSRec (line 6) | bool DFSRec(int s, vector<bool>&visited, vector<bool>&dfsVisited, vect...
    method eventualSafeNodes (line 26) | vector<int> eventualSafeNodes(vector<vector<int>>& graph) {

FILE: Leetcode/Graph/Find if Path Exists in Graph.cpp
  class Solution (line 3) | class Solution {
    method validPath (line 5) | bool validPath(int n, vector<vector<int>>& edges, int start, int end) {

FILE: Leetcode/Graph/Find the Town Judge.cpp
  class Solution (line 3) | class Solution {
    method findJudge (line 5) | int findJudge(int n, vector<vector<int>>& trust) {

FILE: Leetcode/Graph/Flood Fill.cpp
  class Solution (line 3) | class Solution {
    method isValid (line 6) | bool isValid(vector<vector<int>>& image, int i, int j, int n, int m , ...
    method floodFillRec (line 14) | void floodFillRec(vector<vector<int>>& image, int i, int j, int n, int...
    method floodFill (line 31) | vector<vector<int>> floodFill(vector<vector<int>>& image, int sr, int ...

FILE: Leetcode/Graph/Keys and Rooms.cpp
  class Solution (line 3) | class Solution {
    method canVisitAllRooms (line 5) | bool canVisitAllRooms(vector<vector<int>>& rooms) {

FILE: Leetcode/Graph/Max Area of Island.cpp
  class Solution (line 3) | class Solution {
    method isValid (line 6) | bool isValid(int i, int j, int n, int m, vector<vector<int>>& grid){
    method dfs (line 13) | void dfs(vector<vector<int>>& grid, int i, int j, int n, int m, int &a...
    method maxAreaOfIsland (line 31) | int maxAreaOfIsland(vector<vector<int>>& grid) {

FILE: Leetcode/Graph/Minimum Time to Collect All Apples in a Tree.cpp
  class Solution (line 3) | class Solution {
    method dfs (line 6) | int dfs(vector<vector<int>>&adj, int node, int mycost, vector<bool>& h...
    method minTime (line 17) | int minTime(int n, vector<vector<int>>& edges, vector<bool>& hasApple) {

FILE: Leetcode/Graph/Number of Enclaves.cpp
  class Solution (line 3) | class Solution {
    method count (line 6) | int count(vector<vector<int>>& grid){
    method isValid (line 21) | bool isValid(int i, int j, int n, int m, vector<vector<int>>& grid){
    method dfs (line 28) | void dfs(int i, int j, int n, int m, vector<vector<int>>& grid){
    method numEnclaves (line 44) | int numEnclaves(vector<vector<int>>& grid) {

FILE: Leetcode/Graph/Number of Islands.cpp
  class Solution (line 3) | class Solution {
    method isValid (line 7) | bool isValid(int i, int j, int n , int m, vector<vector<char>>& grid){
    method numIslandsRec (line 14) | void numIslandsRec(int i, int j, int n , int m, vector<vector<char>>& ...
    method numIslands (line 32) | int numIslands(vector<vector<char>>& grid) {

FILE: Leetcode/Graph/Number of Provinces.cpp
  class Solution (line 3) | class Solution {
    method dfs (line 6) | void dfs(int s, int n, vector<vector<int>>& isConnected, vector<bool>&...
    method findCircleNum (line 30) | int findCircleNum(vector<vector<int>>& isConnected) {

FILE: Leetcode/Graph/Number of closed Islands.cpp
  class Solution (line 3) | class Solution {
    method isValid (line 7) | bool isValid(int i, int j, int n, int m ,vector<vector<int>>& grid){
    method dfs (line 14) | void dfs(int i, int j, int n, int m ,vector<vector<int>>& grid){
    method closedIsland (line 30) | int closedIsland(vector<vector<int>>& grid) {

FILE: Leetcode/Graph/Rotting Oranges.cpp
  class Solution (line 3) | class Solution {
    method isValid (line 7) | bool isValid(int i, int j, int n, int m, vector<vector<int>>& grid){
    method orangesRotting (line 14) | int orangesRotting(vector<vector<int>>& grid) {

FILE: Leetcode/Graph/Steps by Knight.cpp
  class Solution (line 3) | class Solution
    method isValid (line 8) | bool isValid(int i, int j, int n, vector<vector<bool>>&visited){
    method minStepToReachTarget (line 15) | int minStepToReachTarget(vector<int>&KnightPos,vector<int>&TargetPos,i...

FILE: Leetcode/Graph/Surrounded Regions.cpp
  class Solution (line 3) | class Solution {
    method convert (line 6) | void convert(vector<vector<char>>& board){
    method isValid (line 22) | bool isValid(int i , int j, int n, int m, vector<vector<char>>& board){
    method dfs (line 29) | void dfs(vector<vector<char>>& board, int i , int j, int n, int m){
    method solve (line 46) | void solve(vector<vector<char>>& board) {

FILE: Leetcode/Graph/Time Needed to Inform All Employees.cpp
  class Solution (line 4) | class Solution {
    method dfs (line 10) | void dfs(int manager, vector<int>& informTime){
    method numOfMinutes (line 22) | int numOfMinutes(int n, int headID, vector<int>& manager, vector<int>&...

FILE: Leetcode/Graph/Topological sort .cpp
  class Solution (line 3) | class Solution
    method topoSort (line 7) | vector<int> topoSort(int V, vector<int> adj[])

FILE: Leetcode/Graph/Topological sort using dfs.cpp
  class Solution (line 7) | class Solution
    method DFSRec (line 12) | void DFSRec(int s, stack<int>&st, vector<bool>&visited, vector<int> ad...
    method topoSort (line 25) | vector<int> topoSort(int V, vector<int> adj[])

FILE: Leetcode/Hashing/Check if two arrays are equal or not.cpp
  class Solution (line 3) | class Solution{
    method check (line 7) | bool check(vector<ll> A, vector<ll> B, int n) {

FILE: Leetcode/Hashing/Custom Sort String.cpp
  class Solution (line 3) | class Solution {
    method string (line 5) | string customSortString(string order, string str) {

FILE: Leetcode/Hashing/First Repeating Element.cpp
  class Solution (line 3) | class Solution{
    method firstRepeated (line 6) | int firstRepeated(int arr[], int n) {

FILE: Leetcode/Hashing/Group Anagrams.cpp
  class Solution (line 3) | class Solution {
    method groupAnagrams (line 5) | vector<vector<string>> groupAnagrams(vector<string>& strs) {

FILE: Leetcode/Hashing/Intersection of two arrays.cpp
  function NumberofElementsInIntersection (line 3) | int NumberofElementsInIntersection (int a[], int b[], int n, int m )

FILE: Leetcode/Hashing/Key Pair.cpp
  class Solution (line 3) | class Solution{
    method hasArrayTwoCandidates (line 7) | bool hasArrayTwoCandidates(int arr[], int n, int x) {

FILE: Leetcode/Hashing/LFU Cache.cpp
  class LFUCache (line 3) | class LFUCache {
    method updateFreq (line 10) | void updateFreq(int key){
    method LFUCache (line 32) | LFUCache(int capacity) {
    method get (line 36) | int get(int key) {
    method put (line 44) | void put(int key, int value) {

FILE: Leetcode/Hashing/Non-Repeating Element.cpp
  class Solution (line 4) | class Solution{
    method firstNonRepeating (line 6) | int firstNonRepeating(int arr[], int n)

FILE: Leetcode/Hashing/Pairs with Positive Negative values.cpp
  class Solution (line 4) | class Solution{
    method PosNegPair (line 6) | vector<int> PosNegPair(int a[], int n) {

FILE: Leetcode/Hashing/Relative Sort Array.cpp
  class Solution (line 3) | class Solution {
    method relativeSortArray (line 5) | vector<int> relativeSortArray(vector<int>& arr1, vector<int>& arr2) {

FILE: Leetcode/Hashing/Sort Array by Increasing Frequency.cpp
  class Solution (line 3) | class Solution {
    method frequencySort (line 5) | vector<int> frequencySort(vector<int>& nums) {

FILE: Leetcode/Hashing/Subarray with 0 sum.cpp
  class Solution (line 3) | class Solution{
    method subArrayExists (line 7) | bool subArrayExists(int arr[], int n)

FILE: Leetcode/Hashing/Winner of an election.cpp
  class Solution (line 3) | class Solution{
    method winner (line 7) | vector<string> winner(string arr[],int n)

FILE: Leetcode/Hashing/unordered_map.cpp
  function main (line 5) | int main(){

FILE: Leetcode/Hashing/unordered_set.cpp
  function main (line 5) | int main(){

FILE: Leetcode/Interchanging the rows of a Matrix.cpp
  function interchangeRows (line 4) | void interchangeRows(vector<vector<int> > &matrix)

FILE: Leetcode/Majority Element Geeksforgeeks leetcode Moore's Voting Algorithm.cpp
  function majorityElement (line 8) | int majorityElement(int arr[], int n)
  function main (line 36) | int main(){

FILE: Leetcode/Median of Two sorted arrays.cpp
  function findMedian (line 6) | int findMedian(int arr[], int n, int brr[], int m){

FILE: Leetcode/Middle of the Linked List Leetcode.cpp
  class Solution (line 14) | class Solution {
    method size (line 17) | int size(ListNode* head){
    method ListNode (line 26) | ListNode* middleNode(ListNode* head) {

FILE: Leetcode/Middle of the Linked List.cpp
  class Solution (line 11) | class Solution {
    method ListNode (line 13) | ListNode* middleNode(ListNode* head) {

FILE: Leetcode/Move Zeroes.cpp
  class Solution (line 3) | class Solution {
    method moveZeroes (line 5) | void moveZeroes(vector<int>& nums) {

FILE: Leetcode/Multiply two matrices.cpp
  function multiplyMatrix (line 3) | vector<vector<int> > multiplyMatrix( const vector<vector<int> >& A, cons...

FILE: Leetcode/Non Repeating Character.cpp
  function nonrepeatingCharacter (line 2) | char nonrepeatingCharacter(string s)

FILE: Leetcode/Peak element.cpp
  function peakElement (line 3) | int peakElement(int arr[], int n)

FILE: Leetcode/Rearrange Array Alternately Geeksforgeeks.cpp
  function rearrange (line 6) | void rearrange(long long int arr[], int n){
  function main (line 26) | int main()

FILE: Leetcode/Recursion/0-1 Knapsack Problem Top down.cpp
  class Solution (line 3) | class Solution
    method knapSack (line 7) | int knapSack(int W, int wt[], int val[], int n)

FILE: Leetcode/Recursion/Best Time to Buy and Sell Stock.cpp
  class Solution (line 3) | class Solution {
    method maxProfit (line 5) | int maxProfit(vector<int>& prices) {

FILE: Leetcode/Recursion/Climbing Stairs.cpp
  class Solution (line 4) | class Solution {
    method climbStairs (line 6) | int climbStairs(int n) {

FILE: Leetcode/Recursion/Decode Ways.cpp
  class Solution (line 4) | class Solution {
    method numDecodingsHelper (line 7) | int numDecodingsHelper(string s, int pos){
    method numDecodings (line 19) | int numDecodings(string s) {

FILE: Leetcode/Recursion/Delete middle element of a stack.cpp
  class Solution (line 3) | class Solution
    method deleteMidHelper (line 8) | void deleteMidHelper(stack<int>&st, int count, int &pos){
    method deleteMid (line 18) | void deleteMid(stack<int>&s, int sizeOfStack)

FILE: Leetcode/Recursion/Divisor Game.cpp
  class Solution (line 3) | class Solution {
    method divisorGame (line 5) | bool divisorGame(int n) {

FILE: Leetcode/Recursion/Factorial.cpp
  class Solution (line 3) | class Solution{
    method factorial (line 5) | long long int factorial(int N){

FILE: Leetcode/Recursion/Fibonacci Number.cpp
  class Solution (line 3) | class Solution {
    method fib (line 5) | int fib(int n) {

FILE: Leetcode/Recursion/House Robber.cpp
  class Solution (line 4) | class Solution {
    method fun (line 6) | int fun(vector<int>& nums, int n){
    method rob (line 14) | int rob(vector<int>& nums) {

FILE: Leetcode/Recursion/Largest Element in Array.cpp
  class Solution (line 3) | class Solution
    method largest (line 6) | int largest(vector<int> &arr, int n)

FILE: Leetcode/Recursion/Min Cost Climbing Stairs.cpp
  class Solution (line 4) | class Solution {
    method minCost (line 7) | int minCost(vector<int>& cost, int n){
    method minCostClimbingStairs (line 14) | int minCostClimbingStairs(vector<int>& cost) {

FILE: Leetcode/Recursion/Nth Fibonacci Number.cpp
  class Solution (line 4) | class Solution {
    method nthFibonacci (line 7) | long long int nthFibonacci(long long int n){

FILE: Leetcode/Recursion/Partition Equal Subset Sum.cpp
  class Solution (line 6) | class Solution {
    method subsetSum (line 9) | bool subsetSum(vector<int>& nums, int n, int sum){
    method canPartition (line 18) | bool canPartition(vector<int>& nums) {
    method subsetSum (line 38) | bool subsetSum(vector<int>& nums, int n, int sum, vector<vector<int>>&...
    method canPartition (line 46) | bool canPartition(vector<int>& nums) {
    method canPartition (line 73) | bool canPartition(vector<int>& nums) {
  class Solution (line 35) | class Solution {
    method subsetSum (line 9) | bool subsetSum(vector<int>& nums, int n, int sum){
    method canPartition (line 18) | bool canPartition(vector<int>& nums) {
    method subsetSum (line 38) | bool subsetSum(vector<int>& nums, int n, int sum, vector<vector<int>>&...
    method canPartition (line 46) | bool canPartition(vector<int>& nums) {
    method canPartition (line 73) | bool canPartition(vector<int>& nums) {
  class Solution (line 71) | class Solution {
    method subsetSum (line 9) | bool subsetSum(vector<int>& nums, int n, int sum){
    method canPartition (line 18) | bool canPartition(vector<int>& nums) {
    method subsetSum (line 38) | bool subsetSum(vector<int>& nums, int n, int sum, vector<vector<int>>&...
    method canPartition (line 46) | bool canPartition(vector<int>& nums) {
    method canPartition (line 73) | bool canPartition(vector<int>& nums) {

FILE: Leetcode/Recursion/Perfect Squares.cpp
  class Solution (line 4) | class Solution {
    method solve (line 6) | int solve(int n){
    method numSquares (line 18) | int numSquares(int n) {

FILE: Leetcode/Recursion/Perfect Sum Problem.cpp
  class Solution (line 7) | class Solution{
    method countSubset (line 11) | int countSubset(int arr[], int n, int sum){
    method perfectSum (line 29) | int perfectSum(int arr[], int n, int sum)
    method countSubset (line 45) | int countSubset(int arr[], int n, int sum, vector<vector<int>>&dp){
    method perfectSum (line 66) | int perfectSum(int arr[], int n, int sum)
  class Solution (line 41) | class Solution{
    method countSubset (line 11) | int countSubset(int arr[], int n, int sum){
    method perfectSum (line 29) | int perfectSum(int arr[], int n, int sum)
    method countSubset (line 45) | int countSubset(int arr[], int n, int sum, vector<vector<int>>&dp){
    method perfectSum (line 66) | int perfectSum(int arr[], int n, int sum)

FILE: Leetcode/Recursion/Power Of Numbers.cpp
  class Solution (line 3) | class Solution{
    method power (line 7) | long long power(int N,int R)

FILE: Leetcode/Recursion/Print 1 To N Without Loop.cpp
  class Solution (line 3) | class Solution{
    method printNos (line 6) | void printNos(int N)

FILE: Leetcode/Recursion/Reverse a String.cpp
  function string (line 3) | string reverseWord(string str){

FILE: Leetcode/Recursion/Subset Sum Problem.cpp
  class Solution (line 6) | class Solution{
    method subsetSum (line 8) | bool subsetSum(vector<int>arr, int n, int sum){
    method isSubsetSum (line 17) | bool isSubsetSum(vector<int>arr, int sum){
    method subsetSum (line 29) | bool subsetSum(vector<int>arr, int n, int sum, vector<vector<int>>&dp){
    method isSubsetSum (line 37) | bool isSubsetSum(vector<int>arr, int sum){
  class Solution (line 27) | class Solution{
    method subsetSum (line 8) | bool subsetSum(vector<int>arr, int n, int sum){
    method isSubsetSum (line 17) | bool isSubsetSum(vector<int>arr, int sum){
    method subsetSum (line 29) | bool subsetSum(vector<int>arr, int n, int sum, vector<vector<int>>&dp){
    method isSubsetSum (line 37) | bool isSubsetSum(vector<int>arr, int sum){

FILE: Leetcode/Recursion/Sum of Array.cpp
  class Solution (line 3) | class Solution{
    method sum (line 7) | int sum(int arr[], int n) {

FILE: Leetcode/Recursion/Target Sum.cpp
  class Solution (line 3) | class Solution {
    method countSubset (line 6) | int countSubset(vector<int>& nums, int n, int sum, vector<vector<int>>...
    method findTargetSumWays (line 26) | int findTargetSumWays(vector<int>& nums, int target) {

FILE: Leetcode/Recursion/Tower Of Hanoi.cpp
  class Solution (line 3) | class Solution{
    method TOHHelper (line 9) | void TOHHelper(int N, int from, int to, int aux){
    method toh (line 17) | long long toh(int N, int from, int to, int aux) {

FILE: Leetcode/Reverse Linked List.cpp
  class Solution (line 13) | class Solution {
    method ListNode (line 15) | ListNode* reverseList(ListNode* head) {

FILE: Leetcode/Rotate Array Leetcode.cpp
  class Solution (line 1) | class Solution {
    method reverse (line 4) | void reverse(vector<int> &num, int low, int high){
    method rotate (line 11) | void rotate(vector<int>& nums, int k) {

FILE: Leetcode/Rotate List.cpp
  class Solution (line 14) | class Solution {
    method size (line 17) | int size(ListNode* head){
    method ListNode (line 26) | ListNode* rotateRight(ListNode* head, int k) {

FILE: Leetcode/Search in a row-column sorted Matrix.cpp
  function search (line 5) | bool search(vector<vector<int> > matrix, int n, int m, int x)

FILE: Leetcode/Single Number Leetcode solution.cpp
  class Solution (line 5) | class Solution {
    method singleNumber (line 7) | int singleNumber(vector<int>& nums) {

FILE: Leetcode/Sort Array By Parity.cpp
  class Solution (line 1) | class Solution {
    method sortArrayByParity (line 3) | vector<int> sortArrayByParity(vector<int>& A) {

FILE: Leetcode/Sort Colors.cpp
  class Solution (line 8) | class Solution {
    method sortColors (line 10) | void sortColors(vector<int>& nums) {

FILE: Leetcode/Spirally traversing a matrix.cpp
  class Solution (line 3) | class Solution
    method spirallyTraverse (line 6) | vector<int> spirallyTraverse(vector<vector<int> > matrix, int r, int c)

FILE: Leetcode/Square root.cpp
  function floorSqrt (line 13) | long long int floorSqrt(long long int x)
  function main (line 39) | int main()

FILE: Leetcode/Subarray sum equals K.cpp
  class Solution (line 1) | class Solution {
    method subarraySum (line 3) | int subarraySum(vector<int>& nums, int k) {

FILE: Leetcode/Trapping Rain Water.cpp
  function trappingWater (line 7) | int trappingWater(int arr[], int n){
  function main (line 32) | int main(){

FILE: Leetcode/Tree/Balanced Binary Tree.cpp
  class Solution (line 14) | class Solution {
    method height (line 17) | int height(TreeNode* root){
    method inorderUtil (line 24) | void inorderUtil(TreeNode* root, bool & ans){
    method isBalanced (line 38) | bool isBalanced(TreeNode* root) {

FILE: Leetcode/Tree/Binary Tree Inorder Traversal.cpp
  class Solution (line 15) | class Solution {
    method preorder (line 18) | void preorder(TreeNode* root, vector<int>  &ans){
    method inorderTraversal (line 26) | vector<int> inorderTraversal(TreeNode* root) {

FILE: Leetcode/Tree/Binary Tree Right Side View.cpp
  class Solution (line 14) | class Solution {
    method rightSideView (line 16) | vector<int> rightSideView(TreeNode* root) {

FILE: Leetcode/Tree/Binary Tree Zigzag Level Order Traversal.cpp
  function zigzagLevelOrder (line 3) | vector<vector<int>> zigzagLevelOrder(TreeNode* root) {

FILE: Leetcode/Tree/Children Sum Parent.cpp
  function isSumProperty (line 3) | int isSumProperty(Node *root)

FILE: Leetcode/Tree/Construct Binary Tree from Preorder and Inorder Traversal.cpp
  class Solution (line 14) | class Solution {
    method TreeNode (line 19) | TreeNode* buildTreeUtil(vector<int>& preorder, vector<int>& inorder, i...
    method TreeNode (line 42) | TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {

FILE: Leetcode/Tree/Diameter of Binary Tree.cpp
  class Solution (line 14) | class Solution {
    method height (line 19) | int height(TreeNode* root){
    method diameterOfBinaryTree (line 32) | int diameterOfBinaryTree(TreeNode* root) {

FILE: Leetcode/Tree/Invert Binary Tree.cpp
  class Solution (line 14) | class Solution {
    method TreeNode (line 16) | TreeNode* invertTree(TreeNode* root) {

FILE: Leetcode/Tree/Level Order Traversal.cpp
  function levelOrder (line 3) | vector<vector<int>> levelOrder(TreeNode* root) {

FILE: Leetcode/Tree/Lowest Common Ancestor of a Binary Tree.cpp
  class Solution (line 16) | class Solution {
    method findPath (line 19) | bool findPath(TreeNode* root,  vector<TreeNode*> &path, TreeNode* n){
    method TreeNode (line 33) | TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* ...
    method TreeNode (line 71) | TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* ...
  class Solution (line 67) | class Solution {
    method findPath (line 19) | bool findPath(TreeNode* root,  vector<TreeNode*> &path, TreeNode* n){
    method TreeNode (line 33) | TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* ...
    method TreeNode (line 71) | TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* ...

FILE: Leetcode/Tree/Maximum Depth of Binary Tree.cpp
  class Solution (line 3) | class Solution {
    method maxDepth (line 5) | int maxDepth(TreeNode* root) {

FILE: Leetcode/Tree/Populating Next Right Pointers in Each Node.cpp
  class Solution (line 21) | class Solution {
    method Node (line 23) | Node* connect(Node* root) {

FILE: Leetcode/Tree/Subtree of Another Tree.cpp
  class Solution (line 14) | class Solution {
    method match (line 20) | bool match(TreeNode* root, TreeNode* subRoot){
    method inorder (line 38) | void inorder(TreeNode* root, TreeNode* subRoot){
    method isSubtree (line 49) | bool isSubtree(TreeNode* root, TreeNode* subRoot) {

FILE: Leetcode/Tree/Symmetric Tree.cpp
  class Solution (line 14) | class Solution {
    method match (line 17) | bool match(TreeNode* root1, TreeNode* root2){
    method isSymmetric (line 34) | bool isSymmetric(TreeNode* root) {

FILE: Leetcode/Tree/Vertical Width of a Binary Tree .cpp
  function inorderUtil (line 21) | void inorderUtil(Node* root, int hd){
  function verticalWidth (line 30) | int verticalWidth(Node* root)

FILE: Leetcode/Tree/same Tree.cpp
  class Solution (line 15) | class Solution {
    method inorder (line 18) | void inorder(TreeNode* root, vector<int>&v){
    method preorder (line 27) | void preorder(TreeNode* root, vector<int>&v){
    method isSameTree (line 36) | bool isSameTree(TreeNode* p, TreeNode* q) {
    method isSameTree (line 58) | bool isSameTree(TreeNode* p, TreeNode* q) {
  class Solution (line 56) | class Solution {
    method inorder (line 18) | void inorder(TreeNode* root, vector<int>&v){
    method preorder (line 27) | void preorder(TreeNode* root, vector<int>&v){
    method isSameTree (line 36) | bool isSameTree(TreeNode* p, TreeNode* q) {
    method isSameTree (line 58) | bool isSameTree(TreeNode* p, TreeNode* q) {

FILE: Leetcode/count 1's in binary array.cpp
  function countOnes (line 11) | int countOnes(int arr[], int N)
  function main (line 39) | int main()

FILE: Leetcode/linked-list-cycle.cpp
  class Solution (line 12) | class Solution {
    method hasCycle (line 14) | bool hasCycle(ListNode *head) {

FILE: Leetcode/linkedlist/Copy List with Random Pointer.cpp
  class Solution (line 20) | class Solution {
    method Node (line 22) | Node* copyRandomList(Node* head) {

FILE: Leetcode/linkedlist/Delete Node in a Linked List.cpp
  class Solution (line 3) | class Solution {
    method deleteNode (line 5) | void deleteNode(ListNode* node) {

FILE: Leetcode/linkedlist/Intersection of Two Linked Lists.cpp
  class Solution (line 11) | class Solution {
    method ListNode (line 13) | ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {

FILE: Leetcode/linkedlist/Linked List Cycle II.cpp
  class Solution (line 11) | class Solution {
    method ListNode (line 13) | ListNode *detectCycle(ListNode *head) {

FILE: Leetcode/linkedlist/Merge Two Sorted Lists.cpp
  class Solution (line 13) | class Solution {
    method ListNode (line 15) | ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {

FILE: Leetcode/linkedlist/Palindrome Linked List.cpp
  class Solution (line 13) | class Solution {
    method isPalindrome (line 15) | bool isPalindrome(ListNode* head) {

FILE: Leetcode/linkedlist/Remove Duplicates from Sorted List.cpp
  class Solution (line 3) | class Solution {
    method ListNode (line 5) | ListNode* deleteDuplicates(ListNode* head) {

FILE: Leetcode/linkedlist/Remove Nth Node From End of List.cpp
  class Solution (line 13) | class Solution {
    method ListNode (line 15) | ListNode* removeNthFromEnd(ListNode* head, int n) {

FILE: Leetcode/linkedlist/Remove duplicates from an unsorted linked list.cpp
  class Solution (line 17) | class Solution
    method Node (line 21) | Node * removeDuplicates( Node *head)

FILE: Leetcode/linkedlist/Reverse Linked List.cpp
  class Solution (line 13) | class Solution {
    method ListNode (line 15) | ListNode* reverseList(ListNode* head) {

FILE: Leetcode/linkedlist/Sort List.cpp
  class Solution (line 13) | class Solution {
    method ListNode (line 16) | ListNode* Mid(ListNode* head){
    method ListNode (line 27) | ListNode* mergeSortedList(ListNode *p1, ListNode *p2){
    method ListNode (line 52) | ListNode* sortList(ListNode* head) {

FILE: Leetcode/linkedlist/Swap Nodes in Pairs.cpp
  class Solution (line 13) | class Solution {
    method ListNode (line 15) | ListNode* swapPairs(ListNode* head) {

FILE: Leetcode/linkedlist/Swapping Nodes in a Linked List.cpp
  class Solution (line 13) | class Solution {
    method ListNode (line 15) | ListNode* swapNodes(ListNode* head, int k) {

FILE: Leetcode/stack/Evaluate Reverse Polish Notation.cpp
  class Solution (line 3) | class Solution {
    method evalRPN (line 5) | int evalRPN(vector<string>& tokens) {

FILE: Leetcode/stack/Implement Queue using Stacks.cpp
  class MyQueue (line 3) | class MyQueue {
    method MyQueue (line 9) | MyQueue() {
    method push (line 13) | void push(int x) {
    method pop (line 17) | int pop() {
    method peek (line 23) | int peek() {
    method empty (line 34) | bool empty() {

FILE: Leetcode/stack/Implement Stack using Queues.cpp
  class MyStack (line 3) | class MyStack {
    method MyStack (line 8) | MyStack() {
    method push (line 12) | void push(int x) {
    method pop (line 25) | int pop() {
    method top (line 32) | int top() {
    method empty (line 36) | bool empty() {

FILE: Leetcode/stack/Largest Rectangle in Histogram.cpp
  class Solution (line 3) | class Solution {
    method previous_smaller (line 6) | vector<int> previous_smaller(vector<int>& heights){
    method next_smaller (line 22) | vector<int> next_smaller(vector<int>& heights){
    method largestRectangleArea (line 39) | int largestRectangleArea(vector<int>& heights) {

FILE: Leetcode/stack/Min Stack.cpp
  class MinStack (line 3) | class MinStack {
    method MinStack (line 7) | MinStack() {
    method push (line 11) | void push(int val) {
    method pop (line 19) | void pop() {
    method top (line 28) | int top() {
    method getMin (line 32) | int getMin() {

FILE: Leetcode/stack/Next Greater Element I.cpp
  class Solution (line 3) | class Solution {
    method nextGreaterElement (line 5) | vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {

FILE: Leetcode/stack/Online Stock Span.cpp
  class StockSpanner (line 3) | class StockSpanner {
    method StockSpanner (line 6) | StockSpanner() {
    method next (line 10) | int next(int price) {

FILE: Leetcode/stack/Remove All Adjacent Duplicates In String.cpp
  class Solution (line 3) | class Solution {
    method string (line 5) | string removeDuplicates(string s) {

FILE: Leetcode/stack/Remove All Adjacent Duplicates in String II.cpp
  class Solution (line 3) | class Solution {
    method string (line 5) | string removeDuplicates(string s, int k) {

FILE: Leetcode/stack/Reverse First K elements of Queue.cpp
  function main (line 9) | int main() {
  function modifyQueue (line 35) | queue<int> modifyQueue(queue<int> q, int k) {

FILE: Leetcode/stack/Valid Parentheses.cpp
  class Solution (line 3) | class Solution {
    method isValid (line 5) | bool isValid(string s) {

FILE: Leetcode/string/Find the Index of the First Occurrence in a String.cpp
  class Solution (line 4) | class Solution {
    method fillLPS (line 7) | vector<int> fillLPS(string str){
    method strStr (line 29) | int strStr(string haystack, string needle) {
    method strStr (line 62) | int strStr(string haystack, string needle) {
  class Solution (line 60) | class Solution {
    method fillLPS (line 7) | vector<int> fillLPS(string str){
    method strStr (line 29) | int strStr(string haystack, string needle) {
    method strStr (line 62) | int strStr(string haystack, string needle) {

FILE: Leetcode/string/Maximum Ice Cream Bars.cpp
  class Solution (line 3) | class Solution {
    method maxIceCream (line 5) | int maxIceCream(vector<int>& costs, int coins) {

FILE: Leetcode/sum of numbers in string.cpp
  function findSum (line 6) | int findSum(string s)
  function main (line 25) | int main()

FILE: STL/Array_Algorithms_in_stl.cpp
  function main (line 15) | int main(){

FILE: STL/Binary search in STL.cpp
  function show (line 13) | void show(int a[], int asize){
  function main (line 19) | int main(){

FILE: STL/List_in_STL.cpp
  function show (line 15) | void show(list<int> l){
  function main (line 23) | int main(){

FILE: STL/Queue_in_STL.cpp
  function show (line 15) | void show(queue<int> QUEUE){
  function main (line 24) | int main(){

FILE: STL/Vectors_Functions_in_STL.cpp
  function show (line 15) | void show(vector<int>v){
  function main (line 21) | int main(){

FILE: STL/What is STL.cpp
  function main (line 14) | int main(){

FILE: STL/deque_in_STL.cpp
  function showDeque (line 15) | void showDeque(deque<int> q){
  function main (line 23) | int main(){

FILE: STL/pair_in_STL.cpp
  function main (line 13) | int main(){

FILE: STL/priority Queue in STL.cpp
  function showPriorityQueue (line 15) | void showPriorityQueue(priority_queue<int> pq){
  function main (line 24) | int main(){

FILE: STL/sort_in_STL.cpp
  function showArray (line 14) | void showArray(int a[]){
  function main (line 20) | int main(){

FILE: STL/stack in STL data structure.cpp
  function printElementOfStack (line 15) | void printElementOfStack(stack<int> s){
  function main (line 22) | int main(){

FILE: Templates_in_c++.cpp
  function T (line 14) | T MAX ( T a , T b){
  class boy (line 19) | class boy {
  function main (line 23) | int main(){

FILE: Tree/Binary_tree.cpp
  type node (line 12) | struct node{
  function node (line 17) | node* newNode(int data){
  function printNode (line 34) | void printNode(node *n){
  function main (line 41) | int main(){

FILE: Tree/Code of Deletion of Node in BST.cpp
  type node (line 12) | struct node{
  function node (line 17) | node* newNode(int data){
  function inorder (line 26) | void inorder(node* root){
  function node (line 34) | node *insert(node * node, int key){
  function node (line 55) | node * minValueNode(node * node){
  function node (line 68) | node * deleteNode(node * root, int key){
  function main (line 113) | int main(){

FILE: Tree/Code of Inorder Traversal.cpp
  type node (line 12) | struct node{
  function node (line 18) | node* newNode(int data){
  function printInorder (line 27) | void printInorder(node *node){
  function main (line 42) | int main(){

FILE: Tree/Insertion in BST.cpp
  type node (line 12) | struct node{
  function node (line 17) | node* newNode(int data){
  function inorder (line 26) | void inorder(node* root){
  function node (line 34) | node *insert(node * node, int key){
  function main (line 51) | int main(){

FILE: Tree/code of Hashing in C++.cpp
  function search (line 17) | bool search(int x){
  function insert (line 34) | void insert(int a[], int n){
  function main (line 45) | int main(){

FILE: Tree/code of preorer and Postorder traversal.cpp
  type node (line 12) | struct node{
  function node (line 18) | node* newNode(int data){
  function printInorder (line 27) | void printInorder(node *node){
  function printPreorder (line 41) | void printPreorder(node *node){
  function printPostorder (line 58) | void printPostorder(node *node){
  function main (line 74) | int main(){

FILE: chef and Icecream.cpp
  function main (line 14) | int main(){

FILE: chef and string.cpp
  function main (line 14) | int main(){