SYMBOL INDEX (173 symbols across 54 files)

FILE: Adhoc + Basic/Reservoir_sampling.cpp
  function findRandom (line 16) | int findRandom(vector<int> arr)
  function weightedRandomIndex (line 39) | int weightedRandomIndex(const std::vector<int>& weights) {
  function main (line 54) | int main()

FILE: Adhoc + Basic/Sieve_of_Eratosthenes.cpp
  function main (line 18) | int main()

FILE: Adhoc + Basic/Two_Pointer.cpp
  function sortColors (line 11) | void sortColors(vector<int>& arr) {

FILE: Adhoc + Basic/binary_search_I.cpp
  function getMostWork_method1 (line 12) | int getMostWork_method1(int folders[], int workers,int n)
  function ispossible (line 43) | bool ispossible(int folders[],int n, int no, int workers)
  function getMostWork_method2 (line 61) | int getMostWork_method2(int folders[],int workers, int n)
  function main (line 85) | int main()

FILE: Adhoc + Basic/binary_search_II.cpp
  function lower_bound_ (line 32) | int lower_bound_(vector<int> arr, int target){
  function upper_bound_ (line 50) | int upper_bound_(vector<int> arr, int target){
  function find_pivot (line 80) | int find_pivot(vector<int> &arr) {
  function pivotedBinarySearch (line 103) | int pivotedBinarySearch(vector<int> &arr, int target){
  function main (line 123) | int main(){

FILE: Adhoc + Basic/binary_search_III.cpp
  function lowerBound (line 5) | int lowerBound(vector<int> arr, int target) {
  function upperBound (line 23) | int upperBound(vector<int> arr, int target) {

FILE: Arrays/MedianOfSortedArrays.cpp
  class Solution (line 34) | class Solution {
    method findMedian (line 36) | double findMedian(vector<int>&a,vector<int>&b){
    method findMedianSortedArrays (line 59) | double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {

FILE: Arrays/MedianOfStream.cpp
  function findMedian (line 13) | vector<int> findMedian(vector<int> &arr, int n){

FILE: Arrays/MonotonicStack.cpp
  function nextGreaterElement (line 15) | vector<int> nextGreaterElement(vector<int> arr) {
  function nextSmallerElement (line 39) | vector<int> nextSmallerElement(vector<int> arr) {
  function main (line 54) | int main() {

FILE: Arrays/TrappingRainwater.cpp
  class Solution (line 4) | class Solution {
    method trap (line 6) | int trap(vector<int>& height) {

FILE: Bit-mask/Bitmask_Basic.cpp
  function erase_or_add (line 11) | void erase_or_add(int n, int& subset)
  function display (line 15) | void display(int subset)
  function main (line 28) | int main()

FILE: DP/LCS.cpp
  function LCS (line 14) | void LCS(string a, string b) {
  function LCS_SpaceOptmized (line 53) | void LCS_SpaceOptmized(string a, string b) {
  function main (line 74) | int main() {

FILE: DP/LIS.cpp
  function length_LIS (line 11) | int length_LIS(int arr[], int n)
  function lengthLIS1 (line 28) | int lengthLIS1(vector<int> arr) {
  function find_LIS (line 42) | void find_LIS(int arr[], int n) {
  function find_LIS_Optimizd (line 60) | void find_LIS_Optimizd(int arr[],int n)
  function main (line 95) | int main()

FILE: DP/LongestPalindromicSubstring.cpp
  class Solution (line 16) | class Solution {
    method string (line 18) | string longestPalindromeicSubString(string s) {

FILE: DP/LongestPanlidromicSubsequence.cpp
  function LCS (line 14) | int LCS(string a, string b, int n, int m)
  function longestPalindromeSubseq (line 31) | int longestPalindromeSubseq(string str)
  function longestPalndromeSubsequenceOptimzed (line 51) | int longestPalndromeSubsequenceOptimzed(string str) {
  function longestPalindromeSubseqUsingLCS (line 68) | int longestPalindromeSubseqUsingLCS(string s)
  function main (line 75) | int main()

FILE: DP/PalindromicCuts.cpp
  function isPalindrome (line 18) | bool isPalindrome(string str)
  function findCuts (line 34) | int findCuts(string str, int l, int r)
  function findCutsOptimized (line 70) | int findCutsOptimized(string str) {
  function findCutsMostOptimized (line 109) | int findCutsMostOptimized(string str) {
  function main (line 127) | int main()

FILE: DP/digit_dp.cpp
  function digit_dp (line 13) | int digit_dp(string R,int n,int sum,bool tight)
  function main (line 40) | int main()

FILE: DP/travelling_salesman_prob.cpp
  function TSP (line 26) | int  TSP(int visited,int position)
  function main (line 46) | int main()

FILE: Graph/BFS.cpp
  function addEdge (line 14) | void addEdge(int u, int v)
  function bfs (line 20) | void bfs(int src)
  function main (line 50) | int main()

FILE: Graph/Bellman_ford(Negative_weights).cpp
  function bellman_ford (line 25) | void bellman_ford(int src)
  function main (line 57) | int main()

FILE: Graph/Bipartite_Coloring.cpp
  function addEdge (line 13) | void addEdge(int u, int v)
  function bfs (line 19) | void bfs()
  function main (line 72) | int main()

FILE: Graph/Bipartite_matching.cpp
  function findMaxBiPartiteMatching (line 28) | bool findMaxBiPartiteMatching(int u) // applicant
  function main (line 47) | int main()

FILE: Graph/DFS.cpp
  function addEdge (line 18) | void addEdge(int u, int v)
  function dfs_iterative (line 24) | void dfs_iterative(int src)
  function dfs_recursive (line 49) | void dfs_recursive(int u)
  function main (line 67) | int main()

FILE: Graph/FloydWarshall.cpp
  function findShortestDist (line 16) | void findShortestDist(vector<vector<int>>& matrix) {
  function main (line 36) | int main() {

FILE: Graph/cycleDetection.cpp
  function isCyclicInDirectedGraph (line 17) | bool isCyclicInDirectedGraph(int n, vector<int> inDegree) {
  function main (line 47) | int main() {

FILE: Graph/dijkstra.cpp
  function addEdge (line 25) | void addEdge(int u, int v, int wt)
  function dijktra (line 31) | void dijktra(int src)
  function main (line 70) | int main()

FILE: Graph/prims_algo.cpp
  function addEdge (line 26) | void addEdge(int u, int v, int wt)
  function prim (line 32) | int prim()
  function main (line 68) | int main()

FILE: Graph/topological_sort.cpp
  function notIsCyclic (line 28) | bool notIsCyclic(int u)
  function dfs (line 48) | void dfs(int u, stack<int>& stck)
  function main (line 58) | int main()

FILE: Graph/union_find_algo.cpp
  function init (line 19) | void init(int n)
  function find (line 32) | int find(int x)
  function weightedUnion (line 41) | void weightedUnion(int x, int y)
  function main (line 64) | int main()

FILE: Greedy or DP (Problems)/Continuous_subarray_sum.cpp
  function Find (line 2) | Find if is there any subarray with sum in multiple of k

FILE: Greedy or DP (Problems)/Job_scheduling.cpp
  function jobScheduling (line 8) | int jobScheduling(vector<int>& startTime, vector<int>& endTime, vector<i...

FILE: Greedy or DP (Problems)/Kadane.cpp
  function maxProductSubarray (line 16) | int maxProductSubarray(vector<int> arr) {
  function max_pair (line 33) | int max_pair(vector<int> arr) {

FILE: Greedy or DP (Problems)/Queue_Reconstruction.cpp
  function queue_reconstruction (line 11) | vector<pair<int,int>> queue_reconstruction(vector<pair<int,int>> people) {

FILE: Greedy or DP (Problems)/jump_problem.cpp
  function min_jump (line 8) | int min_jump(vector<int> arr)
  function main (line 30) | signed main()

FILE: NumberTheory/RandomNum.cpp
  class Solution (line 20) | class Solution {
    method Solution (line 24) | Solution(vector<int>& w) {
    method pickIndex (line 31) | int pickIndex() {

FILE: OS Concept based algos/LRU-Cache.cpp
  class LRUCache (line 15) | class LRUCache
    method LRUCache (line 24) | LRUCache(int capacity)
    method get (line 29) | int get(int key)
    method put (line 42) | void put(int key, int value)
  function main (line 63) | int main()

FILE: Range_queries/Range_Update(Difference_Array).cpp
  function init (line 11) | void init(int arr[],int n)
  function update_range (line 21) | void update_range(int arr[], int l, int r, int n, int x)
  function print (line 31) | void print(int arr[], int n)
  function main (line 42) | int main()

FILE: Range_queries/Segment_trees.cpp
  function init_tree (line 20) | void init_tree(int node_indx,int node_lower,int node_upper)
  function range_query (line 38) | int range_query(int node_indx, int a, int b, int node_lower, int node_up...
  function update_point (line 57) | void update_point(int node_indx,int a,int node_lower, int node_upper, in...
  function main (line 121) | int main()

FILE: Range_queries/sparce_table.cpp
  function f (line 21) | int f(int a, int b)
  function init (line 28) | void init(int arr[],int n)
  function query_normal (line 40) | int query_normal(int l,int r)
  function query_idempotent (line 58) | int query_idempotent(int l, int r)
  function main (line 66) | int main(void)

FILE: Sorting Algorithms/HeapSort.cpp
  function heapify (line 9) | void heapify(vector<int> &arr, int n, int i)
  function heapSort (line 33) | void heapSort(vector<int> &arr, int n)
  function print (line 53) | void print(vector<int> arr){
  function main (line 60) | int main(){

FILE: Sorting Algorithms/Inbuilt_sorting_algos.cpp
  function compare (line 6) | bool compare(int a, int b){
  function main (line 10) | int main(){

FILE: Sorting Algorithms/MergeSort.cpp
  function merge (line 8) | void merge(vector<int> &arr,int lo, int hi, int mid){
  function mergeSort (line 26) | void mergeSort(vector<int> &arr, int lo, int hi) {
  function print (line 37) | void print(vector<int> arr){
  function main (line 44) | int main(){

FILE: Sorting Algorithms/O(n^2)_Algos.cpp
  function insertionSort (line 7) | void insertionSort(vector<int> &arr){
  function selectionSort (line 25) | void selectionSort(vector<int> &arr){
  function bubbleSort (line 36) | void bubbleSort(vector<int> &arr){
  function modified_bubbleSort (line 45) | void modified_bubbleSort(vector<int> &arr){
  function print (line 59) | void print(vector<int> arr){
  function main (line 66) | int main(){

FILE: Sorting Algorithms/QuickSort.cpp
  function partition (line 11) | int partition(vector<int> &arr, int lo, int hi){
  function quickSort (line 35) | void quickSort(vector<int> &arr, int lo, int hi){
  function print (line 43) | void print(vector<int> arr){
  function main (line 50) | int main(){

FILE: Sorting Algorithms/RadixSort.cpp
  function countSort (line 13) | void countSort(vector<int>& arr, int exp) {
  function radixSort (line 43) | void radixSort(vector<int> &arr){
  function print (line 57) | void print(vector<int> arr){
  function main (line 64) | int main(){

FILE: Sorting Algorithms/cycleSort.cpp
  function cycleSort (line 7) | void cycleSort(vector<int>& arr, int n) {
  function print (line 18) | void print(vector<int> arr){
  function main (line 25) | int main(){

FILE: Strings/KMP.cpp
  function computeLPSArray (line 22) | void computeLPSArray(char* pat, int M, int* lps)
  function KMPSearch (line 59) | vector<int> KMPSearch(char* pat, char* txt)
  function main (line 100) | int main(){

FILE: Strings/PatternMatching.cpp
  function findModuloPower (line 29) | int findModuloPower(int a, int b, int q) {
  function findStringHash (line 42) | int findStringHash(int d, int h,int q, string str) {
  function findMatches (line 51) | vector<int> findMatches(string text, string pattern) {
  function main (line 93) | int main() {

FILE: Strings/string_input.cpp
  function main (line 7) | int main(){

FILE: Trees/Binary_Lifting.cpp
  function addEdge (line 24) | void addEdge(int u, int v)
  function binary_lifting (line 31) | void  binary_lifting(int u, int pa)
  function getKthAncestor (line 52) | int getKthAncestor(int node, int h)
  function LCA (line 65) | int LCA(int a, int b)
  function main (line 93) | int main()

FILE: Trees/LCA.cpp
  class TreeNode (line 4) | class TreeNode
  function TreeNode (line 12) | TreeNode* LCA_binaryTree(TreeNode* root, int n1, int n2) {
  function TreeNode (line 31) | TreeNode* LCA_bst(TreeNode* root, int n1, int n2) {
  function TreeNode (line 46) | TreeNode* newNode(int val)
  function main (line 54) | int main(){

FILE: Trees/WordSearch2.cpp
  class Solution (line 7) | class Solution {
    type node (line 8) | struct node{    //TrieNode
    type node (line 14) | struct node
    method insert (line 27) | void insert(string s)
    method solve (line 44) | void solve(vector<vector<char>>& board,int i,int j,int r,int c,vector<...
    method findWords (line 76) | vector<string> findWords(vector<vector<char>>& board, vector<string>& ...

FILE: Trees/trie.cpp
  type trie_tag (line 11) | struct trie_tag{
    method trie_tag (line 15) | trie_tag(){isEnd = false;}
  function insert (line 21) | void insert(string str)
  function search (line 38) | bool search(string str)
  function main (line 60) | int main(void)

FILE: codesnippet.cpp
  function exp (line 18) | int exp(int x,int n)
  function inv (line 29) | int inv(int x)
  function ncr (line 34) | int ncr(int n,int r)
  function solve (line 45) | int solve(int n)
  function main_code (line 53) | void main_code()
  function main (line 60) | signed main()