MCPcopy Create free account

hub / github.com/ani03sha/RedQuarkTutorials / functions

Functions377 in github.com/ani03sha/RedQuarkTutorials

⨍ Functions 377◇ Types & classes 100
↓ 3 callersFunctionletterCombinations
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/LetterCombinationsOfAPhoneNumber.kt:3
↓ 3 callersMethodletterCombinations
(String digits)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/LetterCombinationsOfAPhoneNumber.java:11
↓ 3 callersFunctionlongestCommonPrefix
(strs: List[str])
LeetCode/Python/src/Longest_Common_Prefix.py:7
↓ 3 callersFunctionlongestValidParentheses
(s)
LeetCode/JavaScript/src/longest_valid_parentheses.js:12
↓ 3 callersFunctionlongestValidParentheses
(s: str)
LeetCode/Python/src/Longest_Valid_Parentheses.py:14
↓ 3 callersFunctionlongestValidParentheses
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/LongestValidParentheses.kt:3
↓ 3 callersMethodlongestValidParentheses
@param s - string containing '(' and ')' @return length of the longest valid parentheses
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/LongestValidParentheses.java:20
↓ 3 callersFunctionmergeTwoLists
(l1, l2)
LeetCode/JavaScript/src/merge_two_sorted_lists.js:1
↓ 3 callersFunctionmergeTwoLists
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/MergeTwoSortedLists.kt:3
↓ 3 callersMethodmergeTwoLists
(ListNode l1, ListNode l2)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MergeTwoSortedLists.java:8
↓ 3 callersFunctionprintList
(node)
LeetCode/JavaScript/src/swap_nodes_in_pairs.js:31
↓ 3 callersFunctionprintList
(node)
LeetCode/JavaScript/src/remove_nth_node_from_end_of_list.js:34
↓ 3 callersFunctionprintList
(node)
LeetCode/JavaScript/src/merge_two_sorted_lists.js:48
↓ 3 callersFunctionprintList
(node: ListNode)
LeetCode/Python/src/Remove_Nth_Node_From_End_Of_List.py:12
↓ 3 callersFunctionprintList
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/RemoveNthNodeFromEndOfList.kt:32
↓ 3 callersFunctionprintList
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/MergeTwoSortedLists.kt:66
↓ 3 callersMethodprintList
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/SwapNodesInPairs.kt:30
↓ 3 callersMethodprintList
(ListNode mergedList)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MergeTwoSortedLists.java:69
↓ 3 callersMethodprintList
(ListNode head)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/SwapNodesInPairs.java:33
↓ 3 callersFunctionremoveNthFromEnd
(head, n)
LeetCode/JavaScript/src/remove_nth_node_from_end_of_list.js:1
↓ 3 callersFunctionremoveNthFromEnd
(head: ListNode, n: int)
LeetCode/Python/src/Remove_Nth_Node_From_End_Of_List.py:19
↓ 3 callersFunctionremoveNthFromEnd
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/RemoveNthNodeFromEndOfList.kt:3
↓ 3 callersMethodremoveNthFromEnd
(ListNode head, int n)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/RemoveNthNodeFromEndOfList.java:8
↓ 3 callersFunctionreverse
(x)
LeetCode/JavaScript/src/reverse_integer.js:4
↓ 3 callersFunctionreverse
(x: int)
LeetCode/Python/src/Reverse_Integer.py:7
↓ 3 callersMethodrotate
(int N, int D)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/RotateBits.java:14
↓ 3 callersFunctionsearch
(nums, target)
LeetCode/JavaScript/src/search_in_rotated_sorted_array.js:4
↓ 3 callersFunctionsearch
(nums: List[int], target: int)
LeetCode/Python/src/Search_In_Rotated_Sorted_Array.py:7
↓ 3 callersFunctionsearch
* @author Anirudh Sharma */
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/SearchInRotatedSortedArray.kt:6
↓ 3 callersMethodsearch
(int[] nums, int target)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/SearchInRotatedSortedArray.java:8
↓ 3 callersFunctionswapPairs
(head)
LeetCode/JavaScript/src/swap_nodes_in_pairs.js:1
↓ 3 callersMethodswapPairs
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/SwapNodesInPairs.kt:5
↓ 3 callersMethodswapPairs
(ListNode head)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/SwapNodesInPairs.java:8
↓ 3 callersFunctionthreeSum
(nums: List[int])
LeetCode/Python/src/Three_Sum.py:7
↓ 3 callersFunctionthreeSum
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/ThreeSum.kt:7
↓ 3 callersMethodthreeSum
(int[] nums)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/ThreeSum.java:12
↓ 3 callersMethodtoggleBits
(int N, int L, int R)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/ToggleBitsInRange.java:13
↓ 2 callersMethodconvert
(String s, int numRows)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/ZigZagConversion.java:8
↓ 2 callersMethodcount
(int n)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/CountTotalSetBits.java:8
↓ 2 callersMethodcountBitsFlip
(int a, int b)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/BitDifference.java:8
↓ 2 callersFunctionfindIndices
* @author Anirudh Sharma * * We are given two strings "text" and "pattern" of size n and m respectively where m < n. * Find all the indices in text
ConceptOfTheDay/Kotlin/src/main/java/org/redquark/conceptoftheday/AnagramSubstringSearch.kt:9
↓ 2 callersMethodfindIndices
(String text, String pattern)
ConceptOfTheDay/Java/src/main/java/org/redquark/conceptoftheday/AnagramSubstringSearch.java:14
↓ 2 callersMethodfindSingle
(int[] nums)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/SingleNumber.java:9
↓ 2 callersFunctionfind_indices
* @author Anirudh Sharna
ConceptOfTheDay/JavaScript/src/anagram_substring_search.js:4
↓ 2 callersFunctionfind_indices
(text, patten)
ConceptOfTheDay/Python/src/anagram_substring_search.py:13
↓ 2 callersMethodgenerate
(int[] S)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/GeneratePowerSet.java:8
↓ 2 callersMethodgetFirstSetBit
(int n)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/FindFirstSetBit.java:11
↓ 2 callersMethodhas
(K key)
Design/src/main/java/org/redquark/tutorials/design/caching/LRUCache.java:32
↓ 2 callersMethodinvalidate
()
Design/src/main/java/org/redquark/tutorials/design/caching/LFUCache.java:94
↓ 2 callersFunctionisCountEqual
(text_count, pattern_count)
ConceptOfTheDay/Python/src/anagram_substring_search.py:6
↓ 2 callersFunctionisCountEqual
ConceptOfTheDay/Kotlin/src/main/java/org/redquark/conceptoftheday/AnagramSubstringSearch.kt:42
↓ 2 callersMethodisCountEqual
(int[] textCount, int[] patternCount)
ConceptOfTheDay/Java/src/main/java/org/redquark/conceptoftheday/AnagramSubstringSearch.java:47
↓ 2 callersMethodisPowerOf4
(int n)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/PowerOf4And8.java:8
↓ 2 callersMethodisPowerOf8
(int n)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/PowerOf4And8.java:12
↓ 2 callersMethodisSparse
(int n)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/SparseNumber.java:9
↓ 2 callersFunctionlongestCommonPrefix
(strs)
LeetCode/JavaScript/src/longest_common_prefix.js:1
↓ 2 callersFunctionlongestCommonPrefix
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/LongestCommonPrefix.kt:3
↓ 2 callersMethodlongestCommonPrefix
@param strs - input array of strings @return longest common prefix
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/LongestCommonPrefix.java:12
↓ 2 callersMethodmaxConsecutiveOnes
(int N)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/LongestConsecutive1s.java:8
↓ 2 callersMethodmaximumSubsetXORValue
(int[] nums)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/MaximumSubsetXOR.java:9
↓ 2 callersFunctionmerge
(left, right)
LeetCode/JavaScript/src/merge_k_sorted_lists.js:24
↓ 2 callersMethodmoveToFront
(Entry<K, V> entry)
Design/src/main/java/org/redquark/tutorials/design/caching/LRUCache.java:111
↓ 2 callersMethodposOfRightMostDiffBit
(int m, int n)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/RightMostDifferentBit.java:8
↓ 2 callersMethodprintList
(self, head)
LeetCode/Python/src/Swap_Nodes_In_Pairs.py:36
↓ 2 callersFunctionremoveDuplicates
(nums)
LeetCode/JavaScript/src/remove_duplicates_from_sorted_array.js:1
↓ 2 callersMethodremoveDuplicates
(self, nums: List[int])
LeetCode/Python/src/Remove_Duplicates_From_Sorted_Array.py:8
↓ 2 callersMethodremoveDuplicates
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/RemoveDuplicatesFromSortedArray.kt:5
↓ 2 callersMethodremoveDuplicates
(int[] nums)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/RemoveDuplicatesFromSortedArray.java:5
↓ 2 callersFunctionremoveElement
(nums, val)
LeetCode/JavaScript/src/remove_element.js:1
↓ 2 callersMethodremoveElement
(nums: List[int], val: int)
LeetCode/Python/src/Remove_Element.py:9
↓ 2 callersMethodremoveElement
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/RemoveElement.kt:4
↓ 2 callersMethodremoveElement
(int[] nums, int val)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/RemoveElement.java:8
↓ 2 callersFunctionreverse
(nums, i, j)
LeetCode/JavaScript/src/next_permutation.js:51
↓ 2 callersFunctionreverse
(nums, i, j)
LeetCode/Python/src/Next_Permutation.py:15
↓ 2 callersMethodreverse
(int[] nums, int i, int j)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/NextPermutation.java:60
↓ 2 callersMethodreverse
(int n)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/ReverseBits.java:8
↓ 2 callersMethodsetKthBit
(int N, int K)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/SetKthBit.java:11
↓ 2 callersMethodswap
(int[] nums, int i, int index)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/NextPermutation.java:68
↓ 2 callersMethodswap
(int n)
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/SwapEvenOddBits.java:8
↓ 2 callersMethodswapPairs
(self, head: ListNode)
LeetCode/Python/src/Swap_Nodes_In_Pairs.py:13
↓ 2 callersFunctionthreeSum
(nums)
LeetCode/JavaScript/src/three_sum.js:1
↓ 2 callersFunctionthreeSumClosest
(nums, target)
LeetCode/JavaScript/src/three_sum_closest.js:1
↓ 2 callersFunctiontwoSum
(nums, target)
LeetCode/JavaScript/src/two_sum.js:5
↓ 2 callersFunctiontwoSum
(nums: List[int], target: int)
LeetCode/Python/src/Two_Sum.py:7
↓ 2 callersFunctiontwoSum
* @param nums - input array of numbers * @param target - the value of target * @return - array of indices of two numbers which will add up to targ
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/TwoSum.kt:8
↓ 2 callersMethodtwoSum
@param nums - input array of numbers @param target - the value of target @return - array of indices of two numbers which will add up to target
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/TwoSum.java:17
↓ 1 callersMethodaddNode
(Entry<K, V> entry)
Design/src/main/java/org/redquark/tutorials/design/caching/LRUCache.java:89
↓ 1 callersFunctionaddTwoNumbers
(l1, l2)
LeetCode/JavaScript/src/add_two_numbers.js:5
↓ 1 callersFunctionaddTwoNumbers
(l1: ListNode, l2: ListNode)
LeetCode/Python/src/Add_Two_Numbers.py:12
↓ 1 callersFunctionaddTwoNumbers
* @author Anirudh Sharma */
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/AddTwoNumbers.kt:6
↓ 1 callersMethodaddTwoNumbers
@param l1 - head of the first linked list @param l2 - head of the second linked list @return - head of the list with the sum
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/AddTwoNumbers.java:13
↓ 1 callersMethodevict
(K key)
Design/src/main/java/org/redquark/tutorials/design/caching/LFUCache.java:101
↓ 1 callersFunctionfindCombinations
(combinations, digits, previous, index, lettersAndNumbersMappings)
LeetCode/JavaScript/src/letter_combinations_of_a_phone_number.js:25
↓ 1 callersFunctionfindCombinations
(combinations, digits, previous, index, lettersAndNumbersMapping)
LeetCode/Python/src/Letter_Combinations_Of_A_Phone_Number.py:7
↓ 1 callersFunctionfindCombinations
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/LetterCombinationsOfAPhoneNumber.kt:27
↓ 1 callersMethodfindCombinations
(List<String> combinations, String digits, StringBuilder previous, int index, String[] lettersAndNumbersMappin
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/LetterCombinationsOfAPhoneNumber.java:35
↓ 1 callersFunctionfindFirstOccurrence
(nums, target)
LeetCode/JavaScript/src/find_first_and_last_position_of_element_in_sorted_array.js:8
↓ 1 callersFunctionfindFirstOccurrence
(nums, target)
LeetCode/Python/src/Find_First_And_Last_Position_Of_Element_In_Sorted_Array.py:7
↓ 1 callersFunctionfindFirstOccurrence
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/FindFirstAndLastPositionOfElementInSortedArray.kt:7
↓ 1 callersMethodfindFirstOccurrence
(int[] nums, int target)
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/FindFirstAndLastPositionOfElementInSortedArray.java:14
← previousnext →101–200 of 377, ranked by callers