Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Top4IkRu/java-interview
/ functions
Functions
430 in github.com/Top4IkRu/java-interview
⨍
Functions
430
◇
Types & classes
165
↓ 40 callers
Method
add
(int val)
algorithms/src/main/java/solution/heap/easy/KthLargestElementInAStream.java:25
↓ 15 callers
Method
pop
()
algorithms/src/main/java/solution/stack/medium/MinStack.java:24
↓ 13 callers
Method
get
Get the value of the index-th node in the linked list. If the index is invalid, return -1.
algorithms/src/main/java/solution/linked_list/medium/DesignLinkedList.java:37
↓ 9 callers
Method
push
(int val)
algorithms/src/main/java/solution/stack/medium/MinStack.java:16
↓ 5 callers
Method
nextInt
()
algorithms/src/main/java/Task1342A.java:26
↓ 5 callers
Method
nextInt
()
algorithms/src/main/java/Task580C.java:27
↓ 5 callers
Method
nextInt
()
algorithms/src/main/java/Round_919_Task2.java:27
↓ 5 callers
Method
nextInt
()
algorithms/src/main/java/Task433B.java:27
↓ 4 callers
Method
get
(String key, int timestamp)
algorithms/src/main/java/solution/binary_search/medium/TimeBasedKeyValueStore.java:27
↓ 4 callers
Method
nextInt
()
algorithms/src/main/java/Task466A.java:26
↓ 4 callers
Method
nextInt
()
algorithms/src/main/java/Round_919_Task1.java:28
↓ 4 callers
Method
nextInt
()
algorithms/src/main/java/Task20C.java:26
↓ 4 callers
Method
nextInt
()
algorithms/src/main/java/Task489B.java:27
↓ 4 callers
Method
nextInt
()
algorithms/src/main/java/Task230A.java:26
↓ 4 callers
Method
nextInt
()
algorithms/src/main/java/Task189A.java:26
↓ 3 callers
Method
doTheWorkInParallel
( int repeatTime, int numberOfThreads, Consumer<Integer> action )
interview-questions/src/main/java/concurrency/Volatile.java:41
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task466A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Hello2024_Task3.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task514A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task5C.java:16
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task1A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task158B.java:16
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task492B.java:16
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task327A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Stub.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Round_919_Task4.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Round_919_Task1.java:17
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task1342A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task580C.java:16
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task1343C.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task1352C.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task363B.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Hello2024_Task1.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task25A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task500A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task455A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task122A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task230B.java:17
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task20C.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task489B.java:16
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task279B.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Hello2024_Task2.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task71A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task478B.java:16
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task118A.java:20
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task479A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Round_919_Task2.java:16
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task4A.java:18
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task58A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task230A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task489C.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/InteractiveTask1.java:18
↓ 3 callers
Method
next
()
algorithms/src/main/java/Hello2024_Task4.java:16
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task379A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task4C.java:17
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task742A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task1328C.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task433B.java:16
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task189A.java:15
↓ 3 callers
Method
next
()
algorithms/src/main/java/Task520B.java:15
↓ 3 callers
Method
nextInt
()
algorithms/src/main/java/Hello2024_Task3.java:26
↓ 3 callers
Method
nextInt
()
algorithms/src/main/java/Task1A.java:26
↓ 3 callers
Method
nextInt
()
algorithms/src/main/java/Task492B.java:27
↓ 3 callers
Method
nextInt
()
algorithms/src/main/java/Task1343C.java:26
↓ 3 callers
Method
nextInt
()
algorithms/src/main/java/Task363B.java:26
↓ 3 callers
Method
nextInt
()
algorithms/src/main/java/Hello2024_Task1.java:26
↓ 3 callers
Method
nextInt
()
algorithms/src/main/java/Task500A.java:26
↓ 3 callers
Method
nextInt
()
algorithms/src/main/java/Task479A.java:26
↓ 3 callers
Method
nextInt
()
algorithms/src/main/java/Hello2024_Task4.java:27
↓ 3 callers
Method
reverse
(int[] nums, int l, int r)
algorithms/src/main/java/solution/two_pointers/medium/RotateArray.java:35
↓ 2 callers
Method
internalTransaction
()
interview-questions/src/main/java/spring/TransactionService.java:29
↓ 2 callers
Method
nextInt
()
algorithms/src/main/java/Task158B.java:27
↓ 2 callers
Method
nextInt
()
algorithms/src/main/java/Task327A.java:26
↓ 2 callers
Method
nextInt
()
algorithms/src/main/java/Task25A.java:26
↓ 2 callers
Method
nextInt
()
algorithms/src/main/java/Task455A.java:26
↓ 2 callers
Method
nextInt
()
algorithms/src/main/java/Task279B.java:26
↓ 2 callers
Method
nextInt
()
algorithms/src/main/java/Hello2024_Task2.java:26
↓ 2 callers
Method
nextInt
()
algorithms/src/main/java/Task478B.java:27
↓ 2 callers
Method
nextInt
()
algorithms/src/main/java/Task489C.java:26
↓ 2 callers
Method
nextInt
()
algorithms/src/main/java/Task379A.java:26
↓ 2 callers
Method
nextInt
()
algorithms/src/main/java/Task1328C.java:26
↓ 2 callers
Method
nextInt
()
algorithms/src/main/java/Task520B.java:26
↓ 2 callers
Method
nextLong
()
algorithms/src/main/java/Task1352C.java:30
↓ 2 callers
Method
setPrev
(Element prev)
algorithms/src/main/java/Hello2024_Task4.java:66
↓ 1 callers
Method
addAtHead
Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list.
algorithms/src/main/java/solution/linked_list/medium/DesignLinkedList.java:52
↓ 1 callers
Method
addAtTail
Append a node of value val to the last element of the linked list.
algorithms/src/main/java/solution/linked_list/medium/DesignLinkedList.java:66
↓ 1 callers
Method
binarySearch
(int[] nums, int t, int l, int r)
algorithms/src/main/java/solution/binary_search/easy/BinarySearch.java:15
↓ 1 callers
Method
calcSet
()
algorithms/src/main/java/Task230B.java:65
↓ 1 callers
Method
calcTime
(int[] piles, int k)
algorithms/src/main/java/solution/binary_search/medium/KokoEatingBananas.java:25
↓ 1 callers
Method
calculate
(TreeNode root)
algorithms/src/main/java/solution/tree/easy/DiameterOfBinaryTree.java:17
↓ 1 callers
Method
dijkstra
(int start, int end)
algorithms/src/main/java/Task20C.java:112
↓ 1 callers
Method
getDepth
A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than one.
algorithms/src/main/java/solution/tree/easy/BalancedBinaryTree.java:22
↓ 1 callers
Method
getMid
Find middle with usage slow and fast pointers
algorithms/src/main/java/solution/linked_list/medium/SortList.java:35
↓ 1 callers
Method
invertTreeNode
(TreeNode node)
algorithms/src/main/java/solution/tree/easy/InvertBinaryTree.java:15
↓ 1 callers
Method
isSame
(TreeNode rootNode, TreeNode subRootNode)
algorithms/src/main/java/solution/tree/easy/SubtreeOfAnotherTree.java:15
↓ 1 callers
Method
markBadPositions
Если элемент повторяется больше 2х раз, то заменяем его на Integer.MIN_VALUE
algorithms/src/main/java/solution/two_pointers/medium/RemoveDuplicatesFromSortedArray2.java:22
↓ 1 callers
Method
merge
(ListNode left, ListNode right)
algorithms/src/main/java/solution/linked_list/medium/SortList.java:44
↓ 1 callers
Method
nextInt
()
algorithms/src/main/java/Task1352C.java:26
↓ 1 callers
Method
nextInt
()
algorithms/src/main/java/Task122A.java:26
↓ 1 callers
Method
nextInt
()
algorithms/src/main/java/Task230B.java:28
next →
1–100 of 430, ranked by callers