SYMBOL INDEX (143 symbols across 76 files)

FILE: DSA Essentials Solutions/2d Arrays/PascalsTriangle.cpp
  function printPascal (line 14) | vector<vector<int>> printPascal(int n)
  function binomialCoeff (line 33) | int binomialCoeff(int n, int k)

FILE: DSA Essentials Solutions/2d Arrays/SubmatrixSum.cpp
  function sum (line 10) | int sum(vector<vector<int>> v, int sr, int sc, int er, int ec){

FILE: DSA Essentials Solutions/2d Arrays/WavePrint.cpp
  function WavePrint (line 7) | vector<int> WavePrint(int m, int n, vector<vector<int>> arr)

FILE: DSA Essentials Solutions/Arrays/K-rotate.cpp
  function kRotate (line 6) | vector<int> kRotate(vector<int> a, int k)

FILE: DSA Essentials Solutions/Arrays/LargestElement.cpp
  function largestElement (line 6) | int largestElement(vector<int> A) {

FILE: DSA Essentials Solutions/Arrays/LowerBound.cpp
  function lowerBound (line 9) | int lowerBound(vector<int> A, int Val) {

FILE: DSA Essentials Solutions/Arrays/MaximumSumSubarray.cpp
  function maxSumSubarray (line 7) | int maxSumSubarray(vector<int> A) {

FILE: DSA Essentials Solutions/Arrays/SortedPairSum.cpp
  function closestSum (line 7) | pair<int, int> closestSum(vector<int> arr, int x){

FILE: DSA Essentials Solutions/Backtracking/N-QueenWays.cpp
  function isSafe (line 7) | int isSafe(int N, int mat[][20], int r, int c)
  function solve (line 36) | void solve(int N,int mat[][20], int r)
  function nQueen (line 65) | int nQueen(int n){

FILE: DSA Essentials Solutions/Backtracking/RatAndMice.cpp
  function ratchase (line 4) | void ratchase(vector<string> a,vector<vector<int>> &b,vector<vector<int>...
  function ratAndMice (line 35) | vector<vector<int>> ratAndMice(vector<string> a) {

FILE: DSA Essentials Solutions/Backtracking/UniqueSubset.cpp
  function recur (line 4) | void recur(vector<int> &nums, vector<int> ans, int i)
  function uniqueSubsets (line 17) | vector<vector<int>> uniqueSubsets(vector<int> nums){

FILE: DSA Essentials Solutions/Backtracking/WordBreakProblem.cpp
  function help (line 6) | void help(string s, int n, string res, vector<string> &word)
  function wordBreak (line 32) | int wordBreak(string s, vector<string> &dictionary)

FILE: DSA Essentials Solutions/Backtracking/WordSearch.cpp
  function recur (line 4) | void recur(vector<vector<char>>& board, string &word, int i, int j, int k)
  function wordSearch (line 26) | bool wordSearch(vector<vector<char>> &board, string word)

FILE: DSA Essentials Solutions/Basic Sorting Algorithms/Chopsticks.cpp
  function pairSticks (line 7) | int pairSticks(vector<int> length, int D)

FILE: DSA Essentials Solutions/Basic Sorting Algorithms/DefenseKingdom.cpp
  function defkin (line 10) | int defkin(int W, int H, vector<pair<int, int>> position)

FILE: DSA Essentials Solutions/Basic Sorting Algorithms/OptimisedBubbleSort.cpp
  function optimizedBubbleSort (line 4) | vector<int> optimizedBubbleSort(vector<int> arr){

FILE: DSA Essentials Solutions/Basic Sorting Algorithms/SortingCartesianProducts.cpp
  function sortCartesian (line 7) | vector<pair<int, int>> sortCartesian(vector<pair<int, int>> v)

FILE: DSA Essentials Solutions/Basic Sorting Algorithms/SortingWithComparator.cpp
  function compare (line 3) | bool compare(int a, int b){
  function sortingWithComparator (line 6) | vector<int> sortingWithComparator(vector<int> v, bool flag){

FILE: DSA Essentials Solutions/BinarySearchTree/DeleteInBST.cpp
  class node (line 3) | class node{
    method node (line 8) | node(int d){
  function node (line 16) | node* deleteNode(node* root, int k){
    method node (line 8) | node(int d){

FILE: DSA Essentials Solutions/BinarySearchTree/IsBST.cpp
  class Node (line 4) | class Node
    method Node (line 11) | Node(int key){
  function isBSTUtil (line 17) | bool isBSTUtil(Node* node, int min, int max)
  function isBST (line 35) | bool isBST(Node * root){

FILE: DSA Essentials Solutions/BinarySearchTree/MirrorABST.cpp
  class Node (line 4) | class Node
    method Node (line 11) | Node(int key){
  function mirror (line 17) | void mirror(Node* node)
  function Node (line 36) | Node* mirrorBST(Node * root){
    method Node (line 11) | Node(int key){

FILE: DSA Essentials Solutions/BinaryTree/ExpressionTree.cpp
  type Node (line 7) | struct Node {
  function isOp (line 12) | bool isOp(string data)
  function evalTree (line 19) | int evalTree(Node* root){

FILE: DSA Essentials Solutions/BinaryTree/K-thLevel.cpp
  type Node (line 6) | struct Node {
  function printKthLevel (line 11) | vector<int> printKthLevel(Node* root, int k){

FILE: DSA Essentials Solutions/BinaryTree/MinDepth.cpp
  type Node (line 4) | struct Node {
  function minDepth (line 9) | int minDepth(Node *root) {

FILE: DSA Essentials Solutions/BinaryTree/RemoveHalfNodes.cpp
  type Node (line 4) | struct Node {
  function inorder (line 9) | void inorder(Node* root, vector<int> &v)
  function Node (line 17) | Node *help(Node *root)
  function removeHalfNodes (line 33) | vector<int> removeHalfNodes(Node *root)

FILE: DSA Essentials Solutions/BinaryTree/SumOfNodes.cpp
  type Node (line 4) | struct Node {
  function sumBT (line 9) | int sumBT(Node* root)

FILE: DSA Essentials Solutions/BinaryTree/SymmetricTree.cpp
  type Node (line 4) | struct Node {
  function isSymmetric (line 8) | bool isSymmetric(Node* root) {

FILE: DSA Essentials Solutions/BinaryTree/TargetPathSum.cpp
  type Node (line 4) | struct Node {
  function help (line 10) | void help(Node* root, int a, vector<int> &v, int b)
  function pathSum (line 37) | vector<vector<int>> pathSum(Node* root, int targetSum) {

FILE: DSA Essentials Solutions/Bit Manipulation/EarthLevels.cpp
  function convertDecimalToBinary (line 7) | long long convertDecimalToBinary(unsigned long long int n)
  function earthLevel (line 22) | int earthLevel(int k)

FILE: DSA Essentials Solutions/Bit Manipulation/ModuloExponentiation.cpp
  function power (line 8) | int power(int x, int y, int p)

FILE: DSA Essentials Solutions/Bit Manipulation/SubsetSumQueries.cpp
  function subsetSum (line 7) | vector<bool> subsetSum(vector<int> v, vector<int> q)

FILE: DSA Essentials Solutions/Bit Manipulation/Xoring.cpp
  function xoring (line 7) | int xoring(vector<int> v)

FILE: DSA Essentials Solutions/Divide and Conquer/2DArrayMerge.cpp
  function merge_row (line 5) | void merge_row(vector<vector<int>> &mat,int i, int cs, int cm, int ce){
  function merge_col (line 37) | void merge_col(vector<vector<int>> &mat,int j, int rs, int rm, int re){
  function merge (line 68) | void merge(int m, int n, vector<vector<int>> &mat, int rs, int rm, int r...
  function merge_sort (line 85) | void merge_sort(int m, int n, vector<vector<int>> &mat, int rs, int re, ...
  function mergeSort (line 111) | vector<vector<int>> mergeSort(int m, int n, vector<vector<int>> v){

FILE: DSA Essentials Solutions/Divide and Conquer/BinarySearchUsingRecursion.cpp
  function binary (line 12) | int binary(vector<int> arr, int l, int r, int x)
  function binarySearch (line 37) | int binarySearch(vector<int> v, int x)

FILE: DSA Essentials Solutions/Dynamic Programming/CoinChange.cpp
  function coinChange (line 4) | long long coinChange(int s, int n , vector<int> a, long long dp[500][100])
  function findCombinations (line 17) | long long findCombinations(int n, vector<int> coins)

FILE: DSA Essentials Solutions/Dynamic Programming/MinimumPartitioning.cpp
  function findMin (line 4) | int findMin(vector<int> arr)

FILE: DSA Essentials Solutions/Dynamic Programming/OptimalGameStrategy.cpp
  function game (line 4) | int game(int n, vector<int> v, int s, int e){
  function MaxValue (line 15) | int MaxValue(int n, vector<int> v){

FILE: DSA Essentials Solutions/Dynamic Programming/Vacation.cpp
  function topDown (line 35) | int topDown(viii &v, int n, int i, int dp[][4], int prev)
  function vacation (line 48) | int vacation(vector<int> a, vector<int> b, vector<int> c)

FILE: DSA Essentials Solutions/Graphs/AllPathsFromSourceToTarget.cpp
  function dfs (line 3) | void dfs(vector<vector<int>>& graph, vector<vector<int>>& result, vector...
  function allPathsSourceTarget (line 13) | vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {

FILE: DSA Essentials Solutions/Graphs/FindStarInGraph.cpp
  function findCenter (line 4) | int findCenter(vector<vector<int>>& v) {

FILE: DSA Essentials Solutions/Graphs/KeysAndRooms.cpp
  function canVisitAllRooms (line 4) | bool canVisitAllRooms(vector<vector<int>>& rooms) {

FILE: DSA Essentials Solutions/Hashing/ArrayIntersection.cpp
  function intersection (line 5) | vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {

FILE: DSA Essentials Solutions/Hashing/KSumSubarray.cpp
  function longestSubarrayKSum (line 5) | int longestSubarrayKSum(vector<int> arr,int k){

FILE: DSA Essentials Solutions/Heaps/MaximumProduct.cpp
  function maxProduct (line 5) | int maxProduct(vector<int>& nums) {

FILE: DSA Essentials Solutions/Heaps/ReduceArraySizeToHalf.cpp
  function minSetSize (line 5) | int minSetSize(vector<int>& arr) {

FILE: DSA Essentials Solutions/Heaps/RelativeRanks.cpp
  function findRelativeRanks (line 3) | vector<string> findRelativeRanks(vector<int>& score) {

FILE: DSA Essentials Solutions/Heaps/WeakestRows.cpp
  function kWeakestRows (line 5) | vector<int> kWeakestRows(vector<vector<int>>& mat, int k) {

FILE: DSA Essentials Solutions/Linked List/AlternateMerge.cpp
  class node (line 7) | class node{
    method node (line 12) | node(int data){
  function node (line 18) | node* apend(node* root, int d){
    method node (line 12) | node(int data){
  function node (line 28) | node* alternateMerge(node * root1, node* root2){
    method node (line 12) | node(int data){

FILE: DSA Essentials Solutions/Linked List/BubbleSortOnLinkedList.cpp
  class node (line 5) | class node
    method node (line 10) | node(int data)
  function len (line 18) | int len(node* head)
  function node (line 30) | node* bubble_sort_LinkedList_itr(node* head)
    method node (line 10) | node(int data)

FILE: DSA Essentials Solutions/Linked List/DeleteTail.cpp
  class node (line 7) | class node{
    method node (line 12) | node(int data){
  function node (line 18) | node* deleteTail(node * head){
    method node (line 12) | node(int data){

FILE: DSA Essentials Solutions/Linked List/KthLastElement.cpp
  class node (line 7) | class node{
    method node (line 12) | node(int data){
  function kthLastElement (line 18) | int kthLastElement(node * head,int k){

FILE: DSA Essentials Solutions/Queues/FirstNonRepeatingLetter.cpp
  function firstnonrepeating (line 7) | vector<char> firstnonrepeating(vector<char> str)

FILE: DSA Essentials Solutions/Queues/InterleaveTwoHalvesOfQueue.cpp
  function interLeave (line 6) | queue<int> interLeave(queue<int> q){

FILE: DSA Essentials Solutions/Queues/SortQueueWithConstantSpace.cpp
  function minIndex (line 4) | int minIndex(queue<int> &q, int sortedIndex)
  function insertMinToRear (line 24) | void insertMinToRear(queue<int> &q, int min_index)
  function sortQueue (line 40) | void sortQueue(queue<int> &q)
  function sortqueue (line 49) | queue<int> sortqueue(queue<int> &q)

FILE: DSA Essentials Solutions/Recursion/2DArrayMerge.cpp
  function merge_row (line 6) | void merge_row(vector<vector<int>> &mat,int i, int cs, int cm, int ce){
  function merge_col (line 38) | void merge_col(vector<vector<int>> &mat,int j, int rs, int rm, int re){
  function merge (line 69) | void merge(int m, int n, vector<vector<int>> &mat, int rs, int rm, int r...
  function merge_sort (line 86) | void merge_sort(int m, int n, vector<vector<int>> &mat, int rs, int re, ...
  function mergeSort (line 112) | vector<vector<int>> mergeSort(int m, int n, vector<vector<int>> v){

FILE: DSA Essentials Solutions/Recursion/AllOccurences.cpp
  function helper (line 10) | void helper(int k, vector<int> v, int i){
  function findAllOccurences (line 22) | vector<int> findAllOccurences(int k, vector<int> v){

FILE: DSA Essentials Solutions/Recursion/BinaryStrings.cpp
  function helper (line 8) | void helper(string str,int n,int i){
  function binaryStrings (line 29) | vector<string> binaryStrings(int n){

FILE: DSA Essentials Solutions/Recursion/FriendsParty.cpp
  function help (line 6) | int help(int n)
  function friendsPairing (line 13) | int friendsPairing(int n){

FILE: DSA Essentials Solutions/Recursion/PrintIncreasingNumbers.cpp
  function help (line 6) | void help(int i, int n, vector<int> &v)
  function increasingNumbers (line 13) | vector<int> increasingNumbers(int N) {

FILE: DSA Essentials Solutions/Recursion/TilingProblem.cpp
  function tiles (line 6) | int tiles(int n,int m){
  function tillingProblem (line 13) | int tillingProblem(int n, int m){

FILE: DSA Essentials Solutions/Stacks/DuplicateParenthesis.cpp
  function duplicateParentheses (line 7) | bool duplicateParentheses(string str){

FILE: DSA Essentials Solutions/Stacks/MaximumRectangularAreaInHistogram.cpp
  function getMaxArea (line 6) | int getMaxArea(vector<int> hist)

FILE: DSA Essentials Solutions/Stacks/NextGreaterElement.cpp
  function nextGreaterElement (line 6) | vector<int> nextGreaterElement(vector<int> arr){

FILE: DSA Essentials Solutions/Stacks/ReverseANumberUsingStack.cpp
  function reverse (line 6) | int reverse(int n){

FILE: DSA Essentials Solutions/Stacks/StockSpanProblem.cpp
  function stockSpanner (line 6) | vector<int> stockSpanner(vector<int> &a){

FILE: DSA Essentials Solutions/Strings/ArePermutation.cpp
  function arePermutation (line 8) | bool arePermutation(string str1, string str2)

FILE: DSA Essentials Solutions/Strings/BinaryStringToNumber.cpp
  function binaryToDecimal (line 9) | int binaryToDecimal(string n)

FILE: DSA Essentials Solutions/Strings/CheckPalindrome.cpp
  function isPalindrome (line 7) | bool isPalindrome(string str)

FILE: DSA Essentials Solutions/Strings/RemoveDuplicates.cpp
  function string (line 7) | string removeDuplicate(string s){

FILE: DSA Essentials Solutions/Strings/StringCompression.cpp
  function compress (line 8) | int compress(vector<char>& chars) {

FILE: DSA Essentials Solutions/Strings/VowelFind.cpp
  function string (line 7) | string vowel(string S){

FILE: DSA Essentials Solutions/Trie/PrefixStrings.cpp
  class node (line 4) | class node{
    method node (line 9) | node(char a){
  class Trie (line 14) | class Trie{
    method insert (line 18) | void insert(string str){
    method dfs (line 30) | void dfs(node*temp, vector<string> &v, string word ){
    method find (line 47) | vector<string> find(string str){
  function findPrefixStrings (line 73) | vector<string> findPrefixStrings(vector<string> words, string prefix){

FILE: DSA Essentials Solutions/Vectors/MakeZeroes.cpp
  function makeZeroes (line 4) | vector<vector<int>> makeZeroes(vector<vector<int>> arr){

FILE: DSA Essentials Solutions/Vectors/RotateImage.cpp
  function rotate (line 4) | void rotate(vector<vector<int>>& matrix) {

FILE: DSA Essentials Solutions/Vectors/SortFruits.cpp
  function comp (line 4) | bool comp(pair<string,int> a, pair<string, int> b){
  function sortFruits (line 8) | vector<pair<string,int>> sortFruits(vector<pair<string,int>> v, string S){

FILE: DSA Essentials Solutions/Vectors/SortingCabs.cpp
  function comp (line 4) | bool comp(pair<int,int> a, pair<int, int> b){
  function sortCabs (line 10) | vector<pair<int,int>> sortCabs(vector<pair<int,int>> v){