MCPcopy Create free account

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

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

⨍ Functions 934◇ Types & classes 342
↓ 2 callersMethodaddOne
(String one, String two)
0-Refresher/CTCI/ch1-arrays-and-strings/5-one_away/Solution.java:5
↓ 2 callersMethodautoplete
(String candidate)
99-answerKey/CTCI/ATM/autocomp.java:35
↓ 2 callersMethodcaller
(DoublyLinkedList list, String where)
2-Data-Structures/LinkedLists/DoublyLinkedList/DoublyTasks.java:5
↓ 2 callersMethodcaller
(DoublyLinkedList list, String where)
99-answerKey/data-structures/Linked-List/DoublyLinkedList/DoublyTasks.java:5
↓ 2 callersMethodcheckDrome
(String concat)
99-answerKey/companies/airbnb/palindromePairs/oldsolution.java:84
↓ 2 callersMethodcompression
(String candidate)
99-answerKey/companies/yelp/1-stringcompression/stringcompression.java:4
↓ 2 callersMethodcountAndSay
(int n)
99-answerKey/leetcode/38|countNsay/Solution.java:5
↓ 2 callersMethoddecompose
(String phoneNumber)
99-answerKey/companies/gusto/HotlineBling.java:37
↓ 2 callersMethoddequeueAny
()
0-Refresher/CTCI/ch3-Stacks_n_Queues/6-DogCatShelter/Shelter.java:30
↓ 2 callersMethoddequeueCat
()
0-Refresher/CTCI/ch3-Stacks_n_Queues/6-DogCatShelter/Shelter.java:50
↓ 2 callersMethoddoMath
(String op, String b, String a)
99-answerKey/companies/thumbtack/meds/RevPolish.java:23
↓ 2 callersMethoddoProblem
(int[] one, int[] two)
12-EPI/ch6-arrays/multiply/Solution.java:57
↓ 2 callersMethodevalRPN
(String[] tokens)
99-answerKey/companies/thumbtack/meds/RevPolish.java:5
↓ 2 callersMethodgetBanned
(int row, int col, int rows, int cols, Map<Integer, List<Integer>> map)
99-answerKey/companies/snap/gamelife/Best.java:117
↓ 2 callersMethodgetHead
()
2-Data-Structures/LinkedLists/SinglyLinkedList/SinglyLinkedList.java:196
↓ 2 callersMethodgetHead
()
99-answerKey/data-structures/Linked-List/SinglyLinkedList/SinglyLinkedList.java:196
↓ 2 callersMethodgetHeight
(Node root)
99-answerKey/CTCI/Ch4-Trees&Graphs/4-SubtreeHeights/Solution.java:5
↓ 2 callersMethodgetLength
(Node head)
0-Refresher/CTCI/ch2-Linked_list/5-SumList/ForwardSolution.java:83
↓ 2 callersMethodgetMedian
()
99-answerKey/algorithms/median/Solution.java:45
↓ 2 callersMethodgetMinHeightBST
1, 2, 3, 4, 5, 6, 7, 8, 9, 10 getMid => 5 pretty much binarySearch in keep splitting loMid => (lo+mid-1)/2 hiMid => (mid+1+hi)/2 Make sure to compute
99-answerKey/CTCI/Ch4-Trees&Graphs/2-MinimalTree/BST.java:69
↓ 2 callersMethodgetlastStack
()
0-Refresher/CTCI/ch3-Stacks_n_Queues/3-StackOfPlates/StackOfPlates.java:80
↓ 2 callersMethodheaping
(int[] arr, int len, int currentParent)
99-answerKey/CTCI/utils/utility.java:21
↓ 2 callersMethodheapit
(int[] arr, int parent, int len)
99-answerKey/algorithms/sorting/comparison-based/Heap-Sort/Solution.java:30
↓ 2 callersMethodincrSequence
(String word)
99-answerKey/companies/gusto/IncreasingSub.java:4
↓ 2 callersMethodinsertEdge
(String target, double weight)
10-Java-DataStructs/src/Graph/NonDir/Graph.java:78
↓ 2 callersMethodinsertEdge
(Integer target)
10-Java-DataStructs/src/BFSing/Reaching.java:30
↓ 2 callersMethodinsertNewHead
(Node head, int sum)
0-Refresher/CTCI/ch2-Linked_list/5-SumList/ForwardSolution.java:55
↓ 2 callersMethodinsertTarget
(Node x)
99-answerKey/CTCI/Ch4-Trees&Graphs/1-RouteBetweenNodes/Graph.java:28
↓ 2 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/3-generic-Stack/Stack.java:56
↓ 2 callersMethodisFull
()
0-Refresher/CTCI/ch3-Stacks_n_Queues/3-StackOfPlates/StackOfPlates.java:156
↓ 2 callersMethodisPerfect
(int numb)
12-EPI/ch4/squaresWithinRange.java:3
↓ 2 callersMethodisUnique
(String candidate)
0-Refresher/CTCI/ch1-arrays-and-strings/1-is_unique/Solution.java:6
↓ 2 callersMethodmapOrdering
(Map<Character, Integer> map, String str)
0-Refresher/CTCI/ch1-arrays-and-strings/2-check_permutation/Solution.java:29
↓ 2 callersMethodmarkJump
(int[] bridge, int dir)
99-answerKey/companies/pin/reachZero/Solution.java:36
↓ 2 callersMethodpadSentence
(String sentence, int maxWidth)
99-answerKey/companies/airbnb/Text-Justification/Solution.java:78
↓ 2 callersMethodpadding
(Node list, int padding)
0-Refresher/CTCI/ch2-Linked_list/5-SumList/ForwardSolution.java:71
↓ 2 callersMethodpalindromePairs
cases: 1. already a palindrome => can only stay a palindrome if "" blank exists: This would be bidriectional 2. the reversal string that would make it
99-answerKey/companies/airbnb/palindromePairs/Solution.java:19
↓ 2 callersMethodparseTernary
(String expression)
99-answerKey/leetcode/439-ternary-exprsn-parser/Solution.java:5
↓ 2 callersMethodpermutableNumb
(int numb)
12-EPI/ch4/permutable.java:5
↓ 2 callersMethodpop
()
99-answerKey/CTCI/Ch3-Stacks-Queues/2-Stack-Min/MinStack.java:35
↓ 2 callersMethodpop
()
0-Refresher/CTCI/ch3-Stacks_n_Queues/3-StackOfPlates/StackOfPlates.java:128
↓ 2 callersMethodprintPath
(Position [] path)
99-answerKey/concepts/backtracking/PathFinder.java:151
↓ 2 callersMethodprofit
(int[] stocks)
99-answerKey/interviewcake/appleStocks/appleStocks.java:9
↓ 2 callersMethodputNode
(int data)
2-Data-Structures/LinkedLists/DoublyLinkedList/DoublyLinkedList.java:20
↓ 2 callersMethodputNode
(int data)
99-answerKey/data-structures/Linked-List/DoublyLinkedList/DoublyLinkedList.java:20
↓ 2 callersMethodputNode
(int newnode)
99-answerKey/CTCI/Ch2-Linked-List/Linked-List/SingleLinkedList.java:34
↓ 2 callersMethodrangeSquares
(int[] pair)
12-EPI/ch4/squaresWithinRange.java:20
↓ 2 callersMethodreadMaze
(String filename)
99-answerKey/concepts/backtracking/PathFinder.java:202
↓ 2 callersMethodremoveNode
(Node node)
99-answerKey/concepts/DSHybrids/LRUCache/Solution.java:67
↓ 2 callersMethodremovekthLast
(SingleLinkedList.Node head, int wantkthLast)
99-answerKey/CTCI/Ch2-Linked-List/2-kthLastElement/kthLastElement.java:31
↓ 2 callersMethodreverseString
(String forward)
99-answerKey/CTCI/Ch1-Arrays-Strings/2-reverseString/reverseString.java:12
↓ 2 callersMethodshiftToQueue
()
0-Refresher/CTCI/ch3-Stacks_n_Queues/4-QueueAs2Stacks/MyQueue.java:28
↓ 2 callersMethodsize
()
99-answerKey/algorithms/graphSearch/Graph.java:39
↓ 2 callersMethodsort
(int[] arr)
99-answerKey/algorithms/sorting/comparison-based/Insertion-Sort/InsertionSort.java:2
↓ 2 callersMethodsort
(int[] arr)
99-answerKey/algorithms/sorting/comparison-based/Selection-Sort/SelectionSort.java:5
↓ 2 callersMethodsort
(Deque<Integer> stack)
0-Refresher/CTCI/ch3-Stacks_n_Queues/5-SortedStack/ActualSolution.java:10
↓ 2 callersMethodsort
(int[] array)
1-Sorting-Algorithms/Radix_Sort/Solution.java:18
↓ 2 callersMethodsortThem
(String word)
99-answerKey/CTCI/Ch1-Arrays-Strings/3-permutation-Of-Other/permutationOfOther.java:28
↓ 2 callersMethodsortThem
(String word)
99-answerKey/genericFrequent/pair-permutations/PairPermutations.java:76
↓ 2 callersMethodsortit
(String str)
0-Refresher/CTCI/ch1-arrays-and-strings/2-check_permutation/Solution.java:39
↓ 2 callersMethodstringCap
(int n, String addTo)
99-answerKey/leetcode/67|Add-Binary/Solution.java:39
↓ 2 callersFunctionswap
99-answerKey/algorithms/sorting/comparison-based/quicksort/quickSort.c:65
↓ 2 callersMethodswap
(T[] arrs, int lo, int hi)
99-answerKey/CTCI/utils/utility.java:69
↓ 2 callersMethodswap
(int[] arr, int a, int b)
99-answerKey/algorithms/allPermutations/Solution.java:28
↓ 2 callersMethodswap
(int[] arr, int a, int b)
99-answerKey/algorithms/sorting/comparison-based/Heap-Sort/Solution.java:48
↓ 2 callersMethodswap
(int[] array, int i, int j)
1-Sorting-Algorithms/Partition_Sort/Solution.java:60
↓ 2 callersMethodswapIt
(int[] arr, int i, int j)
99-answerKey/CTCI/utils/utility.java:37
↓ 2 callersMethodswapLetter
(String[] wordSep, int i, int j)
99-answerKey/genericFrequent/allPermutations/allPermutations.java:46
↓ 2 callersMethodtestPeek
(Queue<String> queue, String want)
99-answerKey/data-structures/Queue/QueueTest.java:36
↓ 2 callersMethodtesterArr
(int[] arr)
99-answerKey/leetcode/283-Move-Zeroes/Solution.java:23
↓ 2 callersMethodvalidBST
(Node root)
99-answerKey/CTCI/Ch4-Trees&Graphs/5-Valid-BST/Solution.java:4
↓ 1 callersMethodBFS
(String source, String end)
10-Java-DataStructs/src/Graph/NonDir/Graph.java:47
↓ 1 callersMethodMSTWeighted
()
0-Refresher/implement/graphs_trees/graphs/weighted/Graph.java:32
↓ 1 callersMethodMyreversal
(SinglyLinkedList list)
2-Data-Structures/LinkedLists/SinglyLinkedList/SinglyTasks.java:33
↓ 1 callersMethodMyreversal
(SinglyLinkedList list)
99-answerKey/data-structures/Linked-List/SinglyLinkedList/SinglyTasks.java:33
↓ 1 callersMethodadd20
(char[] str, int lastCharLenght)
99-answerKey/CTCI/Ch1-Arrays-Strings/4-add20ToString/add20ToString.java:11
↓ 1 callersMethodaddBinary
(String a, String b)
99-answerKey/leetcode/67|Add-Binary/Solution.java:3
↓ 1 callersMethodaddChild
(char key)
2-Data-Structures/trie/TrieNode.java:12
↓ 1 callersMethodaddToPQ
(int src, int dest, int distance, PriorityQueue<Edge> pq)
0-Refresher/implement/graphs_trees/graphs/weighted/Graph.java:80
↓ 1 callersMethodaddToPQ
(int src, int dest, int distance, PriorityQueue<Edge> pq)
0-Refresher/implement/graphs_trees/graphs/weighted/Algorithms/MSTWeighted.java:60
↓ 1 callersMethodadjustPath
(int currVertex, int startToCurr, List<Integer> visted, DistancePairs[] shortestPath)
0-Refresher/implement/graphs_trees/graphs/weighted/Graph.java:153
↓ 1 callersMethodadjustPath
(int currVertex, int startToCurr, List<Integer> visted, DistancePairs[] shortestPath)
0-Refresher/implement/graphs_trees/graphs/weighted/Algorithms/Dijkstra.java:59
↓ 1 callersMethodbetterSolution
[betterSolution: not mine ] @param nums [arr of number] @param k [max space b/w indices] @return boolean [is distance b/w: curr - prev <= k]
99-answerKey/companies/airbnb/containsNearbyDuplicate/Solution.java:59
↓ 1 callersMethodbinarySearch
(int[] numbers, int want)
99-answerKey/genericFrequent/Binary-Search/BinarySearch.java:10
↓ 1 callersMethodbinarySearch
(int[] numbers, int want)
99-answerKey/algorithms/search/binary-search/BinarySearch.java:8
↓ 1 callersMethodbruteForceSolution
(List<Integer> A)
12-EPI/ch6-arrays/deletingDuplicates/Solution.java:22
↓ 1 callersMethodcallBubble
()
99-answerKey/algorithms/sorting/comparison-based/test/callSort.java:59
↓ 1 callersMethodcallClimbing
(int n)
99-answerKey/leetcode/70|Climbing-Stairs/Solution.java:61
↓ 1 callersMethodcallInsertion
()
99-answerKey/algorithms/sorting/comparison-based/test/callSort.java:36
↓ 1 callersMethodcallMapMethods
()
99-answerKey/utils/studyGuide1.java:42
↓ 1 callersMethodcallSelection
()
99-answerKey/algorithms/sorting/comparison-based/test/callSort.java:48
↓ 1 callersMethodcallStringManMethods
()
99-answerKey/utils/studyGuide1.java:107
↓ 1 callersMethodchangeOne
(String one, String two)
0-Refresher/CTCI/ch1-arrays-and-strings/5-one_away/Solution.java:20
↓ 1 callersMethodcheckBalance
(Node nLeft, Node nRight)
99-answerKey/CTCI/Ch4-Trees&Graphs/4-SubtreeHeights/Solution.java:15
↓ 1 callersMethodcheckBox
(char[][] board)
99-answerKey/leetcode/36|Valid-Sudoku/Solution.java:48
↓ 1 callersMethodcheckValid
(int col, Stack<Integer> rowCol)
99-answerKey/genericFrequent/nQueens/NQueens.java:66
↓ 1 callersMethodcheckit
(Node head)
0-Refresher/CTCI/ch2-Linked_list/1-remove_dups/Solution.java:35
↓ 1 callersMethodclearCols
(int col, int[][] arr)
0-Refresher/CTCI/ch1-arrays-and-strings/8-zeroMatrix/Solution.java:38
↓ 1 callersMethodclearRows
(int row, int[][] arr)
0-Refresher/CTCI/ch1-arrays-and-strings/8-zeroMatrix/Solution.java:31
↓ 1 callersMethodclearRowsCols
(int row, int col, int[][] arr)
0-Refresher/CTCI/ch1-arrays-and-strings/8-zeroMatrix/Solution.java:6
← previousnext →101–200 of 934, ranked by callers