MCPcopy Create free account

hub / github.com/ani03sha/RedQuarkTutorials / types & classes

Types & classes100 in github.com/ani03sha/RedQuarkTutorials

↓ 17 callersClassListNode
LeetCode/Python/src/Reverse_Nodes_In_K_Group.py:7
↓ 13 callersClassListNode21
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/MergeTwoSortedLists.kt:75
↓ 12 callersClassListNode
LeetCode/Python/src/Merge_Two_Sorted_Lists.py:6
↓ 9 callersClassListNode
LeetCode/Python/src/Merge_K_Sorted_Lists.py:7
↓ 8 callersClassListNode
LeetCode/Python/src/Add_Two_Numbers.py:6
↓ 8 callersClassListNode
LeetCode/Python/src/Remove_Nth_Node_From_End_Of_List.py:6
↓ 8 callersClassListNode
* This class represents each node in the linked list */
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/AddTwoNumbers.kt:71
↓ 8 callersClassListNode19
* This class represents each node in the linked list */
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/RemoveNthNodeFromEndOfList.kt:60
↓ 6 callersClassListNode
LeetCode/Python/src/Swap_Nodes_In_Pairs.py:6
↓ 1 callersClassDivideTwoIntegers
LeetCode/Python/src/Divide_Two_Integers.py:6
↓ 1 callersClassDivideTwoIntegers
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/DivideTwoIntegers.kt:3
↓ 1 callersClassImplementStrStr
LeetCode/Python/src/Implement_StrStr.py:6
↓ 1 callersClassImplementStrStr
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/ImplementStrStr.kt:3
↓ 1 callersClassListNode
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/SwapNodesInPairs.kt:39
↓ 1 callersClassListNode
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/MergeKSortedLists.kt:60
↓ 1 callersClassListNode
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/ReverseNodesInKGroup.kt:64
↓ 1 callersClassMergeKSortedList
LeetCode/Python/src/Merge_K_Sorted_Lists.py:13
↓ 1 callersClassMergeKSortedLists
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/MergeKSortedLists.kt:3
↓ 1 callersClassNextPermutation
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/NextPermutation.kt:3
↓ 1 callersClassRemoveDuplicatesFromSortedArray
LeetCode/Python/src/Remove_Duplicates_From_Sorted_Array.py:7
↓ 1 callersClassRemoveDuplicatesFromSortedArray
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/RemoveDuplicatesFromSortedArray.kt:3
↓ 1 callersClassRemoveElement
LeetCode/Python/src/Remove_Element.py:7
↓ 1 callersClassRemoveElement
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/RemoveElement.kt:3
↓ 1 callersClassReverseNodesInKGroup
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/ReverseNodesInKGroup.kt:3
↓ 1 callersClassReverseNodesInKGroups
LeetCode/Python/src/Reverse_Nodes_In_K_Group.py:13
↓ 1 callersClassSubstringWithConcatenationOfAllWords
LeetCode/Python/src/Substring_With_Concatenation_Of_All_Words.py:7
↓ 1 callersClassSubstringWithConcatenationOfAllWords
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/SubstringWithConcatenationOfAllWords.kt:4
↓ 1 callersClassSwapNodesInPairs
LeetCode/Python/src/Swap_Nodes_In_Pairs.py:12
↓ 1 callersClassSwapNodesInPairs
LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/SwapNodesInPairs.kt:3
Class
LeetCode/JavaScript/src/add_two_numbers.js:49
ClassAddTwoNumbers
@author Anirudh
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/AddTwoNumbers.java:6
ClassAnagramSubstringSearch
@author Anirudh Sharma <p> We are given two strings "text" and "pattern" of size n and m respectively where m < n. Find all the indices in text where
ConceptOfTheDay/Java/src/main/java/org/redquark/conceptoftheday/AnagramSubstringSearch.java:12
ClassBitDifference
You are given two numbers A and B, count the number of bits needed to be flipped to convert A to B.
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/BitDifference.java:6
ClassCheckEvenOrOdd
Check if a given integer n is even or odd.
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/CheckEvenOrOdd.java:6
ClassCheckKthBit
Given a number n and a bit number k, check if kth bit of n is set or not. A bit is called set if it is 1. Position of set bit '1' should be indexed st
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/CheckKthBit.java:7
ClassCheckOppositeSign
Given two integers a and b, check if they have opposite signs
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/CheckOppositeSign.java:6
ClassContainerWithMostWater
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/ContainerWithMostWater.java:6
ClassCountSetBitsInANumber
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/CountSetBitsInANumber.java:3
ClassCountTotalSetBits
Given a number n, find the total count of set bits for all numbers from 1 to N(both inclusive).
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/CountTotalSetBits.java:6
ClassDivideTwoIntegers
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/DivideTwoIntegers.java:6
ClassEntry
This class represents one element in the cache
Design/src/main/java/org/redquark/tutorials/design/caching/LRUCache.java:126
ClassFindFirstAndLastPositionOfElementInSortedArray
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/FindFirstAndLastPositionOfElementInSortedArray.java:8
ClassFindFirstSetBit
Given an integer an N. The task is to return the position of first set bit found from the right side in the binary representation of the number. <p> N
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/FindFirstSetBit.java:9
ClassFourSum
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/FourSum.java:10
ClassGenerateParentheses
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/GenerateParentheses.java:9
ClassGeneratePowerSet
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/GeneratePowerSet.java:6
ClassImplementStrStr
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/ImplementStrStr.java:6
ClassIntegerToRoman
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/IntegerToRoman.java:6
ClassKadaneAlgorithm
@author Anirudh Sharma
ConceptOfTheDay/Java/src/main/java/org/redquark/conceptoftheday/KadaneAlgorithm.java:6
ClassKnapsack
@author Anirudh Sharma
ConceptOfTheDay/Java/src/main/java/org/redquark/conceptoftheday/Knapsack.java:6
ClassLFUCache
This class implements the least frequently used cache
Design/src/main/java/org/redquark/tutorials/design/caching/LFUCache.java:11
ClassLFUCacheTest
Design/src/test/java/org/redquark/tutorials/design/caching/LFUCacheTest.java:12
ClassLRUCache
This class represents the LRU cache implementation
Design/src/main/java/org/redquark/tutorials/design/caching/LRUCache.java:9
ClassLRUCacheTest
Design/src/test/java/org/redquark/tutorials/design/caching/LRUCacheTest.java:11
ClassLetterCombinationsOfAPhoneNumber
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/LetterCombinationsOfAPhoneNumber.java:9
ClassListNode
LeetCode/JavaScript/src/add_two_numbers.js:49
ClassListNode
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MergeTwoSortedLists.java:77
ClassListNode
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/ReverseNodesInKGroup.java:93
ClassListNode
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/RemoveNthNodeFromEndOfList.java:60
ClassListNode
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/SwapNodesInPairs.java:55
ClassListNode
This class represents each node in the linked list
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/AddTwoNumbers.java:61
ClassListNode
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MergeKSortedLists.java:82
ClassLongestCommonPrefix
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/LongestCommonPrefix.java:6
ClassLongestConsecutive1s
Given a number n, ind the length of the longest consecutive 1s in its binary representation.
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/LongestConsecutive1s.java:6
ClassLongestPalindromicSubstring
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/LongestPalindromicSubstring.java:6
ClassLongestSubstringWithoutRepeatingCharacters
@author Anirudh Sharma <p> Given a string s, find the length of the longest substring without repeating characters.
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/LongestSubstringWithoutRepeatingCharacters.java:11
ClassLongestValidParentheses
@author Anirudh Sharma <p> Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses s
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/LongestValidParentheses.java:14
ClassMaximumSubsetXOR
Given an array nums[] of n positive integers, find an integer denoting the maximum XOR subset value in the given array nums[].
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/MaximumSubsetXOR.java:7
ClassMaximumSumOfKElements
@author Anirudh Sharma <p> Find maximum sum of k consecutive elements in the array
ConceptOfTheDay/Java/src/main/java/org/redquark/conceptoftheday/MaximumSumOfKElements.java:8
ClassMedianOfTwoSortedArrays
@author Anirudh Sharma <p> Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. <p> Follo
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MedianOfTwoSortedArrays.java:20
ClassMergeKSortedLists
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MergeKSortedLists.java:6
ClassMergeTwoSortedLists
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MergeTwoSortedLists.java:6
ClassNextPermutation
@author Anirudh Sharma <p> Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. <p> If
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/NextPermutation.java:21
ClassPalindromeNumber
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/PalindromeNumber.java:6
ClassPowerOf4And8
Given an integer, check if it is a power of 4 and 8 or not
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/PowerOf4And8.java:6
ClassPowerOfTwo
Given a non-negative integer N. The task is to check if N is a power of 2. More formally, check if N can be expressed as 2x for some x.
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/PowerOfTwo.java:7
ClassRegularExpressionMatching
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/RegularExpressionMatching.java:6
ClassRemoveDuplicatesFromSortedArray
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/RemoveDuplicatesFromSortedArray.java:3
ClassRemoveElement
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/RemoveElement.java:6
ClassRemoveNthNodeFromEndOfList
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/RemoveNthNodeFromEndOfList.java:6
ClassReverseBits
Give an integer, reverse its bits. For e.g., if the input is 10011, then the output should be 11001.
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/ReverseBits.java:6
ClassReverseInteger
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/ReverseInteger.java:6
ClassReverseNodesInKGroup
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/ReverseNodesInKGroup.java:6
ClassRightMostDifferentBit
Given two numbers M and N, find the position of the rightmost different bit in the binary representation of numbers.
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/RightMostDifferentBit.java:6
ClassRomanToInteger
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/RomanToInteger.java:9
ClassRotateBits
@author Anirudh Sharma <p> Given an integer N and an integer D, rotate the binary representation of the integer N by D digits to the left as well as r
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/RotateBits.java:12
ClassSearchInRotatedSortedArray
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/SearchInRotatedSortedArray.java:6
ClassSetKthBit
@author Anirudh Sharma <p> Given a number N and a value K. From the right, set the Kth bit in the binary representation of N. The position of Least Si
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/SetKthBit.java:9
ClassSingleNumber
At a party of N people, each person is denoted by an integer. Couples are represented by the same number. Find out the only singe person in the party
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/SingleNumber.java:7
ClassSparseNumber
Given a number N, check whether it is sparse or not. A number is said to be a sparse number if no two or more consecutive bits are set in the binary r
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/SparseNumber.java:7
ClassStringToInteger
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/StringToInteger.java:6
ClassSubstringWithConcatenationOfAllWords
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/SubstringWithConcatenationOfAllWords.java:11
ClassSwapEvenOddBits
Given an unsigned integer n, swap all odd bits with even bits.
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/SwapEvenOddBits.java:6
ClassSwapNodesInPairs
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/SwapNodesInPairs.java:6
ClassThreeSum
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/ThreeSum.java:10
ClassThreeSumClosest
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/ThreeSumClosest.java:8
ClassToggleBitsInRange
@author Anirudh Sharma <p> Given a non-negative number N and two values L and R, toggle the bits in the range L to R in the binary representation of N
ProblemSolving/src/main/java/org/redquark/tutorials/problemsolving/bitmagic/ToggleBitsInRange.java:11
ClassTwoSum
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/TwoSum.java:10
ClassValidParentheses
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/ValidParentheses.java:8
ClassZigZagConversion
@author Anirudh Sharma
LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/ZigZagConversion.java:6