MCPcopy Create free account

hub / github.com/Top4IkRu/java-interview / functions

Functions430 in github.com/Top4IkRu/java-interview

⨍ Functions 430◇ Types & classes 165
MethodfindMedianSortedArrays
(int[] nums1, int[] nums2)
algorithms/src/main/java/solution/binary_search/hard/MedianOfTwoSortedArrays.java:9
MethodfindMin
(int[] nums)
algorithms/src/main/java/solution/binary_search/medium/FindMinimumInRotatedSortedArray.java:8
MethodfindPairWithSum
Space - O(1) Time - O(n)
algorithms/src/main/java/solution/arrays/easy/TwoSum.java:32
MethodgenerateParenthesis
(int n)
algorithms/src/main/java/solution/stack/medium/GenerateParentheses.java:11
MethodgetIntersectionNode
(ListNode headA, ListNode headB)
algorithms/src/main/java/solution/linked_list/easy/IntersectionOfTwoLinkedLists.java:14
MethodgetIntersectionNode_2
With extra space
algorithms/src/main/java/solution/linked_list/easy/IntersectionOfTwoLinkedLists.java:29
MethodgetMin
()
algorithms/src/main/java/solution/stack/medium/MinStack.java:35
MethodgroupAnagrams
(String[] strs)
algorithms/src/main/java/solution/arrays/medium/GroupAnagrams.java:10
MethodhasCycle
(ListNode head)
algorithms/src/main/java/solution/linked_list/easy/LinkedListCycle.java:10
MethodinvertTree
(TreeNode root)
algorithms/src/main/java/solution/tree/easy/InvertBinaryTree.java:10
MethodisAnagram
Space - O(1) Time - O(n)
algorithms/src/main/java/solution/arrays/easy/ValidAnagram.java:12
MethodisBalanced
(TreeNode root)
algorithms/src/main/java/solution/tree/easy/BalancedBinaryTree.java:13
MethodisPalindrome
With two pointers
algorithms/src/main/java/solution/linked_list/easy/PalindromeLinkedList.java:13
MethodisPalindrome_1
(String s)
algorithms/src/main/java/solution/two_pointers/easy/ValidPalindrome.java:8
MethodisPalindrome_2
With extra memory
algorithms/src/main/java/solution/linked_list/easy/PalindromeLinkedList.java:51
MethodisPalindrome_2
(String s)
algorithms/src/main/java/solution/two_pointers/easy/ValidPalindrome.java:21
MethodisSameTree
(TreeNode p, TreeNode q)
algorithms/src/main/java/solution/tree/easy/SameTree.java:9
MethodisSubtree
(TreeNode root, TreeNode subRoot)
algorithms/src/main/java/solution/tree/easy/SubtreeOfAnotherTree.java:9
MethodisValid
(String s)
algorithms/src/main/java/solution/stack/easy/ValidParentheses.java:9
Methodjump
(int[] nums)
algorithms/src/main/java/solution/greedy/medium/JumpGame2.java:8
MethodkClosest
(int[][] points, int k)
algorithms/src/main/java/solution/heap/medium/KClosestPointsToOrigin.java:13
MethodlastStoneWeight
(int[] stones)
algorithms/src/main/java/solution/heap/easy/LastStoneWeight.java:12
MethodleastInterval
(char[] tasks, int n)
algorithms/src/main/java/solution/heap/medium/TaskScheduler.java:11
MethodlengthOfLongestSubstring
Основная идея: Мы должны итерироваться по строке и добавлять символы во множество (set), если они отсутствуют в нем. Если символ уже присутствует во м
algorithms/src/main/java/solution/sliding_window/medium/LongestSubstringWithoutRepeatingCharacters.java:22
MethodlevelOrder
Основаная идея: запомнить размер текущего уровня дерева (levelSize) и последовательно обработать все узлы этого уровня. После этого перейти к следующе
algorithms/src/main/java/solution/tree/medium/BinaryTreeLevelOrderTraversal.java:19
MethodlongTransaction
()
interview-questions/src/main/java/spring/TransactionService.java:34
MethodlowestCommonAncestor
<a href="https://en.wikipedia.org/wiki/Lowest_common_ancestor">LCA Wiki</a> <p> The lowest common ancestor is defined between two nodes p and q as the
algorithms/src/main/java/solution/tree/medium/LowestCommonAncestorOfABinarySearchTree.java:18
Methodmain
(String[] args)
algorithms/src/main/java/Task466A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Hello2024_Task3.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task514A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task5C.java:50
Methodmain
(String[] args)
algorithms/src/main/java/Task1A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task158B.java:50
Methodmain
(String[] args)
algorithms/src/main/java/Task492B.java:50
Methodmain
(String[] args)
algorithms/src/main/java/Task327A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Stub.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Round_919_Task4.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Round_919_Task1.java:51
Methodmain
(String[] args)
algorithms/src/main/java/Task1342A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task580C.java:50
Methodmain
(String[] args)
algorithms/src/main/java/Task1343C.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task1352C.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task363B.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Hello2024_Task1.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task25A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task500A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task455A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task122A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task230B.java:51
Methodmain
(String[] args)
algorithms/src/main/java/Task20C.java:67
Methodmain
(String[] args)
algorithms/src/main/java/Task489B.java:50
Methodmain
(String[] args)
algorithms/src/main/java/Task279B.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Hello2024_Task2.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task71A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task478B.java:50
Methodmain
(String[] args)
algorithms/src/main/java/Task118A.java:54
Methodmain
(String[] args)
algorithms/src/main/java/Task479A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Round_919_Task2.java:50
Methodmain
(String[] args)
algorithms/src/main/java/Task4A.java:52
Methodmain
(String[] args)
algorithms/src/main/java/Task58A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task230A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task489C.java:49
Methodmain
(String[] args)
algorithms/src/main/java/InteractiveTask1.java:52
Methodmain
(String[] args)
algorithms/src/main/java/Hello2024_Task4.java:81
Methodmain
(String[] args)
algorithms/src/main/java/Task379A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task4C.java:51
Methodmain
(String[] args)
algorithms/src/main/java/Task742A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task1328C.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task433B.java:50
Methodmain
(String[] args)
algorithms/src/main/java/Task189A.java:49
Methodmain
(String[] args)
algorithms/src/main/java/Task520B.java:49
Methodmain
(String[] args)
algorithms/src/main/java/solution/two_pointers/medium/RotateArray.java:8
Methodmain
(String[] args)
interview-questions/src/main/java/concurrency/Volatile.java:25
MethodmaxArea
(int[] height)
algorithms/src/main/java/solution/two_pointers/medium/ContainerWithMostWater.java:8
MethodmaxDepth
(TreeNode root)
algorithms/src/main/java/solution/tree/easy/MaximumDepthOfBinaryTree.java:10
MethodmaxProfit
(int[] prices)
algorithms/src/main/java/solution/sliding_window/easy/BestTimeToBuyAndSellStock.java:8
MethodmaxSubArray
(int[] nums)
algorithms/src/main/java/solution/greedy/medium/MaximumSubarray.java:8
MethodmergeTwoLists_1
(ListNode list1, ListNode list2)
algorithms/src/main/java/solution/linked_list/easy/MergeTwoSortedLists.java:10
MethodmergeTwoLists_2
Recursion
algorithms/src/main/java/solution/linked_list/easy/MergeTwoSortedLists.java:41
MethodminEatingSpeed
(int[] piles, int h)
algorithms/src/main/java/solution/binary_search/medium/KokoEatingBananas.java:9
MethodminimumDifference
(int[] nums, int k)
algorithms/src/main/java/solution/two_pointers/easy/MinimumDifferenceBetweenHighestAndLowestOfKScores.java:10
MethodnextDouble
()
algorithms/src/main/java/Task466A.java:34
MethodnextDouble
()
algorithms/src/main/java/Hello2024_Task3.java:34
MethodnextDouble
()
algorithms/src/main/java/Task514A.java:34
MethodnextDouble
()
algorithms/src/main/java/Task5C.java:35
MethodnextDouble
()
algorithms/src/main/java/Task1A.java:34
MethodnextDouble
()
algorithms/src/main/java/Task158B.java:35
MethodnextDouble
()
algorithms/src/main/java/Task492B.java:35
MethodnextDouble
()
algorithms/src/main/java/Task327A.java:34
MethodnextDouble
()
algorithms/src/main/java/Stub.java:34
MethodnextDouble
()
algorithms/src/main/java/Round_919_Task4.java:34
MethodnextDouble
()
algorithms/src/main/java/Round_919_Task1.java:36
MethodnextDouble
()
algorithms/src/main/java/Task1342A.java:34
MethodnextDouble
()
algorithms/src/main/java/Task580C.java:35
MethodnextDouble
()
algorithms/src/main/java/Task1343C.java:34
MethodnextDouble
()
algorithms/src/main/java/Task1352C.java:34
MethodnextDouble
()
algorithms/src/main/java/Task363B.java:34
MethodnextDouble
()
algorithms/src/main/java/Hello2024_Task1.java:34
MethodnextDouble
()
algorithms/src/main/java/Task25A.java:34
MethodnextDouble
()
algorithms/src/main/java/Task500A.java:34
← previousnext →201–300 of 430, ranked by callers