Types & classes — github.com/Tiwarishashwat/InterviewCodes

CodeHub MCPcopy Create free account

hub / github.com/Tiwarishashwat/InterviewCodes / types & classes

Types & classes302 in github.com/Tiwarishashwat/InterviewCodes

⨍ Functions 483◇ Types & classes 302

AllOoneDataStructure.java:13

ClassCommonMatrixElements

CommonMatrixElements.java:2

SearchingInArrayWhereElementsDifferByK.java:1

MinimumSwapsAndKTogether.java:1

MinMaxArray.java:15

ArraySubset.java:1

ClassCustomStack

DesignAStackWithIncrements.java:1

MinimumCostWalkInWeightedGraph.java:1

CountTheNumberOfCompleteComponents.java:27

ClassDisjointSet

SatisfiabilityOfEqualityEquations.java:28

ClassDisjointSet

NumberOfOperationsToMakeNetworkConnected.java:22

ClassDisjointSet

KruskalsAlgorithm.java:32

ClassDisjointSet

RedundantConnection.java:17

ClassDuplicateCount

DuplicateCount.java:2

ClassFindElements

Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode() {} TreeNode(int val)

FindElementsInAContaminatedBinaryTree.java:16

ClassFirstThreeLargest

FirstThreeLargest.java:1

ClassKthLargest

KthLargestElementInAStream.java:1

RearrangeArrayInAlternatingPositions.java:1

PrintNumPadPermutation.java:2

StringRotations.java:1

FirstRepeatedWords.java:2

CommonMatrixElements.java:48

MergeSort.java:1

ClassMyCalendar

myCalendar1.java:1

ClassMyCalendarTwo

MyCallendar2.java:2

ClassMyCircularDeque

DesignCircularDeque.java:1

ClassNextGreaterNumberWithSameDigitSum

NextGreaterNumberWithSameDigitSum.java:2

sumOfPrefixScoresOfStrings.java:30

TreeRepBinary.java:10

AllOoneDataStructure.java:1

ClassNumberContainers

DesignANumberContainerSystem.java:2

LongestHappyString.java:46

TreeTopView.java:1

TreeBottomView.java:1

ClassProductOfNumbers

ProductOfTheLastKNumbers.java:1

RabinKarp.java:2

CountTheReversals.java:1

FindMinimumInRotatedSortedArray.java:1

WordsSubsets.java:1

TreeInorder.java:1

TreeInOrderIterative.java:1

RegionsCutBySlashes.java:1

courseSchedule4.java:1

SmallestRangeCoveringElementsFromKLists.java:1

RemoveAllOccurrencesOfASubstring.java:1

MakeTwoArraysEqualbyReversingSubarrays.java:5

PermutationInString.java:2

CountTheNumberOfConsistentStrings.java:1

SquareRootUsingBinarySearch.java:1

ReverseString.java:1

TreePreOrderIterative.java:1

SplitArrayLargestSum.java:1

FindtheDuplicateNumber.java:1

gridGame.java:1

MinimumAddToMakeParenthesisValid.java:1

BestTimeToBuyAndSell3.java:1

TreeLevelOrder.java:1

countingWordsWithAGivenString.java:1

RangeSumOfSortedSubarraySums.java:1

SentenceToNumberPadSequence.java:1

SubarraySumEqualsK.java:1

FindEventualSafeStates.java:1

minimumAdjacentSwapsForBalanceBrackets.java:2

RowWithMax1s.java:2

DeleteNodesFromLinkedListPresentInArray.java:1

Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode() {} TreeNode(int val)

NumberOfGoodLeafNodes.java:31

SentenceSimilarityIII.java:1

StringTransformationByInsertingAtFront.java:1

CountandSay.java:2

RotateMatrix90Degree.java:1

MagicSquaresInGrid.java:1

NumberOfSubarraysWithOddSum.java:1

MinAddToMakeStringValid.java:2

largestLocal.java:3

SatisfiabilityOfEqualityEquations.java:1

ArrayPeak.java:1

ValueEqualToIndexValue.java:1

NumberOfOperationsToMakeNetworkConnected.java:1

MinimumLengthofStringAfterOperations.java:1

MinimumBitFlipsToConvertNumber.java:1

UniqueLength3PalindromicSubsequence.java:2

minimumTimeDifference.java:1

SortThePeople.java:1

JewelsAndStones.java:1

NumberOfWaysToSplitArray.java:2

NetworkDelayTime.java:1

checkIfParenthesisStringCanBeValid.java:1

minimumCostToConvertString1.java:1

MiddleOfThree.java:1

CountAndSay.java:1

KruskalsAlgorithm.java:1

LargeFactorial.java:3

LetterTilePossibilities-1.java:2

ConstructSmallestNumberFromDIString.java:1

MaximumSwap.java:1

ValidParenthesis.java:1

SplitAStringIntoTheMaxNumberOfUniqueSubstrings.java:1

FindValidMatrixGivenRowAndColumnSums.java:1

CheapestFlightsWithinKStops.java:1

LongestHappyString.java:1

next →1–100 of 302, ranked by callers