One-Hundred-Sixteen Commit: Create skeleton Heap section

Author: AAdewunmi

README.md

@@ -1,4 +1,4 @@
-package Cyclic_Sort_Pattern;
+package Cyclic_Sort;
 
 // Problem Statement: Cyclic Sort (easy)
 // LeetCode Question: 912. Sort an Array

src/Cyclic_Sort_Pattern/Cyclic_Sort_Tutorial.txt renamed to src/Cyclic_Sort/Cyclic_Sort_Tutorial.txt

@@ -1,4 +1,4 @@
-package Cyclic_Sort_Pattern;
+package Cyclic_Sort;
 
 // Problem Statement: Find the Missing Number (easy)
 // LeetCode Question: 268. Missing Number

src/Cyclic_Sort_Pattern/Problem_1_CyclicSort.java renamed to src/Cyclic_Sort/Problem_1_CyclicSort.java

@@ -1,4 +1,4 @@
-package Cyclic_Sort_Pattern;
+package Cyclic_Sort;
 
 // Problem Statement: Find all Missing Numbers (easy)
 // LeetCode Question: 448. Find All Numbers Disappeared in an Array

src/Cyclic_Sort_Pattern/Problem_2_FindMissingNumber.java renamed to src/Cyclic_Sort/Problem_2_FindMissingNumber.java

@@ -1,4 +1,4 @@
-package Cyclic_Sort_Pattern;
+package Cyclic_Sort;
 
 // Problem Statement: Find the Duplicate Number (easy)
 // LeetCode Question: 287. Find the Duplicate Number

src/Cyclic_Sort_Pattern/Problem_3_FindAllMissingNumbers.java renamed to src/Cyclic_Sort/Problem_3_FindAllMissingNumbers.java

@@ -1,4 +1,4 @@
-package Cyclic_Sort_Pattern;
+package Cyclic_Sort;
 
 // Problem Statement: Find the Duplicate Numbers (easy)
 // LeetCode Question: 442. Find All Duplicates in an Array

src/Cyclic_Sort_Pattern/Problem_4_FindTheDuplicateNumber.java renamed to src/Cyclic_Sort/Problem_4_FindTheDuplicateNumber.java

@@ -1,4 +1,4 @@
-package Cyclic_Sort_Pattern;
+package Cyclic_Sort;
 
 // Problem Statement: Find the Corrupt Pair (easy)
 // LeetCode Question: 645. Set Mismatch

src/Cyclic_Sort_Pattern/Problem_5_FindAllDuplicateNumbers.java renamed to src/Cyclic_Sort/Problem_5_FindAllDuplicateNumbers.java

@@ -1,4 +1,4 @@
-package Cyclic_Sort_Pattern;
+package Cyclic_Sort;
 
 // Problem Statement: Find the Smallest Missing Positive Number (medium)
 // LeetCode Question: 41. First Missing Positive

src/Cyclic_Sort_Pattern/Problem_6_FindCorruptPair.java renamed to src/Cyclic_Sort/Problem_6_FindCorruptPair.java

@@ -1,4 +1,4 @@
-package Cyclic_Sort_Pattern;
+package Cyclic_Sort;
 
 // Problem Statement: Find the First K Missing Positive Numbers (hard)
 // LeetCode Question: 1539. Kth Missing Positive Number

src/Cyclic_Sort_Pattern/Problem_7_FindSmallestMissingPositiveNumber.java renamed to src/Cyclic_Sort/Problem_7_FindSmallestMissingPositiveNumber.java

@@ -1,4 +1,4 @@
-package Graphs;
+package Graph;
 
 // Problem Statement: Find if Path Exists in Graph (easy)
 // LeetCode Question: 1971. Find if Path Exists in Graph

src/Cyclic_Sort_Pattern/Problem_8_FindFirstKMissingPositiveNumber.java renamed to src/Cyclic_Sort/Problem_8_FindFirstKMissingPositiveNumber.java

@@ -1,4 +1,4 @@
-package Graphs;
+package Graph;
 
 // Problem Statement: Number of Provinces (medium)
 // LeetCode Question: 547. Number of Provinces

src/Graphs/Graph_Tutorial.txt renamed to src/Graph/Graph_Tutorial.txt

@@ -1,4 +1,4 @@
-package Graphs;
+package Graph;
 
 // Problem Statement: Minimum Number of Vertices to Reach All Nodes(medium)
 // LeetCode Question: 1557. Minimum Number of Vertices to Reach All Nodes

src/Graphs/Problem_1_Find_If_Path_Exists_In_Graph.java renamed to src/Graph/Problem_1_Find_If_Path_Exists_In_Graph.java

@@ -1,4 +1,4 @@
-package HashMap;
+package HashMap_HashTable;
 
 // Problem Statement: First Non-repeating Character (easy)
 // LeetCode Question: 387. First Unique Character in a String

src/Graphs/Problem_2_Number_Of_Provinces.java renamed to src/Graph/Problem_2_Number_Of_Provinces.java

@@ -1,4 +1,4 @@
-package HashMap;
+package HashMap_HashTable;
 
 // Problem Statement: Largest Unique Number (easy)
 // LeetCode Question: 1133. Largest Unique Number

src/Graphs/Problem_3_Minimum_Number_Of_Vertices_to_Reach_All_Nodes.java renamed to src/Graph/Problem_3_Minimum_Number_Of_Vertices_to_Reach_All_Nodes.java

@@ -1,4 +1,4 @@
-package HashMap;
+package HashMap_HashTable;
 
 // Problem Statement: Maximum Number of Balloons (easy)
 // LeetCode Question: 1189. Maximum Number of Balloons

src/HashMap/HashMap_Tutorial.txt renamed to src/HashMap_HashTable/HashMap_Tutorial.txt

@@ -1,4 +1,4 @@
-package HashMap;
+package HashMap_HashTable;
 
 // Problem Statement: Longest Palindrome(easy)
 // LeetCode Question: 409. Longest Palindrome

src/HashMap/Problem_1_First_NonRepeating_Character.java renamed to src/HashMap_HashTable/Problem_1_First_NonRepeating_Character.java

@@ -1,4 +1,4 @@
-package HashMap;
+package HashMap_HashTable;
 
 // Problem Statement: Ransom Note (easy)
 // LeetCode Question: 383. Ransom Note

src/HashMap/Problem_2_Largest_Unique_Number.java renamed to src/HashMap_HashTable/Problem_2_Largest_Unique_Number.java

@@ -1,4 +1,4 @@
-package In_Place_Reversal_LinkedList_Pattern;
+package In_Place_Reversal_LinkedList;
 
 // Problem Statement: Reverse a LinkedList (easy)
 // LeetCode Question: 206. Reverse Linked List

src/HashMap/Problem_3_Maximum_Number_Of_Ballons.java renamed to src/HashMap_HashTable/Problem_3_Maximum_Number_Of_Ballons.java

@@ -1,4 +1,4 @@
-package In_Place_Reversal_LinkedList_Pattern;
+package In_Place_Reversal_LinkedList;
 
 // Problem Statement: Reverse a Sub-list
 // LeetCode Question: 92. Reverse Linked List II

src/HashMap/Problem_4_Longest_Palindrome.java renamed to src/HashMap_HashTable/Problem_4_Longest_Palindrome.java

@@ -1,4 +1,4 @@
-package In_Place_Reversal_LinkedList_Pattern;
+package In_Place_Reversal_LinkedList;
 
 // Problem Statement: Reverse every K-element Sub-list (medium)
 // LeetCode Question: 25. Reverse Nodes in k-Group

src/HashMap/Problem_5_Ransome_Note.java renamed to src/HashMap_HashTable/Problem_5_Ransome_Note.java

@@ -1,4 +1,4 @@
-package In_Place_Reversal_LinkedList_Pattern;
+package In_Place_Reversal_LinkedList;
 
 // Problem Statement: Reverse alternating K-element Sub-list (medium)
 // LeetCode Question: -

src/Heap/Heap_Tutorial.txt

@@ -1,4 +1,4 @@
-package In_Place_Reversal_LinkedList_Pattern;
+package In_Place_Reversal_LinkedList;
 
 // Problem Statement: Rotate a LinkedList (medium)
 // LeetCode Question: 61. Rotate List

src/In_Place_Reversal_LinkedList_Pattern/In_Place_Reversal_Linked_List_Tutorial.txt renamed to src/In_Place_Reversal_LinkedList/In_Place_Reversal_Linked_List_Tutorial.txt

@@ -1,4 +1,4 @@
-package Island_Pattern;
+package Island_Matrix_Traversal;
 
 // Problem Statement: Number of Islands (easy)
 // LeetCode Question: 200. Number of Islands

src/In_Place_Reversal_LinkedList_Pattern/Problem_1_ReverseALinkedList.java renamed to src/In_Place_Reversal_LinkedList/Problem_1_ReverseALinkedList.java

@@ -1,4 +1,4 @@
-package Island_Pattern;
+package Island_Matrix_Traversal;
 
 // Problem Statement: Biggest Island (easy)
 // LeetCode Question: 695. Max Area of Island

src/In_Place_Reversal_LinkedList_Pattern/Problem_2_ReverseASubList.java renamed to src/In_Place_Reversal_LinkedList/Problem_2_ReverseASubList.java

@@ -1,4 +1,4 @@
-package Island_Pattern;
+package Island_Matrix_Traversal;
 
 // Problem Statement: Flood Fill (easy)
 // LeetCode Question: 733. Flood Fill

src/In_Place_Reversal_LinkedList_Pattern/Problem_3_ReverseEveryKElementSubList.java renamed to src/In_Place_Reversal_LinkedList/Problem_3_ReverseEveryKElementSubList.java

@@ -1,4 +1,4 @@
-package Island_Pattern;
+package Island_Matrix_Traversal;
 
 // Problem Statement: Number of Closed Islands (easy)
 // LeetCode Question: 1254. Number of Closed Islands

src/In_Place_Reversal_LinkedList_Pattern/Problem_4_ReverseAlternatingKElementSubList.java renamed to src/In_Place_Reversal_LinkedList/Problem_4_ReverseAlternatingKElementSubList.java

@@ -1,4 +1,4 @@
-package Island_Pattern;
+package Island_Matrix_Traversal;
 
 // Problem Statement: Problem Challenge 1 (easy) - The given matrix has only one island, write a function to find the perimeter of that island.
 // LeetCode Question: 463. Island Perimeter

src/In_Place_Reversal_LinkedList_Pattern/Problem_5_RotateALinkedList.java renamed to src/In_Place_Reversal_LinkedList/Problem_5_RotateALinkedList.java

@@ -1,4 +1,4 @@
-package Island_Pattern;
+package Island_Matrix_Traversal;
 
 // Problem Statement: Problem Challenge 2 (medium) - Write a function to find the number of distinct islands in the given matrix.
 // LeetCode Question: 694. Number of Distinct Islands

src/Island_Pattern/Island_Pattern_Tutorial.txt renamed to src/Island_Matrix_Traversal/Island_Pattern_Tutorial.txt

@@ -1,4 +1,4 @@
-package Island_Pattern;
+package Island_Matrix_Traversal;
 
 // Problem Statement: Problem Challenge 3 (medium) - Write a function to find the number of distinct islands in the given matrix.
 // LeetCode Question: 1559. Detect Cycles in 2D Grid

src/Island_Pattern/Problem_1_Number_Of_Islands.java renamed to src/Island_Matrix_Traversal/Problem_1_Number_Of_Islands.java

@@ -1,4 +1,4 @@
-package Merge_Intervals_Pattern;
+package Merge_Intervals;
 
 // Problem Statement: Merge Intervals (medium)
 // LeetCode Question: 56. Merge Intervals

src/Island_Pattern/Problem_2_Biggest_Island.java renamed to src/Island_Matrix_Traversal/Problem_2_Biggest_Island.java

@@ -1,4 +1,4 @@
-package Merge_Intervals_Pattern;
+package Merge_Intervals;
 
 // Problem Statement: Insert Interval (medium)
 // LeetCode Question: 57. Insert Interval

src/Island_Pattern/Problem_3_Flood_Fill.java renamed to src/Island_Matrix_Traversal/Problem_3_Flood_Fill.java

@@ -1,4 +1,4 @@
-package Merge_Intervals_Pattern;
+package Merge_Intervals;
 
 // Problem Statement: Intervals Intersection (medium)
 // LeetCode Question: 986. Interval List Intersections

src/Island_Pattern/Problem_4_Number_Of_Closed_Island.java renamed to src/Island_Matrix_Traversal/Problem_4_Number_Of_Closed_Island.java

@@ -1,4 +1,4 @@
-package Merge_Intervals_Pattern;
+package Merge_Intervals;
 
 // Problem Statement: Conflicting Appointments (medium)
 // LeetCode Question: 1353. Maximum Number of Events That Can Be Attended

src/Island_Pattern/Problem_5_Island_Perimeter.java renamed to src/Island_Matrix_Traversal/Problem_5_Island_Perimeter.java

@@ -1,4 +1,4 @@
-package Merge_Intervals_Pattern;
+package Merge_Intervals;
 
 // Problem Statement: Minimum Meeting Rooms (hard)
 // LeetCode Question: 253. Meeting Rooms 11

src/Island_Pattern/Problem_6_Number_Of_Distinct_Islands.java renamed to src/Island_Matrix_Traversal/Problem_6_Number_Of_Distinct_Islands.java

@@ -1,4 +1,4 @@
-package Merge_Intervals_Pattern;
+package Merge_Intervals;
 
 // Problem Statement: Maximum CPU Load (hard)
 // LeetCode Question: 1235. Maximum Profit in Job Scheduling

src/Island_Pattern/Problem_7_Detect_Cycles_In_2D_Grid.java renamed to src/Island_Matrix_Traversal/Problem_7_Detect_Cycles_In_2D_Grid.java

@@ -1,4 +1,4 @@
-package Merge_Intervals_Pattern;
+package Merge_Intervals;
 
 // Problem Statement: Employee Free Time
 // LeetCode Question: 759. Employee Free Time

src/Merge_Intervals_Pattern/Merge_Interval_Tutorial.txt renamed to src/Merge_Intervals/Merge_Interval_Tutorial.txt

@@ -1,4 +1,4 @@
-package Sliding_Window_Technique;
+package Sliding_Window;
 
 // Problem Statement: Words Concatenation (hard)
 // LeetCode Question: 30. Substring with Concatenation of All Words

src/Merge_Intervals_Pattern/Problem_1_MergeIntervals.java renamed to src/Merge_Intervals/Problem_1_MergeIntervals.java

@@ -1,4 +1,4 @@
-package Sliding_Window_Technique;
+package Sliding_Window;
 
 // Problem Statement: Maximum Sum Subarray of Size K (easy)
 // LeetCode Question: 2461. Maximum Sum of Distinct Subarrays With Length K

src/Merge_Intervals_Pattern/Problem_2_InsertInterval.java renamed to src/Merge_Intervals/Problem_2_InsertInterval.java

@@ -1,4 +1,4 @@
-package Sliding_Window_Technique;
+package Sliding_Window;
 
 // Problem Statement: Smallest Subarray With a Greater Sum (easy)
 // LeetCode Question: 209. Minimum Size Subarray Sum

src/Merge_Intervals_Pattern/Problem_3_IntervalsIntersections.java renamed to src/Merge_Intervals/Problem_3_IntervalsIntersections.java

@@ -1,4 +1,4 @@
-package Sliding_Window_Technique;
+package Sliding_Window;
 
 // Problem Statement: Longest Substring with K Distinct Characters (medium)
 // LeetCode Question: 340. Longest Substring With At Most K Distinct Characters

src/Merge_Intervals_Pattern/Problem_4_ConflictingAppointments.java renamed to src/Merge_Intervals/Problem_4_ConflictingAppointments.java

@@ -1,4 +1,4 @@
-package Sliding_Window_Technique;
+package Sliding_Window;
 
 // Problem Statement: Fruits into Baskets (medium)
 // LeetCode Question: 904. Fruit Into Baskets

src/Merge_Intervals_Pattern/Problem_5_MinimumMeetingRooms.java renamed to src/Merge_Intervals/Problem_5_MinimumMeetingRooms.java

@@ -1,4 +1,4 @@
-package Sliding_Window_Technique;
+package Sliding_Window;
 
 // Problem Statement: Longest Substring with Same Letters after Replacement (hard)
 // LeetCode Question: 424. Longest Repeating Character Replacement

src/Merge_Intervals_Pattern/Problem_6_MaximumCPULoad.java renamed to src/Merge_Intervals/Problem_6_MaximumCPULoad.java

@@ -1,4 +1,4 @@
-package Sliding_Window_Technique;
+package Sliding_Window;
 
 // Problem Statement: Longest Subarray with Ones after Replacement (hard)
 // LeetCode Question: 1004. Max Consecutive Ones III

src/Merge_Intervals_Pattern/Problem_7_EmployeeFreeTime.java renamed to src/Merge_Intervals/Problem_7_EmployeeFreeTime.java

@@ -1,4 +1,4 @@
-package Sliding_Window_Technique;
+package Sliding_Window;
 
 // Problem Statement: Permutation in a String (hard)
 // LeetCode Question: 567. Permutation in String

src/Sliding_Window_Technique/Problem_10_WordsConcatenation.java renamed to src/Sliding_Window/Problem_10_WordsConcatenation.java

@@ -1,4 +1,4 @@
-package Sliding_Window_Technique;
+package Sliding_Window;
 
 // Problem Statement: String Anagrams (hard)
 // LeetCode Question: 438. Find All Anagrams in a String

src/Sliding_Window_Technique/Problem_1_MaximumSumSubArraySizeK.java renamed to src/Sliding_Window/Problem_1_MaximumSumSubArraySizeK.java

@@ -1,4 +1,4 @@
-package Sliding_Window_Technique;
+package Sliding_Window;
 
 // Problem Statement: Smallest Window containing Substring (hard)
 // LeetCode Question: 76. Minimum Window Substring

src/Sliding_Window_Technique/Problem_2_SmallestSubArrayWithGreaterSum.java renamed to src/Sliding_Window/Problem_2_SmallestSubArrayWithGreaterSum.java

@@ -1,4 +1,4 @@
-package Stacks;
+package Stack;
 
 // Problem Statement: Balanced Parentheses
 // LeetCode Question: 20. Valid Parentheses

src/Sliding_Window_Technique/Problem_3_LongestSubstringWithKDistinctCharacters.java renamed to src/Sliding_Window/Problem_3_LongestSubstringWithKDistinctCharacters.java

@@ -1,4 +1,4 @@
-package Stacks;
+package Stack;
 
 // Problem Statement: Reverse a String
 // LeetCode Question: 344 Reverse String

src/Sliding_Window_Technique/Problem_4_FruitsIntoBasket.java renamed to src/Sliding_Window/Problem_4_FruitsIntoBasket.java

@@ -1,4 +1,4 @@
-package Stacks;
+package Stack;
 
 // Problem Statement: Decimal to Binary Conversion
 // LeetCode Question: 1017. Convert to Base -2

src/Sliding_Window_Technique/Problem_5_LongestSubstringWithSameLettersAfterReplacement.java renamed to src/Sliding_Window/Problem_5_LongestSubstringWithSameLettersAfterReplacement.java

@@ -1,4 +1,4 @@
-package Stacks;
+package Stack;
 
 // Problem Statement: Next Greater Element
 // HackerRank Contest: Next Greater Element (URL: https://www.hackerrank.com/contests/second/challenges/next-greater-element/problem)

src/Sliding_Window_Technique/Problem_6_LongestSubArrayWithOnesAfterReplacement.java renamed to src/Sliding_Window/Problem_6_LongestSubArrayWithOnesAfterReplacement.java

@@ -1,4 +1,4 @@
-package Stacks;
+package Stack;
 
 // Problem Statement: Sorting a Stack
 // LeetCode Question: -

src/Sliding_Window_Technique/Problem_7_PermutationInAString.java renamed to src/Sliding_Window/Problem_7_PermutationInAString.java

@@ -1,4 +1,4 @@
-package Stacks;
+package Stack;
 
 // Problem Statement: Simplify Path
 // LeetCode Question: 71. Simplify Path

src/Sliding_Window_Technique/Problem_8_StringAnagrams.java renamed to src/Sliding_Window/Problem_8_StringAnagrams.java

@@ -1,4 +1,4 @@
-package Tree_Breadth_First_Search_Pattern;
+package Tree_Breadth_First_Search;
 
 // Problem Statement: Binary Tree Level Order Traversal (easy)
 // LeetCode Question: 102. Binary Tree Level Order Traversal

src/Sliding_Window_Technique/Problem_9_SmallestWindowContainingSubstring.java renamed to src/Sliding_Window/Problem_9_SmallestWindowContainingSubstring.java

@@ -1,4 +1,4 @@
-package Tree_Breadth_First_Search_Pattern;
+package Tree_Breadth_First_Search;
 
 // Problem Statement: Reverse Level Order Traversal (easy)
 // LeetCode Question: 107. Binary Tree Level Order Traversal II

src/Sliding_Window_Technique/Slidings_Window_Technique_Tutorial.txt renamed to src/Sliding_Window/Slidings_Window_Technique_Tutorial.txt

@@ -1,4 +1,4 @@
-package Tree_Breadth_First_Search_Pattern;
+package Tree_Breadth_First_Search;
 
 // Problem Statement: Zigzag Traversal (medium)
 // LeetCode Question: 6. Zigzag Conversion

src/Stacks/Problem_1_BalancedParentheses.java renamed to src/Stack/Problem_1_BalancedParentheses.java

@@ -1,4 +1,4 @@
-package Tree_Breadth_First_Search_Pattern;
+package Tree_Breadth_First_Search;
 
 // Problem Statement: Level Averages in a Binary Tree (easy)
 // LeetCode Question: 637. Average of Levels in Binary Tree

src/Stacks/Problem_2_ReverseAString.java renamed to src/Stack/Problem_2_ReverseAString.java

@@ -1,4 +1,4 @@
-package Tree_Breadth_First_Search_Pattern;
+package Tree_Breadth_First_Search;
 
 // Problem Statement: Minimum Depth of a Binary Tree (easy)
 // LeetCode Question: 111. Minimum Depth of Binary Tree

src/Stacks/Problem_3_DecimalToBinaryConversion.java renamed to src/Stack/Problem_3_DecimalToBinaryConversion.java

@@ -1,4 +1,4 @@
-package Tree_Breadth_First_Search_Pattern;
+package Tree_Breadth_First_Search;
 
 // Problem Statement: Level Order Successor (easy)
 // LeetCode Question: -

src/Stacks/Problem_4_NextGreaterElement.java renamed to src/Stack/Problem_4_NextGreaterElement.java

@@ -1,4 +1,4 @@
-package Tree_Breadth_First_Search_Pattern;
+package Tree_Breadth_First_Search;
 
 // Problem Statement: Connect Level Order Siblings (medium)
 // LeetCode Question: 116. Populating Next Right Pointers in Each TreeNode

src/Stacks/Problem_5_SortingAStack.java renamed to src/Stack/Problem_5_SortingAStack.java

@@ -1,4 +1,4 @@
-package Tree_Breadth_First_Search_Pattern;
+package Tree_Breadth_First_Search;
 
 // Problem Statement: Connect All Level Order Siblings (medium)
 // LeetCode Question: -