SYMBOL INDEX (320 symbols across 107 files)

FILE: 6sense/findWordInGrid.py
  class word_seek (line 23) | class word_seek:
    method __init__ (line 25) | def __init__(self):
    method search_grid (line 31) | def search_grid(self, grid, row, col, word):
    method patternSearch (line 49) | def patternSearch(self, grid, word):

FILE: Accolite/binaryArraySort.py
  function main (line 4) | def main():
  function binSort (line 23) | def binSort(arr, n):

FILE: Accolite/merge2SortedLinkedLists.py
  class Node (line 4) | class Node:
    method __init__ (line 5) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 9) | class LinkedList:
    method __init__ (line 10) | def __init__(self):
    method append (line 13) | def append(self, new_value):
    method printList (line 23) | def printList(self):
  function merge (line 64) | def merge(head_a,head_b):

FILE: Accolite/rotateLinkedListByKelements.py
  class Node (line 2) | class Node:
    method __init__ (line 3) | def __init__(self, data):
  class LinkedList (line 6) | class LinkedList:
    method __init__ (line 7) | def __init__(self):
    method push (line 9) | def push(self, new_data):
    method printList (line 13) | def printList(self):
  function rotateList (line 47) | def rotateList(head, k):

FILE: Adobe/QuickSort.py
  function quickSort (line 16) | def quickSort(arr,low,high):
  function partition (line 28) | def partition(arr,low,high):

FILE: Adobe/WinnerOfElection.py
  function main (line 4) | def main():
  function winner (line 21) | def winner(arr,n):

FILE: Adobe/checkIfStringsAreRotations.py
  function write (line 11) | def write():
  function areRotations (line 33) | def areRotations(s1,s2):

FILE: Adobe/countOfInversionsArray.py
  function write (line 12) | def write():
  function Inversion_Count (line 30) | def Inversion_Count(arr,n):
  function mergesort (line 36) | def mergesort(arr,temp_arr,left,right):
  function merge (line 45) | def merge(arr,temp_arr,left, mid, right):

FILE: Adobe/parenthesisChecker.py
  function write (line 12) | def write():
  function isMatchingPair (line 34) | def isMatchingPair(c1,c2):
  function ispar (line 44) | def ispar(s):

FILE: Amazon/Delete_Node_Without_HeadPointer.py
  class Node (line 1) | class Node(object):
    method __init__ (line 2) | def __init__(self,dataVal,nextNode=None):
    method getData (line 6) | def getData(self):
    method setData (line 9) | def setData(self,val):
    method getNextNode (line 12) | def getNextNode(self):
    method setNextNode (line 15) | def setNextNode(self,val):
  class LinkedList (line 18) | class LinkedList(object):
    method __init__ (line 19) | def __init__(self,head=None):
    method getSize (line 23) | def getSize(self):
    method addNode (line 26) | def addNode(self,data):
    method printNode (line 33) | def printNode(self):
    method deleteNode (line 39) | def deleteNode(self,value):

FILE: Amazon/EquilibriumPointFirstOccurWhere.py
  function main (line 4) | def main():
  function equilibriumPoint (line 18) | def equilibriumPoint(A, N):

FILE: Amazon/FindzeroSumSubArrays.py
  function subArrayExists (line 1) | def subArrayExists(arr,n):

FILE: Amazon/ImplementSTRSTR.py
  function write (line 11) | def write():
  function strstr (line 29) | def strstr(s,p):

FILE: Amazon/MaximumOfMinimumsOfAllWindowSizes.py
  function printMaxOfMin (line 45) | def printMaxOfMin(a,n):
  function write (line 92) | def write():

FILE: Amazon/Possible_Words_Phone_Digits.py
  function main (line 4) | def main():
  function possibleWords (line 24) | def possibleWords(a,N):

FILE: Amazon/countOfInversionsArray.py
  function write (line 12) | def write():
  function Inversion_Count (line 30) | def Inversion_Count(arr,n):
  function mergesort (line 36) | def mergesort(arr,temp_arr,left,right):
  function merge (line 45) | def merge(arr,temp_arr,left, mid, right):

FILE: Amazon/keypadTyping.py
  function keypadTyping (line 1) | def keypadTyping(s):

FILE: Amazon/merge2SortedLinkedLists.py
  class Node (line 4) | class Node:
    method __init__ (line 5) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 9) | class LinkedList:
    method __init__ (line 10) | def __init__(self):
    method append (line 13) | def append(self, new_value):
    method printList (line 23) | def printList(self):
  function merge (line 64) | def merge(head_a,head_b):

FILE: Amazon/missingSmallestPositiveNumber.py
  function main (line 4) | def main():
  function missingNumber (line 21) | def missingNumber(arr,n):

FILE: Amazon/moveAllZerosToEndOfArray.py
  function moveZerosToEnd (line 1) | def moveZerosToEnd(arr):

FILE: Amazon/parenthesisChecker.py
  function write (line 12) | def write():
  function isMatchingPair (line 34) | def isMatchingPair(c1,c2):
  function ispar (line 44) | def ispar(s):

FILE: Amazon/relativeSorting.py
  function relativeSorting (line 1) | def relativeSorting(A1,A2):

FILE: Amazon/rotateLinkedListByKelements.py
  class Node (line 2) | class Node:
    method __init__ (line 3) | def __init__(self, data):
  class LinkedList (line 6) | class LinkedList:
    method __init__ (line 7) | def __init__(self):
    method push (line 9) | def push(self, new_data):
    method printList (line 13) | def printList(self):
  function rotateList (line 47) | def rotateList(head, k):

FILE: Betterworks/print.py
  function doop (line 19) | def doop(mydict):

FILE: Bloomberg/moveAllZerosToEndOfArray.py
  function moveZerosToEnd (line 1) | def moveZerosToEnd(arr):

FILE: BrightMoney/LongestBalancedSubstring.py
  function findMaxLen (line 13) | def findMaxLen(string):

FILE: BrightMoney/printSpirally.py
  function generateMatrix (line 7) | def generateMatrix(n):

FILE: Facebook/ImplementSTRSTR.py
  function write (line 11) | def write():
  function strstr (line 29) | def strstr(s,p):

FILE: FactSet/convertArrayToWave.py
  function main (line 4) | def main():
  function convertToWave (line 29) | def convertToWave(A,N):

FILE: Flipkart/addTwoNumbers_LinkedListRep.py
  function write (line 12) | def write():
  class Node (line 16) | class Node:
    method __init__ (line 17) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 21) | class LinkedList:
    method __init__ (line 22) | def __init__(self):
    method append (line 25) | def append(self, new_value):
  function printList (line 35) | def printList(head):
  function addBoth (line 83) | def addBoth(head_a,head_b):

FILE: Flipkart/countOfInversionsArray.py
  function write (line 12) | def write():
  function Inversion_Count (line 30) | def Inversion_Count(arr,n):
  function mergesort (line 36) | def mergesort(arr,temp_arr,left,right):
  function merge (line 45) | def merge(arr,temp_arr,left, mid, right):

FILE: Flipkart/parenthesisChecker.py
  function write (line 12) | def write():
  function isMatchingPair (line 34) | def isMatchingPair(c1,c2):
  function ispar (line 44) | def ispar(s):

FILE: Fractal_Analytics/countChampNumbers.py
  function countChampNumbers (line 8) | def countChampNumbers(X,Y):

FILE: Fractal_Analytics/countOfAnagrams.py
  function countAnagrams (line 7) | def countAnagrams(text,word):

FILE: Fractal_Analytics/numberOfGroups.py
  function numGroups (line 25) | def numGroups(poles):

FILE: Fre8wise/manipulate_string.py
  function changeString (line 15) | def changeString(s):

FILE: Goldman-Sachs/convertArrayToWave.py
  function main (line 4) | def main():
  function convertToWave (line 29) | def convertToWave(A,N):

FILE: Goldman-Sachs/numberOfSquares_in_NbyN_CheesBoard.py
  function num_of_squares (line 1) | def num_of_squares(n):

FILE: Goldman-Sachs/printNumbersContain123.py
  function contains123 (line 1) | def contains123(arr):

FILE: Goldman-Sachs/repeatingCharacter_LeftmostOccurrence.py
  function write (line 11) | def write():
  function repeatingCharacter (line 34) | def repeatingCharacter(s):

FILE: Google/First_Recurring_Character_In_String.py
  function firstRecurringChar (line 4) | def firstRecurringChar(input_string):

FILE: Google/allocateMinimumPages.py
  function isValid (line 2) | def isValid(arr,n,k,mi):
  function allocMinPages (line 15) | def allocMinPages(arr,n,k):

FILE: Google/checkPairsWithGivenSum.py
  function isPairWithGivenSum (line 11) | def isPairWithGivenSum(arr,n,x):

FILE: Google/maxIndexDiffOfArray.py
  function main (line 4) | def main():
  function maxIndexDiff (line 21) | def maxIndexDiff(arr, n):

FILE: Grofers/QuickSort.py
  function quickSort (line 16) | def quickSort(arr,low,high):
  function partition (line 28) | def partition(arr,low,high):

FILE: Guardant-Health/maintainMinimumStartingNumber.py
  function minStartNumber (line 28) | def minStartNumber(arr):

FILE: Hike/QuickSort.py
  function quickSort (line 16) | def quickSort(arr,low,high):
  function partition (line 28) | def partition(arr,low,high):

FILE: IQLECT/LargestPrimeFromSubsetSum.py
  function largestPrime (line 40) | def largestPrime(a):
  function testLargestPrime (line 81) | def testLargestPrime():

FILE: Infrrd/problem01/maximumRowsWithAll1s.py
  function maximumRows (line 3) | def maximumRows(binary_matrix,K):

FILE: Infrrd/problem02/countMe.py
  function countMe (line 1) | def countMe(arrA,arrL,arrR,arrX):
  function countOfNums (line 10) | def countOfNums(array,target):

FILE: Instabase/checkPairsWithGivenSum.py
  function isPairWithGivenSum (line 12) | def isPairWithGivenSum(arr,n,x):

FILE: Intuit/BuySellStock.py
  function main (line 4) | def main():
  function stockBuySell (line 21) | def stockBuySell(A,n):

FILE: Intuit/binaryArraySort.py
  function main (line 4) | def main():
  function binSort (line 23) | def binSort(arr, n):

FILE: Kritikal-Solutions/Delete_Without_Head_Pointer.py
  function write (line 12) | def write():
  class Node (line 16) | class Node:
    method __init__ (line 17) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 21) | class LinkedList:
    method __init__ (line 22) | def __init__(self):
    method append (line 25) | def append(self, new_value):
    method getNode (line 34) | def getNode(self,value): # return node with given value, if not presen...
    method printList (line 43) | def printList(self):
  function deleteNode (line 82) | def deleteNode(curr_node):

FILE: LeadSquared/UniqueWaysToClimbStaircase.py
  function countWays (line 13) | def countWays(n,m):
  function countWays1 (line 42) | def countWays1(n,args):

FILE: LeadSquared/maximumSumLikeTimeCoefficients.py
  function maxSumLikeTimeCoeff (line 23) | def maxSumLikeTimeCoeff(arr,N):

FILE: LeadSquared/totalDistanceByStreetLights.py
  function total_distance (line 26) | def total_distance(intervals):

FILE: MAQ_Software/Closet0s1s2s.py
  function write (line 11) | def write():
  function segragate012 (line 25) | def segragate012(a,n):

FILE: MakeMyTrip/rotateLinkedListByKelements.py
  class Node (line 2) | class Node:
    method __init__ (line 3) | def __init__(self, data):
  class LinkedList (line 6) | class LinkedList:
    method __init__ (line 7) | def __init__(self):
    method push (line 9) | def push(self, new_data):
    method printList (line 13) | def printList(self):
  function rotateList (line 47) | def rotateList(head, k):

FILE: MakeMyTrip/sortedLinkedList012s.py
  function write (line 12) | def write():
  class Node (line 15) | class Node:
    method __init__ (line 16) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 20) | class LinkedList:
    method __init__ (line 21) | def __init__(self):
    method append (line 24) | def append(self, new_value):
  function printList (line 34) | def printList(head):
  function segregate (line 70) | def segregate(head):

FILE: Microsoft/countOfInversionsArray.py
  function write (line 12) | def write():
  function Inversion_Count (line 30) | def Inversion_Count(arr,n):
  function mergesort (line 36) | def mergesort(arr,temp_arr,left,right):
  function merge (line 45) | def merge(arr,temp_arr,left, mid, right):

FILE: Microsoft/merge2SortedLinkedLists.py
  class Node (line 4) | class Node:
    method __init__ (line 5) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 9) | class LinkedList:
    method __init__ (line 10) | def __init__(self):
    method append (line 13) | def append(self, new_value):
    method printList (line 23) | def printList(self):
  function merge (line 64) | def merge(head_a,head_b):

FILE: Microsoft/relativeSorting.py
  function relativeSorting (line 1) | def relativeSorting(A1,A2):

FILE: Morgan-Stanley/addTwoNumbers_LinkedListRep.py
  function write (line 12) | def write():
  class Node (line 16) | class Node:
    method __init__ (line 17) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 21) | class LinkedList:
    method __init__ (line 22) | def __init__(self):
    method append (line 25) | def append(self, new_value):
  function printList (line 35) | def printList(head):
  function addBoth (line 83) | def addBoth(head_a,head_b):

FILE: Myntra/countOfInversionsArray.py
  function write (line 12) | def write():
  function Inversion_Count (line 30) | def Inversion_Count(arr,n):
  function mergesort (line 36) | def mergesort(arr,temp_arr,left,right):
  function merge (line 45) | def merge(arr,temp_arr,left, mid, right):

FILE: Myntra/removeDuplicatesSortedLinkedList.py
  function write (line 12) | def write():
  class Node (line 16) | class Node:
    method __init__ (line 17) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 21) | class LinkedList:
    method __init__ (line 22) | def __init__(self):
    method append (line 25) | def append(self, new_value):
    method printList (line 35) | def printList(self):
  function removeDuplicates (line 72) | def removeDuplicates(head):

FILE: Nagarro/isAnagram.py
  function write (line 11) | def write():
  function isAnagram (line 33) | def isAnagram(a,b):

FILE: OYO_Rooms/FindzeroSumSubArrays.py
  function subArrayExists (line 1) | def subArrayExists(arr,n):

FILE: OYO_Rooms/parenthesisChecker.py
  function write (line 12) | def write():
  function isMatchingPair (line 34) | def isMatchingPair(c1,c2):
  function ispar (line 44) | def ispar(s):

FILE: OYO_Rooms/removeDuplicatesSortedLinkedList.py
  function write (line 12) | def write():
  class Node (line 16) | class Node:
    method __init__ (line 17) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 21) | class LinkedList:
    method __init__ (line 22) | def __init__(self):
    method append (line 25) | def append(self, new_value):
    method printList (line 35) | def printList(self):
  function removeDuplicates (line 72) | def removeDuplicates(head):

FILE: Oracle/merge2SortedLinkedLists.py
  class Node (line 4) | class Node:
    method __init__ (line 5) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 9) | class LinkedList:
    method __init__ (line 10) | def __init__(self):
    method append (line 13) | def append(self, new_value):
    method printList (line 23) | def printList(self):
  function merge (line 64) | def merge(head_a,head_b):

FILE: Paytm/Convert_Infix_To_Postfix.py
  function write (line 12) | def write():
  function InfixtoPostfix (line 27) | def InfixtoPostfix(exp):

FILE: Paytm/binaryArraySort.py
  function main (line 4) | def main():
  function binSort (line 23) | def binSort(arr, n):

FILE: Paytm/frequencyLimitedRangeArrayElements.py
  function main (line 4) | def main():
  function printfrequency (line 25) | def printfrequency(A,N):

FILE: Paytm/subarrayWithZeroSum.py
  function main (line 3) | def main():
  function allSubArrays (line 23) | def allSubArrays(L,L2=None):
  function subArrayExists (line 32) | def subArrayExists(arr,n):

FILE: Qalcomm/ImplementSTRSTR.py
  function write (line 11) | def write():
  function strstr (line 29) | def strstr(s,p):

FILE: Qalcomm/addTwoNumbers_LinkedListRep.py
  function write (line 12) | def write():
  class Node (line 16) | class Node:
    method __init__ (line 17) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 21) | class LinkedList:
    method __init__ (line 22) | def __init__(self):
    method append (line 25) | def append(self, new_value):
  function printList (line 35) | def printList(head):
  function addBoth (line 83) | def addBoth(head_a,head_b):

FILE: Quikr/BuySellStock.py
  function main (line 4) | def main():
  function stockBuySell (line 21) | def stockBuySell(A,n):

FILE: RelianceJIO/CamelCaseToSnakeCase.py
  function convert_string (line 22) | def convert_string(s:str) -> str:

FILE: RelianceJIO/getSmallestNumber.py
  function div_count (line 10) | def div_count(n):
  function smallestNumber (line 45) | def smallestNumber(n,ndn):

FILE: Salesforce/BuySellStock.py
  function main (line 4) | def main():
  function stockBuySell (line 21) | def stockBuySell(A,n):

FILE: Samsung/merge2SortedLinkedLists.py
  class Node (line 4) | class Node:
    method __init__ (line 5) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 9) | class LinkedList:
    method __init__ (line 10) | def __init__(self):
    method append (line 13) | def append(self, new_value):
    method printList (line 23) | def printList(self):
  function merge (line 64) | def merge(head_a,head_b):

FILE: Samsung/missingSmallestPositiveNumber.py
  function main (line 4) | def main():
  function missingNumber (line 21) | def missingNumber(arr,n):

FILE: Samsung/moveAllZerosToEndOfArray.py
  function moveZerosToEnd (line 1) | def moveZerosToEnd(arr):

FILE: SkyPointCloud/binarySearch.py
  function binarySearch (line 5) | def binarySearch(arr,x):

FILE: SkyPointCloud/modifyString.py
  function isPrime (line 15) | def isPrime(n) :
  function sort_string (line 36) | def sort_string(s,n):

FILE: Snapdeal/addTwoNumbers_LinkedListRep.py
  function write (line 12) | def write():
  class Node (line 16) | class Node:
    method __init__ (line 17) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 21) | class LinkedList:
    method __init__ (line 22) | def __init__(self):
    method append (line 25) | def append(self, new_value):
  function printList (line 35) | def printList(head):
  function addBoth (line 83) | def addBoth(head_a,head_b):

FILE: SymphonyAI/maximumHeightOfMudSegment.py
  function maxHeight (line 74) | def maxHeight(wallPositions,wallHeights):

FILE: Thoughtworks/ScheduleInterviews.py
  function divideWorkingHours (line 4) | def divideWorkingHours(start_time:datetime.datetime,
  function removeOverlaps (line 17) | def removeOverlaps(slots:List[Tuple],break_hour:Tuple) -> List[Tuple]:
  function scheduleInterviews (line 28) | def scheduleInterviews(attendees:dict,

FILE: Twilio/DiskSpaceAnalysis.py
  function segment (line 12) | def segment(x:int, space:List[int]) -> int:

FILE: Uber/getNewArray.py
  function productOfArray (line 11) | def productOfArray(arr):
  function newArray (line 17) | def newArray(arr):

FILE: Ushur/findPairs.py
  function find_pairs (line 9) | def find_pairs(n,socks):

FILE: VMWare/Convert_Infix_To_Postfix.py
  function write (line 12) | def write():
  function InfixtoPostfix (line 27) | def InfixtoPostfix(exp):

FILE: VMWare/maxIndexDiffOfArray.py
  function main (line 4) | def main():
  function maxIndexDiff (line 21) | def maxIndexDiff(arr, n):

FILE: VMWare/mergeKSortedLinkedLists.py
  function write (line 12) | def write():
  class Node (line 15) | class Node:
    method __init__ (line 16) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 20) | class LinkedList:
    method __init__ (line 21) | def __init__(self):
    method append (line 24) | def append(self, new_value):
  function printList (line 34) | def printList(head):
  function merge (line 83) | def merge(heads,n):

FILE: Visa/addNode_DoublyLinkedList.py
  class Node (line 2) | class Node:
    method __init__ (line 3) | def __init__(self, data):
  class DoublyLinkedList (line 7) | class DoublyLinkedList:
    method __init__ (line 8) | def __init__(self):
    method append (line 10) | def append(self, new_data):
    method printList (line 23) | def printList(self, node):
  function addNode (line 58) | def addNode(head, p, data):

FILE: Visa/populateList.py
  function solution (line 12) | def solution(numbers):

FILE: Visa/removeDuplicatesSortedLinkedList.py
  function write (line 12) | def write():
  class Node (line 16) | class Node:
    method __init__ (line 17) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 21) | class LinkedList:
    method __init__ (line 22) | def __init__(self):
    method append (line 25) | def append(self, new_value):
    method printList (line 35) | def printList(self):
  function removeDuplicates (line 72) | def removeDuplicates(head):

FILE: Walmart/GroupAnagrams.py
  function group_anagrams (line 14) | def group_anagrams(words:List[str]) -> List[Tuple[str]]:
  function group_anagrams_1 (line 44) | def group_anagrams_1(words:List[str]) -> List[Tuple[str]]:

FILE: Walmart/minimumCoins.py
  function minCoins (line 16) | def minCoins(coins:List[int],value:int) -> int:

FILE: Walmart/minimumCoinsRecursive.py
  function minimumCoinsRecursive (line 15) | def minimumCoinsRecursive(coins:List[int],value:int) -> int:

FILE: Yahoo/ThreeWayPartition.py
  function threeWayPartition (line 47) | def threeWayPartition(arr, n, a, b):

FILE: ZSAssociates/CrossSequence.py
  function solve (line 21) | def solve(N,A,K):

FILE: ZSAssociates/OutputOfProgram.py
  function plus_one (line 11) | def plus_one(batch_iter):
  function multiply_two_cols (line 16) | def multiply_two_cols(batch_iter):

FILE: ZSAssociates/OutputOfProgram2.py
  function MainProgram (line 1) | def MainProgram(iterable, x):
  function MainProg (line 20) | def MainProg(f):
  function Call (line 29) | def Call(num):

FILE: Zoho/merge2SortedLinkedLists.py
  class Node (line 4) | class Node:
    method __init__ (line 5) | def __init__(self, data):   # data -> value stored in node
  class LinkedList (line 9) | class LinkedList:
    method __init__ (line 10) | def __init__(self):
    method append (line 13) | def append(self, new_value):
    method printList (line 23) | def printList(self):
  function merge (line 64) | def merge(head_a,head_b):

FILE: Zoho/rearrangeArrayAlternately.py
  function main (line 4) | def main():
  function rearrange (line 26) | def rearrange(arr, n):