(int val)

()

(int x)

()

(int arr[], int l, int r)

(int row, int col)

(int node)

(long prefixSum[], int remainingChalks)

(int node)

(int node)

(int output[])

(long firstHalf, boolean isOdd)

(String word)

(int map1[], int map2[])

(char ch)

(int j, String i2, int i, int curSum)

(Node cur)

(String inp, int alphabets)

(int k, String words)

(String tiles, boolean used[], HashSet<String> set, String cur)

(int nums[], int start, int end, int target)

(int node, int skip, List<List<Integer>> reverseList)

(ArrayList<Character> list ,char val)

(int node)

(int node)

(int node)

(String word)

(char ch)

()

()

(String word)

(int arr[])

(String traversal, int depth)

(int nums[],int i,int j)

(int nums[],int start, int end)

(int n, int source, int destination)

(int nums[],int target, boolean isFirst)

(String s,int a,int b)

(int nums[],int x,int y)

(int arr[], int a, int b)

(int nums[],int i,int j)

(int V, int pairs[][])

(char a, char b)

(int graph[][], int element, List<List<Integer>> list,List<Integer> sublist)

(int r, int c, int m[][], int n, ArrayList<String> list, String path, int visited[][])

(String pattern, int index, int[] num, boolean[] used, StringBuilder result)

(String s, HashSet<String> set, int index)

(int index, boolean used[], int seq[], int n)

(int n, int k, StringBuilder cur)

(int garden,int path[][], int output[],int n)

(String tiles,String output,HashSet<String> set, Boolean visited[])

(String nums[], int n,HashSet<String> set, StringBuilder res)

(int matrix[],int target)

(int[] points, int n, int m, long targetScore)

(int src, int graph[][], int color[])

(int Mat[][], int r, int c)

(int Mat[][], int r, int c)

(Pair that)

(String inp)

(int row, int col, int matrix[][])

(TreeNode root, int val)

(int node, int[][] graph, HashMap<Integer,Boolean> map)

(TreeNode root, int distance)

(int r, int c, int grid[][])

(int row, int col,int[][] grid1, int[][] grid2, boolean visited[][])

(ListNode head, TreeNode node)

(int node, boolean []vis, ArrayList<ArrayList<Integer>> adj, Stack<Integer> st)

(int curNum, int target, List<Integer>res)

(int node, boolean[] vis, ArrayList<ArrayList<Integer>> adjT)

(int grid[][], int r, int c)

(int src,int n, ArrayList<ArrayList<int[]>> adj)

(int S, long adj[][])

(ArrayList<Character> list ,char op)

(int[][] grid,int row,int col,int[][] discoveryTime,int[][] lowestReachable,int[][] parentCell)

(int grid[][], int r, int c)

(TreeNode root, int maxi[])

(int a, int b)

(int[][] grid, int startRow, int startCol, PriorityQueue<Integer> pq)

(int arr[], int n)

(int grid[][], int r, int c)

(String str)

(int num)

(int a, int b)

(ArrayList<ArrayList<Integer>> adjList,int node,int n)

(ArrayList<ArrayList<Integer>> adjList,int node,int[] distances,boolean[] visited)

(TreeNode node,List<Integer> list)

(int freq[])

(ArrayList<ArrayList<Integer>> adjList,int node,int[] colors)

(long time, int ranks[], int carsToBeRepaired)

(int[][] grid, int row, int col)

(int mid,int nums[],int m,int n)

(int garden,int path[][],int output[],int color)

()

(int grid[][], int r, int c)

(int a[], int size, int candidate)

(int capability, int nums[], int minHouses)

(String s1, String s2)

(char str, char stk)

(String sub, String word)

(int lastDigit, int currentDigit, char condition)