Types & classes — github.com/17tanya/Leetcode-Data-Structures-and-Algorithms

CodeHub MCPcopy Create free account

hub / github.com/17tanya/Leetcode-Data-Structures-and-Algorithms / types & classes

Types & classes96 in github.com/17tanya/Leetcode-Data-Structures-and-Algorithms

⨍ Functions 190◇ Types & classes 96

ClassBinarySearch

BinarySearch/Binary_Search_Variants.java:11

DynamicProgramming/BoxStackingProblem.java:7

DynamicProgramming/BoxStackingProblem.java:30

Arrays/Zig_Zag_Array.java:3

Arrays/Equilibrium_Point.java:4

Arrays/Stock_Buy_Sell.java:4

Arrays/Spiral_Traversal_Of_Matrix.java:4

Arrays/Sort_Array_Of_0_1_2.java:4

Arrays/Minimum_Platforms.java:4

ClassKadaneResult

DynamicProgramming/MaximumSumRectangularSubMatrix.java:17

DynamicProgramming/LongestCommonSubsequence/Find_Longest_Common_Subsequence.java:9

DynamicProgramming/LongestCommonSubsequence/Length_Of_Longest_Common_Subsequence.java:58

DynamicProgramming/LongestCommonSubstring/Length_Of_Longest_Common_Substring.java:22

GraphsDFS&BFS/Alien_Dictionary_Topological_Sort.java:30

GraphsDFS&BFS/DelayedProjects.java:134

ClassMaxSumRectangularSubMatrix

DynamicProgramming/MaximumSumRectangularSubMatrix.java:8

DynamicProgramming/MaximumSumSubMatrixInAGivenMatrix.java:10

DynamicProgramming/MaximumSumRectangularSubMatrix.java:9

strStr().java:1

BinarySearch/Peak_Index_in_a_Mountain_Array.java:29

BinarySearch/First_Bad_Version.java:23

BinarySearch/Count_Negative_Numbers_in_a_Sorted_Matrix.java:30

BinarySearch/Sqrt(x).java:25

BinarySearch/Search_Insert_Position.java:28

BinarySearch/Find_Peak_Element.java:30

BinarySearch/Find_Minimum in_Rotated_Sorted_Array.java:4

BinarySearch/Search_in_Rotated_Sorted_Array.java:26

BinarySearch/Guess_Number_Higher_or_Lower.java:28

GraphsDFS&BFS/Find_the_Town_Judge.java:4

GraphsDFS&BFS/Course_Schedule.java:5

GraphsDFS&BFS/Alien_Dictionary_Topological_Sort.java:44

GraphsDFS&BFS/Clone_Graph.java:26

GraphsDFS&BFS/DelayedProjects.java:65

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

GraphsDFS&BFS/Binary_Tree_Level_Order_Traversal.java:13

GraphsDFS&BFS/Friend_Circles.java:17

GraphsDFS&BFS/Flower_Planting_With_No_Adjacent.java:4

GraphsDFS&BFS/Number_of_Islands.java:4

GraphsDFS&BFS/Course_Schedule_II.java:5

Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode() {} ListNode(int val) { this.val = val; }

LinkedList/Add_Two_Numbers.java:14

Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode() {} ListNode(int val) { this.val = val; }

LinkedList/MergeTwoSortedLists.java:15

Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode() {} ListNode(int val) { this.val = val; }

LinkedList/RemoveNthNodeFromEndOfList.java:14

Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }

LinkedList/Remove_Nth_Node_From_End_of_List.java:12

Hash Table/Two_Sum.java:4

Arrays/Largest_Number_From_Array.java:1

Arrays/Rotate_Image.java:107

Arrays/Move_Zeroes.java:3

Arrays/First_Missing_Positive.java:26

Backtracking/Permutations.java:4

Backtracking/CombinationSumIII.java:4

Backtracking/CombinationSum.java:4

Backtracking/CombinationSumII.java:4

Backtracking/PermutationsII.java:4

Backtracking/Subsets.java:4

Backtracking/SubsetsII.java:4

Backtracking/WordSearch.java:4

Backtracking/LetterCasePermutation.java:4

Backtracking/GenerateParentheses.java:4

Backtracking/PalindromePartitioning.java:4

Google-Code-Jam-QualificationRound-2020/ParentingPartneringReturns.java:22

Google-Code-Jam-QualificationRound-2020/NestingDepth.java:7

Google-Code-Jam-QualificationRound-2020/Vestigium.java:7

Math/Palindrome_Number.java:4

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

Trees/Symmetric_Tree.java:13

Trees/N_aryTreeLevelorderTraversal.java:23

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

Trees/Same_Tree.java:13

Trees/N_aryTreePostorderTraversal.java:23

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

Trees/Validate_Binary_Search_Tree.java:13

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

Trees/Kth_Smallest_Element_in_a_BST.java:13

Trees/N_aryTreePreorderTraversal.java:23

Recursion/LetterCombinationsOfAPhoneNumber.java:4

SlidingWindow/Longest_Substring_With_Atmost_Two_Distinct_Characters.java:4

SlidingWindow/Minimum_Window_Substring.java:5

SlidingWindow/Longest_Repeating_Character_Replacement.java:4

SlidingWindow/Longest_Substring_Without_Repeating_Characters.java:4

SlidingWindow/Permutation_in_String.java:4

SlidingWindow/Find_All_Anagarms_In_A_String.java:4

Stacks/ValidParentheses.java:4

Stacks/Decode_String.java:16

TwoPointer/3Sum.java:4

TwoPointer/3SumClosest.java:4

TwoPointer/4Sum.java:4

TwoPointer/ContainerWithMostWater.java:4

String/LongestCommonPrefix.java:4

String/ZigZag_Conversion.java:4

DynamicProgramming/LongestPalindromicSubstring.java:4

DynamicProgramming/MaxRectangularSubmatrixOf1s.java:14

DynamicProgramming/WordBreakProblem/[Optimized]WordBreakPrintWords.java:5

ClassSortbySignup

Google_Hash_Code_2020.java:24

DynamicProgramming/MaximumSumSubMatrixInAGivenMatrix.java:21

DynamicProgramming/SumOfElementsInASubMatrixConstantTime/SumOfAllElementsInASubMatrixInConstantTime.java:16

ClassTopologicalSort

GraphsDFS&BFS/KahnTopologicalSort.java:19

DynamicProgramming/MIT-6.006-IntroToAlgosNotes/DP1_Fibonacci_ShortestPaths.java:16

Google_Hash_Code_2020.java:35

Google_Hash_Code_2020.java:9

Google-Code-Jam-QualificationRound-2020/ParentingPartneringReturns.java:7

ClasstopologicalSort

GraphsDFS&BFS/TopologicalSort_DFS.java:12