MCPcopy Create free account

hub / github.com/Tiwarishashwat/InterviewCodes / functions

Functions483 in github.com/Tiwarishashwat/InterviewCodes

⨍ Functions 483◇ Types & classes 302
↓ 1 callersMethodisValid
(int cap,int weights[],int days,int n)
CapacityToShipPackagesWithInDDays.java:2
↓ 1 callersMethodisValidCell
(int row,int col,int rows,int cols)
TrappingRainwater2.java:59
↓ 1 callersMethodleafNodes
(Node node, ArrayList<Integer> list)
TreeBoundaryTraversalBinaryTree.java:42
↓ 1 callersMethodleftBoundary
(Node node, ArrayList<Integer> list)
TreeBoundaryTraversalBinaryTree.java:13
↓ 1 callersMethodline
(String words[],int start,int end, int Linelen,int max)
TextJustification.java:22
↓ 1 callersMethodlongestCommonSubsequence
(String text1, String text2)
shortestCommonSupersequence.java:32
↓ 1 callersMethodmaxDepth
(TreeNode root)
TreeBalancedBinaryTree.java:2
↓ 1 callersMethodmaxiPathSum
(TreeNode root, int arr[])
TreeMaximumPathSumBinaryTree.java:9
↓ 1 callersMethodmerge
(int arr[], int l, int m, int r)
MergeSort.java:3
↓ 1 callersMethodmerge
(long arr[],long s,long m, long e)
CountInversions.java:26
↓ 1 callersMethodmergeSort
(long arr[],long s, long f)
CountInversions.java:13
↓ 1 callersMethodmySqrt
(int N )
CountSquares.java:4
↓ 1 callersMethodnotInVisited
(int visitedArray[],int element)
CountMoreThanN-K.java:27
↓ 1 callersMethodopening
(char ch)
BalancedParanthesis.java:4
↓ 1 callersMethodpaths
(TreeNode root,String S, ArrayList<String> list)
TreeBinaryTreePaths.java:12
↓ 1 callersMethodpermute
(int index, String s)
StringPermutations.java:16
↓ 1 callersMethodpostorder
(TreeNode node,List<Integer> list)
TreePostorder.java:2
↓ 1 callersMethodpreorder
(TreeNode root,List<Integer> list)
TreePreorder.java:2
↓ 1 callersMethodrabinKarp
(String str, String pattern)
RabinKarp.java:15
↓ 1 callersMethodrearrange
(int nums[], int n)
RearrangeArrayInAlternatingPositions.java:28
↓ 1 callersMethodrecur
(int len, int k)
FindKthBitInNthBinaryString.java:7
↓ 1 callersMethodrecur
(int index, int nums[], int curOr, int targetOr,Integer dp[][])
CountNumberOfMaximumBitwise-ORSubsets.java:14
↓ 1 callersMethodrecur
(String exp, int start, int end,List<Integer>[][] dp)
DifferentWaystoAddParentheses.java:9
↓ 1 callersMethodrecur
(String s, HashSet<String> dictionary, int index)
ExtraCharactersInAString.java:9
↓ 1 callersMethodrecur
(int i1, int i2, int j1, int j2, int preorder[], int postorder[])
ConstructBinaryTreeFromPreorderAndPostOrder.java:26
↓ 1 callersMethodrecursion
(String str,int start,int end)
CountPalindromicSubsequences.java:10
↓ 1 callersMethodrightBoundary
(Node node, ArrayList<Integer> list)
TreeBoundaryTraversalBinaryTree.java:25
↓ 1 callersMethodseen
(int arr[],int element,int end)
CommonMatrixElements.java:64
↓ 1 callersMethodshift
(int arr[],int pos,int n)
TargetArrayInGivenOrder.java:4
↓ 1 callersMethodsol
(int n)
NextGreaterNumberWithSameDigitSum.java:10
↓ 1 callersMethodsolve
(HashMap<Character,String> map,String input,int n)
PrintNumPadPermutation.java:28
↓ 1 callersMethodsolve
(int arr[])
FirstThreeLargest.java:7
↓ 1 callersMethodsubSequence
(String input, String output, int index)
StringSubsequences.java:9
↓ 1 callersMethodsymmetric
(TreeNode root1, TreeNode root2)
TreeSymmetricBinaryTree.java:9
↓ 1 callersMethodtravel
(TreeNode root, int B,ArrayList<Integer> list)
TreePathToGivenNode.java:8
↓ 1 callersMethodtravel
(TreeNode root, int B,ArrayList<Integer> list)
TreeBinaryTreePathToNode.java:8
↓ 1 callersMethodunion
(int node1, int node2)
MinimumCostWalkInWeightedGraph.java:18
↓ 1 callersMethodunion
(int node1, int node2)
CountTheNumberOfCompleteComponents.java:50
↓ 1 callersMethodunionBySize
(int node1, int node2)
SatisfiabilityOfEqualityEquations.java:47
↓ 1 callersMethodunionBySize
(int node1, int node2)
NumberOfOperationsToMakeNetworkConnected.java:41
↓ 1 callersMethodunionBySize
(int node1, int node2)
KruskalsAlgorithm.java:51
↓ 1 callersMethodunionBySize
(int node1, int node2)
RedundantConnection.java:36
MethodAllOne
()
AllOoneDataStructure.java:17
MethodCustomStack
(int maxSize)
DesignAStackWithIncrements.java:7
MethodDSU
(int n)
MinimumCostWalkInWeightedGraph.java:4
MethodDSU
(int n)
CountTheNumberOfCompleteComponents.java:32
MethodDisjointSet
(int nodes)
SatisfiabilityOfEqualityEquations.java:31
MethodDisjointSet
(int nodes)
NumberOfOperationsToMakeNetworkConnected.java:25
MethodDisjointSet
(int nodes)
KruskalsAlgorithm.java:35
MethodDisjointSet
(int nodes)
RedundantConnection.java:20
MethodFindElements
(TreeNode root)
FindElementsInAContaminatedBinaryTree.java:18
MethodKthLargest
(int k, int[] nums)
KthLargestElementInAStream.java:4
MethodMain
(String args[])
FirstThreeLargest.java:2
MethodMyCalendar
()
myCalendar1.java:3
MethodMyCalendarTwo
()
MyCallendar2.java:5
MethodMyCircularDeque
(int k)
DesignCircularDeque.java:7
MethodNode
()
sumOfPrefixScoresOfStrings.java:33
MethodNode
(int data)
TreeRepBinary.java:15
MethodNode
(int f)
AllOoneDataStructure.java:6
MethodNumberContainers
()
DesignANumberContainerSystem.java:5
MethodPair
(int count, char ch)
LongestHappyString.java:49
MethodPair
(Node n,int v)
TreeTopView.java:4
MethodPair
(Node n,int v)
TreeBottomView.java:4
MethodProductOfNumbers
()
ProductOfTheLastKNumbers.java:3
MethodSubrectangleQueries
(int[][] rectangle)
SubrectangleQueries.java:5
MethodTrie
()
sumOfPrefixScoresOfStrings.java:41
Methodadd
(int num)
ProductOfTheLastKNumbers.java:7
MethodaddWord
(String word)
sumOfPrefixScoresOfStrings.java:44
MethodallPathsSourceTarget
(int[][] graph)
AllPathsSourceToEndGraph.java:19
MethodapplyOperations
(int[] nums)
ApplyOperationsToAnArray.java:2
MethodareAlmostEqual
(String s1, String s2)
CheckIfOneStringSwapCanMakeStringsEqual.java:2
MethodareIsomorphic
(String str1,String str2)
isomorphicStrings.java:4
MethodareSentencesSimilar
(String sentence1, String sentence2)
SentenceSimilarityIII.java:4
MethodarrayRankTransform
(int[] arr)
RankTransformofanArray.java:3
MethodarrayStringsAreEqual
(String[] word1, String[] word2)
CheckIfTwoStringsAreEquivalent.java:2
Methodbellman_ford
(int V, ArrayList<ArrayList<Integer>> edges, int S)
BellmanfordAlgorithm.java:11
MethodbinString
(String str)
SplitBinaryString.java:1
MethodbinaryTreePaths
(TreeNode root)
TreeBinaryTreePaths.java:4
Methodbook
(int start, int end)
MyCallendar2.java:10
Methodbook
(int start, int end)
myCalendar1.java:7
MethodbottomView
(Node root)
TreeBottomView.java:13
MethodbuildMatrix
(int k, int[][] rowConditions, int[][] colConditions)
BuildAMatrixWithConditions.java:50
MethodcanArrange
(int[] arr, int k)
checkIFArrayPairsAreDivisiblebyK.java:2
MethodcanBeEqual
(int[] target, int[] arr)
MakeTwoArraysEqualbyReversingSubarrays.java:6
MethodcanBeValid
(String s, String locked)
checkIfParenthesisStringCanBeValid.java:2
MethodcanCompleteCircuit
(int[] gas, int[] cost)
GasStation.java:2
MethodcanConstruct
(String s, int k)
ConstructKPalindromeStrings.java:2
MethodchalkReplacer
(int[] chalk, int k)
FindTheStudentThatWillReplaceTheChalk.java:3
Methodchange
(int index, int number)
DesignANumberContainerSystem.java:10
MethodcheckIfPrerequisite
(int numCourses, int[][] prerequisites, int[][] queries)
courseSchedule4.java:2
MethodcheckInclusion
(String s1, String s2)
PermutationInString.java:3
MethodcheckPowersOfThree
(int n)
CheckIfNumberIsASumOfPowersOfThree.java:2
MethodcheckZeroOnes
(String s)
LongerContiguousSegmentsOfOnesThanZeros.java:2
MethodclearDigits
(String s)
ClearDigits.java:2
MethodclosestPrimes
(int left, int right)
ClosestPrimeNumbersInRange.java:2
MethodcoloredCells
(int n)
CountTotalNumberOfColoredCells.java:2
MethodcommonElements
(int A[], int B[], int C[], int n1, int n2, int n3)
CommanElements.java:3
Methodcompare
(int a[], int b[])
SmallestRangeCoveringElementsFromKLists.java:6
Methodcompare
(int a[], int b[])
RangeSumOfSortedSubarraySums.java:6
Methodcompare
(Integer a, Integer b)
SortThePeople.java:12
← previousnext →101–200 of 483, ranked by callers