MCPcopy Create free account

hub / github.com/17tanya/Leetcode-Data-Structures-and-Algorithms / functions

Functions190 in github.com/17tanya/Leetcode-Data-Structures-and-Algorithms

⨍ Functions 190◇ Types & classes 96
↓ 25 callersMethodcontainsKey
(int arr[],int target)
BinarySearch/Binary_Search_Variants.java:22
↓ 3 callersMethodisPartition
(int A[], int sum, int current)
DynamicProgramming/PartitionProblem/PartitionProblem[ReturnBoolean].java:30
↓ 2 callersMethodfibonacci
(int n)
DynamicProgramming/MIT-6.006-IntroToAlgosNotes/DP1_Fibonacci_ShortestPaths.java:17
↓ 1 callersMethodLCSlength
(String a, String b, int n, int m, int lcs[][])
DynamicProgramming/LongestCommonSubsequence/Find_Longest_Common_Subsequence.java:25
↓ 1 callersMethodalienOrder
(String[] words)
GraphsDFS&BFS/Alien_Dictionary_Topological_Sort.java:45
↓ 1 callersMethodcompareTo
(Box o)
DynamicProgramming/BoxStackingProblem.java:24
↓ 1 callersMethoddfs
(char[][] grid, int x, int y)
GraphsDFS&BFS/Number_of_Islands.java:19
↓ 1 callersMethoddfs
(String s, int start, int maxLen, Set<String> dict, HashMap<Integer, ArrayList<String>> map)
DynamicProgramming/WordBreakProblem/[Optimized]WordBreakPrintWords.java:27
↓ 1 callersMethodfindDelayedProjects2
(char dependencies[][], char delayedProjects[])
GraphsDFS&BFS/DelayedProjects.java:102
↓ 1 callersMethodfindNeighbours
(int[][] prerequisites,int v)
GraphsDFS&BFS/Course_Schedule.java:52
↓ 1 callersMethodfindNeighbours
(int[][] prerequisites, int v)
GraphsDFS&BFS/Course_Schedule_II.java:36
↓ 1 callersMethodgame
(int coins[], int dp[][], int i, int j, int sum)
DynamicProgramming/OptimalStratergyForGame/Optimal_Stratergy_For_Game2.java:39
↓ 1 callersMethodhelper
(char delay, Map<Character, List<Character>> graph, Set<Character> visited, List<Character> res)
GraphsDFS&BFS/DelayedProjects.java:118
↓ 1 callersMethodhelper
(int nums[], boolean visit[], List<Integer> perm, List<List<Integer>> res)
Backtracking/Permutations.java:13
↓ 1 callersMethodhelper
(int k, int n, int num, int sum, List<Integer> l, List<List<Integer>> res)
Backtracking/CombinationSumIII.java:16
↓ 1 callersMethodhelper
(int nums[], int index, int sum, int target, List<Integer> l, List<List<Integer>> res)
Backtracking/CombinationSum.java:11
↓ 1 callersMethodhelper
(int nums[], int index, int sum, int target, List<Integer> l, List<List<Integer>> res)
Backtracking/CombinationSumII.java:14
↓ 1 callersMethodhelper
(int nums[], boolean visit[], List<Integer> perm, List<List<Integer>> res)
Backtracking/PermutationsII.java:14
↓ 1 callersMethodhelper
(int nums[], int index, List<Integer> subset, List<List<Integer>> res)
Backtracking/Subsets.java:12
↓ 1 callersMethodhelper
(int nums[], int index, List<Integer> subset, List<List<Integer>> res)
Backtracking/SubsetsII.java:15
↓ 1 callersMethodhelper
(char[][] b, int x, int y, String s, int end)
Backtracking/WordSearch.java:15
↓ 1 callersMethodhelper
(String inputString, String newString, int index, List<String> l)
Backtracking/LetterCasePermutation.java:11
↓ 1 callersMethodhelper
(String str, List<String> l, int open, int close, int n)
Backtracking/GenerateParentheses.java:11
↓ 1 callersMethodhelper
(String s, int index, List<String> l, List<List<String>> res)
Backtracking/PalindromePartitioning.java:11
↓ 1 callersMethodhelper
(char str[], String digits, int index)
Recursion/LetterCombinationsOfAPhoneNumber.java:30
↓ 1 callersMethodisMirror
(TreeNode n1, TreeNode n2)
Trees/Symmetric_Tree.java:19
↓ 1 callersMethodisPalin
(String s, int start, int end)
Backtracking/PalindromePartitioning.java:37
↓ 1 callersMethodkadane
(int A[])
DynamicProgramming/MaximumSumRectangularSubMatrix.java:70
↓ 1 callersMethodlcs
(String a, String b, int n, int m, int matrix[][])
DynamicProgramming/LongestCommonSubsequence/Find_Longest_Common_Subsequence.java:11
↓ 1 callersMethodlongestPathFromACell
(int mat[][], int dp[][], int n, int row, int col)
DynamicProgramming/LongestPathInMatrixconstraints/LongestPathInMatrixWithConstraints.java:33
↓ 1 callersMethodmaxHistogram
(int A[])
DynamicProgramming/MaxRectangularSubmatrixOf1s.java:39
↓ 1 callersMethodminPartition
(int A[], int current, int sumSet1, int totalSum)
DynamicProgramming/MinimumSumPartition/MinimumSumPartition.java:29
↓ 1 callersFunctionprint_full_name
(first, last)
String/What's your name.py:5
↓ 1 callersFunctionswap_case
(string)
String/sWAPcASE.py:5
↓ 1 callersMethodtopoUtil
(int v,boolean visited[],Stack<Integer> stk)
GraphsDFS&BFS/TopologicalSort_DFS.java:38
MethodBox
(int h, int w, int d)
DynamicProgramming/BoxStackingProblem.java:16
MethodLCS
(String a, String b)
DynamicProgramming/LongestCommonSubstring/Length_Of_Longest_Common_Substring.java:25
MethodLCSlength
(String a, String b, int n, int m)
DynamicProgramming/LongestCommonSubsequence/Length_Of_Longest_Common_Subsequence.java:41
MethodLCSlength
(String a, String b, int n, int m)
DynamicProgramming/LongestCommonSubsequence/Length_Of_Longest_Common_Subsequence.java:61
MethodLCSset
(String a, String b, int matrix[][])
DynamicProgramming/LongestCommonSubsequence/Find_Longest_Common_Subsequence.java:110
MethodLCStr
(int n, int m, int count)
DynamicProgramming/LongestCommonSubstring/Length_Of_Longest_Common_Substring.java:30
MethodLCStr
(String a, String b, int n, int m)
DynamicProgramming/LongestCommonSubstring/Length_Of_Longest_Common_Substring.java:77
MethodLCslength
(int A[])
DynamicProgramming/LongestIncreasingSubsequence/Length_Of_Longest_Increasing_Subsequence.java:67
MethodLISlength
(int A[], int current, int n, int prev)
DynamicProgramming/LongestIncreasingSubsequence/Length_Of_Longest_Increasing_Subsequence.java:23
MethodLPSlength
(String A, int start, int end)
DynamicProgramming/LongestPalindromicSubsequence/LengthOfLongestPalindromicSubseq.java:23
MethodLRSlen
(String s, int i, int j, HashMap<String, Integer> map)
DynamicProgramming/LongestRepeatedSubsequenceProblem.java:19
MethodPoint
(int i, int j)
DynamicProgramming/MaximumSumSubMatrixInAGivenMatrix.java:14
MethodSCSLength
(String X, String Y, int m, int n, int[][] T)
DynamicProgramming/ShortestCommonSupersequence/PrintShortestCommonSupersequence.java:81
MethodaddTwoNumbers
(ListNode l1, ListNode l2)
LinkedList/Add_Two_Numbers.java:15
MethodcalcSum
(int coins[])
DynamicProgramming/OptimalStratergyForGame/Optimal_Stratergy_For_Game2.java:24
MethodcanFinish
(int numCourses, int[][] prerequisites)
GraphsDFS&BFS/Course_Schedule.java:6
MethodcharacterReplacement
(String s, int k)
SlidingWindow/Longest_Repeating_Character_Replacement.java:5
MethodcheckInclusion
(String s1, String s2)
SlidingWindow/Permutation_in_String.java:5
MethodcloneGraph
(Node node)
GraphsDFS&BFS/Clone_Graph.java:31
MethodcoinChangeWays
(int coins[], int index, int coinVal)
DynamicProgramming/CoinChangeWays/CoinChangeNumberOfWays.java:23
MethodcombinationSum
(int[] nums, int target)
Backtracking/CombinationSum.java:5
MethodcombinationSum2
(int[] nums, int target)
Backtracking/CombinationSumII.java:5
MethodcombinationSum3
(int k, int n)
Backtracking/CombinationSumIII.java:9
Methodcompare
(library a, library b)
Google_Hash_Code_2020.java:27
Methodcompare
(String s1, String s2)
Arrays/Largest_Number_From_Array.java:13
MethodcompareTo
(time t)
Google-Code-Jam-QualificationRound-2020/ParentingPartneringReturns.java:15
MethodcomputeQueries
(int p, int q, int r, int s)
DynamicProgramming/SumOfElementsInASubMatrixConstantTime/SumOfAllElementsInASubMatrixInConstantTime.java:45
Methodconvert
(String s, int numRows)
String/ZigZag_Conversion.java:5
Methodcount
(int coeff[], int index, int rhs)
DynamicProgramming/#SolutionsOfLinearEqtn.java:15
MethodcountBooleanParenthesization
(char sym[], char op[], int n)
DynamicProgramming/Boolean_Parenthesization_Problem.java:75
MethodcountNegatives
(int[][] grid)
BinarySearch/Count_Negative_Numbers_in_a_Sorted_Matrix.java:31
MethodcountNegatives
(int[][] grid)
BinarySearch/Count_Negative_Numbers_in_a_Sorted_Matrix.java:82
MethodcountPaths
(int dist)
DynamicProgramming/CountNumberOfWaysToCoverADistance.java:26
MethodcountStrings
(int n)
DynamicProgramming/#BinaryStringsWithoutConsecutive1s.java:28
MethoddecodeString
(String s)
Stacks/Decode_String.java:17
MethodeditDist
(String X, String Y, int n, int m)
DynamicProgramming/EditDistance.java:26
Methodexist
(char[][] board, String word)
Backtracking/WordSearch.java:5
Methodfibonnaci
(int n)
DynamicProgramming/MIT-6.006-IntroToAlgosNotes/DP1_Fibonacci_ShortestPaths.java:30
MethodfillSumMatrix
(int A[][])
DynamicProgramming/MaximumSumSubMatrixInAGivenMatrix.java:24
MethodfillSumMatrix
(int A[][])
DynamicProgramming/SumOfElementsInASubMatrixConstantTime/SumOfAllElementsInASubMatrixInConstantTime.java:19
MethodfindAllPlindromes
(String s, boolean isPalin[][])
DynamicProgramming/MinimumCutsForPalindromicPartition.java:9
MethodfindAnagrams
(String s, String p)
SlidingWindow/Find_All_Anagarms_In_A_String.java:5
MethodfindCircleNum
(int[][] M)
GraphsDFS&BFS/Friend_Circles.java:18
MethodfindDelayedProjects
(char dependencies[][], char delayedProjects[])
GraphsDFS&BFS/DelayedProjects.java:67
MethodfindJudge
(int N, int[][] trust)
GraphsDFS&BFS/Find_the_Town_Judge.java:5
MethodfindMin
(int[] nums)
BinarySearch/Find_Minimum in_Rotated_Sorted_Array.java:5
MethodfindMinPartition
(int A[])
DynamicProgramming/MinimumSumPartition/MinimumSumPartition.java:35
MethodfindOrder
(int numCourses, int[][] prerequisites)
GraphsDFS&BFS/Course_Schedule_II.java:6
MethodfindPeakElement
(int[] nums)
BinarySearch/Find_Peak_Element.java:32
MethodfindSCS
(String X, String Y, int m, int n,int T[][])
DynamicProgramming/ShortestCommonSupersequence/PrintShortestCommonSupersequence.java:8
MethodfindWays
(int dices, int faces, int sum)
DynamicProgramming/DiceThrow/DiceThrow.java:42
MethodfirstBadVersion
(int n)
BinarySearch/First_Bad_Version.java:24
MethodfirstMissingPositive
(int[] nums)
Arrays/First_Missing_Positive.java:27
MethodfirstOccurrence
(int arr[],int target)
BinarySearch/Binary_Search_Variants.java:54
MethodfirstOccurrenceGreaterThanKey
(int arr[],int target)
BinarySearch/Binary_Search_Variants.java:116
MethodfourSum
(int[] nums, int target)
TwoPointer/4Sum.java:5
MethodgardenNoAdj
(int N, int[][] paths)
GraphsDFS&BFS/Flower_Planting_With_No_Adjacent.java:6
MethodgenerateParenthesis
(int n)
Backtracking/GenerateParentheses.java:5
MethodguessNumber
(int n)
BinarySearch/Guess_Number_Higher_or_Lower.java:29
MethodisInterleaving
(String X, String Y, String S, HashMap<String, Boolean> map)
DynamicProgramming/StringInterleaving.java:15
MethodisMatch
(String str, String pattern)
DynamicProgramming/WildCardMatching.java:13
MethodisPalindrome
(int x)
Math/Palindrome_Number.java:5
MethodisSameTree
(TreeNode p, TreeNode q)
Trees/Same_Tree.java:14
MethodisSubset
(int A[], int current, int sum)
DynamicProgramming/SubsetSumProblem/SubsetSumProblem.java:27
MethodisSymmetric
(TreeNode root)
Trees/Symmetric_Tree.java:14
next →1–100 of 190, ranked by callers