MCPcopy Create free account

hub / github.com/ChristianCSE/Interview-Study-Guide / functions

Functions934 in github.com/ChristianCSE/Interview-Study-Guide

↓ 1 callersMethodcombinations
(String str)
99-answerKey/companies/gusto/HotlineBling.java:95
↓ 1 callersMethodcompressMe
(String nums)
99-answerKey/general/dec-week2/compression.java:3
↓ 1 callersMethodcontainsNearbyDuplicate
[containsNearbyDuplicate finds insance of duplicates] @param nums [arr of integers] @param k [maximum distance b/w duplicates] @return boolean
99-answerKey/companies/airbnb/containsNearbyDuplicate/Solution.java:21
↓ 1 callersMethodcontainsPrefix
(String word)
2-Data-Structures/trie/Trie.java:29
↓ 1 callersMethodconvert
(String s, int numRows)
99-answerKey/leetcode/6|ZigZag-Conversion/Solution.java:4
↓ 1 callersMethodcouldBePaying
(String a, String b, Integer isOwed, Map<String, HashMap<String, Integer>> map)
99-answerKey/companies/gusto/payments.java:37
↓ 1 callersMethoddaysInShop
()
99-answerKey/concepts/anonymousmethods/CarShop.java:9
↓ 1 callersMethoddeleteNode
(int data)
2-Data-Structures/LinkedLists/DoublyLinkedList/DoublyLinkedList.java:108
↓ 1 callersMethoddeleteNode
(int data)
99-answerKey/data-structures/Linked-List/DoublyLinkedList/DoublyLinkedList.java:108
↓ 1 callersMethoddeletingDuplicates
(List<Integer> A)
12-EPI/ch6-arrays/deletingDuplicates/Solution.java:7
↓ 1 callersMethoddetermineLife
(int row, int col, int[][] board, List<Integer> rowAbove, int rows, int cols)
99-answerKey/companies/snap/gamelife/MathSolution.java:24
↓ 1 callersMethoddetermineLife
(int row, int col, int[][] board, List<Integer> rowAbove, int rows, int cols)
99-answerKey/leetcode/289-GameOLife/Solution.java:24
↓ 1 callersMethoddiffByOne
(String wordAt, String branchTo)
2-Data-Structures/wordladder/pathAttempt.java:32
↓ 1 callersMethoddiffByOne
(String want, String candidate)
99-answerKey/genericFrequent/wordLadder/DFSWordLadder.java:43
↓ 1 callersMethoddijkstra
(int startingVertex, int endingVertex)
0-Refresher/implement/graphs_trees/graphs/weighted/Graph.java:109
↓ 1 callersMethoddistribute
(int[] array, int beginIn, int endIn, int nthDigit, List<Integer>[] buckets)
1-Sorting-Algorithms/Radix_Sort/Solution.java:31
↓ 1 callersMethoddoBackwardSum
()
0-Refresher/CTCI/ch2-Linked_list/5-SumList/Solution.java:36
↓ 1 callersMethoddoForwardSum
()
0-Refresher/CTCI/ch2-Linked_list/5-SumList/ForwardSolution.java:93
↓ 1 callersMethoddothis
()
99-answerKey/genericFrequent/pair-permutations/PairPermutations.java:89
↓ 1 callersMethoddoublyDeleteNode
(Node head, int val)
0-Refresher/CTCI/ch2-Linked_list/implementations/Demo.java:7
↓ 1 callersMethoddynamicFibonacci
(int n)
99-answerKey/algorithms/recursion-dynamic/fibonacci/Solution.java:4
↓ 1 callersMethoddynoBoard
(char[] up, char[] down, int row, int col)
99-answerKey/general/dec/lcs.java:42
↓ 1 callersMethoddynoLCS
(String a, String b)
99-answerKey/general/dec/lcs.java:30
↓ 1 callersMethodemptySet
(int i)
99-answerKey/concepts/anonymousmethods/Car.java:8
↓ 1 callersMethodevenThenOdd
(int[] A)
12-EPI/ch6-arrays/evenOdd/Solution.java:7
↓ 1 callersMethodevenlyDistrib
(int[] blacklisting, int n)
99-answerKey/general/dec/randomNumbersBlacklisting.java:4
↓ 1 callersMethodexplicitCastingMapIterations
(Map map)
99-answerKey/utils/studyGuide1.java:14
↓ 1 callersMethodfindAnagrams
(String s, String p)
99-answerKey/leetcode/438|SubstringAnagrams/Solution.java:7
↓ 1 callersMethodfindLastCharacter
(char[] str)
99-answerKey/CTCI/Ch1-Arrays-Strings/4-add20ToString/add20ToString.java:45
↓ 1 callersMethodfindMaxDepth
(Node node, int depth)
99-answerKey/CTCI/Ch4-Trees&Graphs/Z-Aside/maxDepth.java:54
↓ 1 callersMethodflipped
(int[][] board, List<Integer[]> dead, List<Integer[]> light)
99-answerKey/companies/snap/gamelife/Solution.java:5
↓ 1 callersMethodformLinks
(InputStream sourceWlink, int vertices)
99-answerKey/data-structures/Graphs/Graph/testing.java:6
↓ 1 callersMethodformLinks
(InputStream sourceWlink, int vertices)
99-answerKey/algorithms/graphSearch/testing.java:7
↓ 1 callersMethodfullJustify
fullJustify: L is the width of a legitmate string of size L add space padding in order for it to fit this. Also, it is guarenteed that each string w
99-answerKey/companies/airbnb/Text-Justification/Solution.java:17
↓ 1 callersMethodgenerateFreqTable
(String str)
0-Refresher/CTCI/ch1-arrays-and-strings/4-permutations-palindromes/Solution.java:36
↓ 1 callersMethodget1001th
()
99-answerKey/project-Euler/8-prime-1001/thprime.java:15
↓ 1 callersMethodgetBackwardsSum
(Node listOne, Node listTwo)
0-Refresher/CTCI/ch2-Linked_list/5-SumList/Solution.java:11
↓ 1 callersMethodgetBanned
(int row, int col, int rows, int cols, Map<Integer, List<Integer>> map)
99-answerKey/companies/snap/gamelife/Solution.java:117
↓ 1 callersMethodgetCandidates
(Set<String> set, String[] careNumbers, String[] formedWord, int startingPoint)
99-answerKey/companies/gusto/HotlineBling.java:78
↓ 1 callersMethodgetComb
(List<List<Integer>> zeroSum, int nums[], int len, int canIn, int candidate[], int numberLine, Set<String
99-answerKey/leetcode/15|3Sum/Solution.java:20
↓ 1 callersMethodgetCurrentWord
()
99-answerKey/genericFrequent/wordLadder/WordLadder.java:23
↓ 1 callersMethodgetDiagonals
(int row, int col, int rows, int cols, Map<Integer, List<Integer>> map)
99-answerKey/companies/snap/gamelife/Solution.java:42
↓ 1 callersMethodgetEdgeWeight
()
99-answerKey/data-structures/Graphs/Graph/Edge.java:43
↓ 1 callersMethodgetEdgeWeight
()
99-answerKey/algorithms/graphSearch/Edge.java:44
↓ 1 callersMethodgetForwardSum
(Node listOne, Node listTwo)
0-Refresher/CTCI/ch2-Linked_list/5-SumList/ForwardSolution.java:17
↓ 1 callersMethodgetIntArr
(int[] oldarr)
99-answerKey/leetcode/15|3Sum/Solution.java:59
↓ 1 callersMethodgetKth
(int[] array, int left, int right, int k)
1-Sorting-Algorithms/Partition_Sort/Solution.java:20
↓ 1 callersMethodgetKthNode
(Node head, int kthToLast)
0-Refresher/CTCI/ch2-Linked_list/2-kth_last/UseRunner.java:10
↓ 1 callersMethodgetLCS
(char[] up, char[] down, int[][] table, int row, int col)
99-answerKey/general/dec/lcs.java:67
↓ 1 callersMethodgetLength
(Node head)
2-Data-Structures/LinkedLists/SinglyLinkedList/SinglyTasks.java:79
↓ 1 callersMethodgetLength
(Node head)
99-answerKey/data-structures/Linked-List/SinglyLinkedList/SinglyTasks.java:79
↓ 1 callersMethodgetListTotalSum
(Node listOne, Node listTwo)
0-Refresher/CTCI/ch2-Linked_list/5-SumList/ForwardSolution.java:37
↓ 1 callersMethodgetLoopHead
(Node head)
0-Refresher/CTCI/ch2-Linked_list/8-LoopDetection/Solution.java:10
↓ 1 callersMethodgetMaxDigits
(int[] array)
1-Sorting-Algorithms/Radix_Sort/Solution.java:46
↓ 1 callersMethodgetMin
(DistancePairs[] shortestPath, List<Integer> visted)
0-Refresher/implement/graphs_trees/graphs/weighted/Graph.java:139
↓ 1 callersMethodgetMin
(DistancePairs[] shortestPath, List<Integer> visted)
0-Refresher/implement/graphs_trees/graphs/weighted/Algorithms/Dijkstra.java:45
↓ 1 callersMethodgetMultiOrdered
(int[] nodes)
2-Data-Structures/LinkedLists/SinglyLinkedList/SinglyLinkedList.java:54
↓ 1 callersMethodgetMultiOrdered
(int[] nodes)
99-answerKey/data-structures/Linked-List/SinglyLinkedList/SinglyLinkedList.java:54
↓ 1 callersMethodgetOtherSources
(int target)
99-answerKey/data-structures/Graphs/Graph/Graph.java:31
↓ 1 callersMethodgetOtherSources
(int target)
99-answerKey/algorithms/graphSearch/Graph.java:34
↓ 1 callersMethodgetPathLength
()
99-answerKey/genericFrequent/wordLadder/WordLadder.java:28
↓ 1 callersMethodgetPathNow
(String beginWord, String endWord, Set<String> wordList)
99-answerKey/genericFrequent/wordLadder/DFSWordLadder.java:8
↓ 1 callersMethodgetPerms
(String word)
99-answerKey/genericFrequent/allPermutations/allPermutations.java:10
↓ 1 callersMethodgetSource
()
99-answerKey/data-structures/Graphs/Graph/Edge.java:33
↓ 1 callersMethodgetSource
()
99-answerKey/algorithms/graphSearch/Edge.java:34
↓ 1 callersMethodgetSuccessorTo
(int[][] adjMatrix, int row)
0-Refresher/implement/graphs_trees/graphs/unweighted/Testing.java:29
↓ 1 callersMethodgetSum
(int[] arr)
99-answerKey/leetcode/15|3Sum/Solution.java:48
↓ 1 callersMethodgetTarget
()
99-answerKey/data-structures/Graphs/Graph/Edge.java:38
↓ 1 callersMethodgetTarget
()
99-answerKey/algorithms/graphSearch/Edge.java:39
↓ 1 callersMethodgetTree
()
10-Java-DataStructs/src/Trees/BST.java:23
↓ 1 callersMethodgetTree
(int data)
99-answerKey/CTCI/Ch4-Trees&Graphs/Z-Aside/maxDepth.java:51
↓ 1 callersMethodgridProduct
()
99-answerKey/project-Euler/10-largest-Prod-Grid/largestprodGrid.java:5
↓ 1 callersMethodgroupAnagrams
(String[] strs)
99-answerKey/genericFrequent/groupAnagrams/Solution.java:9
↓ 1 callersMethodheapSort
(int[] arr)
99-answerKey/CTCI/utils/utility.java:4
↓ 1 callersMethodheapsort
(int[] arr)
99-answerKey/algorithms/sorting/comparison-based/Heap-Sort/Solution.java:4
↓ 1 callersMethodinOrder
(BST.Node node, String dir, int stem)
99-answerKey/CTCI/Ch4-Trees&Graphs/2-MinimalTree/TestBST.java:3
↓ 1 callersMethodinOrderTraversal
(Node node)
10-Java-DataStructs/src/Trees/BST.java:27
↓ 1 callersMethodinit
(List<Integer>[] buckets)
1-Sorting-Algorithms/Radix_Sort/Solution.java:58
↓ 1 callersMethodinitPaths
(int startingVertex, DistancePairs[] shortestPath)
0-Refresher/implement/graphs_trees/graphs/weighted/Graph.java:131
↓ 1 callersMethodinitPaths
(int startingVertex, DistancePairs[] shortestPath)
0-Refresher/implement/graphs_trees/graphs/weighted/Algorithms/Dijkstra.java:37
↓ 1 callersMethodinitarr
(List<Edge>[] sources, int size)
99-answerKey/data-structures/Graphs/Graph/Graph.java:23
↓ 1 callersMethodinitarr
(List<Edge>[] sources, int size)
99-answerKey/algorithms/graphSearch/Graph.java:26
↓ 1 callersMethodinsert
(int curr)
99-answerKey/CTCI/Ch4-Trees&Graphs/5-Valid-BST/Solution.java:59
↓ 1 callersMethodinsertBalenced
(int data)
99-answerKey/companies/snap/zigzag/Solution.java:95
↓ 1 callersMethodinsertBalenced
(int data)
99-answerKey/leetcode/103|BinaryTree-ZigZag/Solution.java:95
↓ 1 callersMethodinsertLeft
(Node left)
99-answerKey/companies/gusto/Traversal.java:73
↓ 1 callersMethodinsertNode
(Node node, int newData)
99-answerKey/CTCI/Ch4-Trees&Graphs/5-Valid-BST/Solution.java:68
↓ 1 callersMethodinsertOrderSLL
(int data)
2-Data-Structures/LinkedLists/SinglyLinkedList/SinglyLinkedList.java:21
↓ 1 callersMethodinsertOrderSLL
(int data)
99-answerKey/data-structures/Linked-List/SinglyLinkedList/SinglyLinkedList.java:21
↓ 1 callersMethodinsertRight
(Node right)
99-answerKey/companies/gusto/Traversal.java:77
↓ 1 callersMethodinsertSubTrees
(int[] nums)
99-answerKey/CTCI/Ch4-Trees&Graphs/4-SubtreeHeights/Solution.java:55
↓ 1 callersMethodinsertWord
(String word)
99-answerKey/CTCI/ATM/autocomp.java:21
↓ 1 callersMethodinsertmove
(String want, String have)
99-answerKey/CTCI/Ch1-Arrays-Strings/B5-oneAway/oneAway.java:74
↓ 1 callersMethodintit
(double[] distances, Integer[] previous, int target)
99-answerKey/algorithms/graphSearch/Dijkstra.java:6
↓ 1 callersMethodinvertTree
(TreeNode root)
2-Data-Structures/Trees/Test-tree/invertBST.java:32
↓ 1 callersMethodinvertTree
(TreeNode root)
99-answerKey/genericFrequent/invert-BST/invertBST.java:32
↓ 1 callersMethodisCompressionShorter
(String candidate)
99-answerKey/CTCI/Ch1-Arrays-Strings/5-stringCompression/stringCompression.java:29
↓ 1 callersMethodisEmpty
This is used to see if the stack still has elements left in it. @return if Empty return true, else reeturn false
99-answerKey/CTCI/Ch3-Stacks-Queues/2-Stack-Min/MinStack.java:96
↓ 1 callersMethodisFull
(int stack)
0-Refresher/CTCI/ch3-Stacks_n_Queues/1-Array3Stacks/ArrayStacks.java:30
↓ 1 callersMethodisIntersecting
(Node listOne, Node listTwo)
0-Refresher/CTCI/ch2-Linked_list/7-Intersection/Solution.java:11
← previousnext →201–300 of 934, ranked by callers