(x interface{})

(x interface{})

(self, n: int, m: int)

(val: number)

(int val)

(val)

(val)

(str, map)

(digits)

(num, heap = this.getHeap(num))

(s, right, frequencyMap, matched)

(s, right, frequencyMap)

(s, right, map)

(self, word)

(word string)

(String word)

(int i, int[] nums)

(int row, int column, int n)

(maxHeap, minHeap)

(i, sum)

(nums, i, permutation, permutations)

( board, n, row, col, colSet, posDiagSet, negDiagSet, moves, )

(candidates, target, i, combination, combinations)

(char, graph, seen, buffer)

(nums, i, set, subset)

(s, left, right, _partition, partitions)

(candidates, target, i, combination, combinations)

(nums, i, set, subset)

(digits, char, combination, combinations)

(board, row, rows, col, cols, node, words)

(n, combos, open, close, path)

(n, combos, open, close, path)

(openN: number, closedN: number)

(cur: number[], pos: number, target: number)

(i: number, dots: number, currentIP: string)

(i: number, curStr: string)

(r)

(i)

( String digits, List<String> ans, String cur, int index )

(int openN, int closedN, int n)

(int i, String[] words, int[] score, int[] letterCount)

(List<List<Integer>> res, int[] nums, List<Integer> path,

(int startIndex, String s, BigInteger lastValue)

(String[] words, int idx)

( int row, int n, Set<Integer> colSet, Set<Integer> posDiagSet

( int[] candidates, int target, List<List<Integer>> ans, List<Integer> cur,

(int start, ArrayList<Integer> comb, int n, int k)

(int[] nums, int i, int k, int subsetSum, boolean[] used)

(grid, r, c)

(nums, levels = [[]], permutations = [])

(queue, rightSide = [])

(graph, indegree, queue, order)

(graph, indegree, queue, reversedOrder = [])

(graph, indegree, sources, path = 0)

(queue, frequencyMap, graph, buffer)

(queue, seen)

(grid, rows, cols, queue)

(nums, subsets = [[]])

(grid, queue, rottenCount = 0, minutes = 0)

(queue, wordSet, seen, endWord)

(queue, s, wordSet, seen)

(rooms, queue)

(queue /* Space O(W) */, levels = [])

(queue, graph, maxTime)

(n, combos = [])

(board, queue)

(queue, total = 0)

(queue)

(queue, total = 0)

(root)

(queue)

(graph, visited, queue)

(queue, isZigZag, levels)

(queue, height = 0)

(List<Integer> list, TreeNode root)

(Map<String, List<Pair<String, Double>>> adj, String src, String target)

(index, arr)

(index, arr)

(num, subsequence)

(MountainArray array, int target, int right)

(MountainArray array, int target, int left)

(CalendarNode cur, int targetStart, int targetEnd)

(values: number[], leftIndex: number, rightIndex: number)

()

(n, edges)

(matrix)

(points)

(n, flights, src, dst, K)

(points)

(tickets, graph = new Map())

(TreeNode node, HashMap<Integer, List<Integer>> graph)

(frequency)

(array: number[])

(array: number[])

(int[] nums)

(products)

( int[] preorder, int preorderIndex, int inorderLow, int inorderHigh )