├── Step 01 - Basics ├── Step 1.3 Basic Maths │ ├── Armstrong_number.java │ ├── Check_palindrome.java │ ├── Check_prime.java │ ├── Count_Digits.java │ ├── GCD.java │ ├── LCM.java │ ├── Print_all_divisior.java │ └── Reverse_number.java ├── Step 1.4 Basic Recursion │ ├── Fibonacci Number.java │ └── Print 1 to N using recursion.java └── Step 1.5 Basic Hashing │ ├── Frequencies of Limited Range Array Elements.java │ └── Frequency of the Most Frequent Element.java ├── Step 02 Learn Important Sorting Techniques ├── Step 2.1 Sorting-I │ ├── Bubblesort.java │ ├── Insertionsort.java │ └── Selectionsort.java └── Step 2.1 Sorting-II │ ├── Mergesort.java │ └── Quicksort.java ├── Step 03 Arrays ├── Step 3.1 Easy │ ├── GeeksForGeeks │ │ ├── Check if array is sorted.java │ │ ├── Find the element that appears once.java │ │ ├── Intersection of two sorted array.java │ │ ├── Largest Element in Array.java │ │ ├── Linear Search.java │ │ ├── Longest Sub-Array with Sum K.java │ │ ├── Maximize Number of 1's.java │ │ ├── Missing number.java │ │ ├── Move all zeroes to end of array.java │ │ ├── Quick Left Rotation.java │ │ ├── Remove duplicate elements from sorted Array.java │ │ ├── Rotating an Array.java │ │ ├── Row with max 1s.java │ │ ├── Search in a matrix.java │ │ ├── Second Largest element.java │ │ ├── Second Smallest Element.java │ │ └── Union of two sorted array.java │ └── LeetCode │ │ ├── Check if Array Is Sorted and Rotated.java │ │ ├── Max Consecutive Ones.java │ │ ├── Missing Number.java │ │ ├── Move Zeroes.java │ │ ├── Remove Duplicates from Sorted Array.java │ │ ├── Rotate Array.java │ │ ├── Search a 2D Matrix.java │ │ └── Subarray Sum Equals K.java ├── Step 3.2 Medium │ ├── GeeksForGeeks │ │ ├── Alternate positive and negative numbers.java │ │ ├── Find all pairs with a given sum.java │ │ ├── Kadane's Algorithm.java │ │ ├── Leaders in an array.java │ │ ├── Longest consecutive subsequence.java │ │ ├── Majority Element.java │ │ ├── Make Zeroes.java │ │ ├── Max sum in sub-arrays.java │ │ ├── Next Permutation.java │ │ ├── Rotate by 90 degree.java │ │ ├── Sort an array of 0s, 1s and 2s.java │ │ ├── Spiral Matrix.java │ │ └── Stock buy and sell.java │ └── LeetCode │ │ ├── Best Time to Buy and Sell Stock.java │ │ ├── Longest Consecutive Sequence.java │ │ ├── Majority Element.java │ │ ├── Maximum Subarray.java │ │ ├── Next Permutation.java │ │ ├── Rearrange Array Elements by Sign.java │ │ ├── Rotate Image.java │ │ ├── Set Matrix Zeroes.java │ │ ├── Sort Colors.java │ │ ├── Spiral Matrix.java │ │ └── Two Sum.java └── Step 3.3 Hard │ ├── GeeksForGeeks │ ├── 3 sum closest.java │ ├── Count Inversions.java │ ├── Find All Four Sum Numbers.java │ ├── Find Missing And Repeating.java │ ├── Largest subarray with 0 sum.java │ ├── Maximum Product Subarray.java │ ├── Merge Without Extra Space.java │ ├── Overlapping Intervals.java │ ├── Pairwise swap elements of a linked list.java │ ├── Pascal Triangle.java │ └── Subsets with XOR value.java │ └── LeetCode │ ├── 3Sum.java │ ├── 4Sum.java │ ├── Majority Element II.java │ ├── Maximum Product Subarray.java │ ├── Merge Intervals.java │ ├── Merge Sorted Array.java │ ├── Pascal's Triangle.java │ └── Reverse Pairs.java ├── Step 04 Binary Search ├── Step 4.1 Learning BS on 1D Array │ ├── GeeksForGeeks │ │ ├── Binary Search.java │ │ ├── Ceil The Floor.java │ │ ├── Find out how many times has an array been rotated.java │ │ ├── First and last occurrences of x.java │ │ ├── Floor in a Sorted Array.java │ │ ├── K-th element of two sorted Arrays.java │ │ ├── Minimum element in a sorted and rotated array.java │ │ ├── Number of occurrence.java │ │ ├── Peak element.java │ │ ├── Search in a Rotated Array.java │ │ └── Search insert position of K in a sorted array.java │ └── LeetCode │ │ ├── Binary Search.java │ │ ├── Find First and Last Position of Element in Sorted Array.java │ │ ├── Find Minimum in Rotated Sorted Array.java │ │ ├── Find Peak Element.java │ │ ├── Search Insert Position.java │ │ ├── Search in Rotated Sorted Array II.java │ │ ├── Search in Rotated Sorted Array.java │ │ └── Single Element in a Sorted Array.java ├── Step 4.2 Applying BS on 2D Array │ ├── GeeksForGeeks │ │ ├── Median in a row-wise sorted Matrix.java │ │ ├── Peak element.java │ │ └── Search in a matrix.java │ └── LeetCode │ │ ├── Find a Peak Element II.java │ │ └── Search a 2D Matrix.java └── Step 4.3 Find Answers by BS in Search Space │ ├── GeeksForGeeks │ ├── Allocate minimum number of pages.java │ ├── Capacity To Ship Packages Within D Days.java │ ├── Find Nth root of M.java │ ├── K-th element of two sorted Arrays.java │ ├── K-th missing element.java │ ├── Largest Sum Subarray of Size at least K.java │ ├── Median of 2 Sorted Arrays of Different Sizes.java │ └── Square root of a number.java │ └── LeetCode │ ├── Capacity To Ship Packages Within D Days.java │ ├── Find the Smallest Divisor Given a Threshold.java │ ├── Koko Eating Bananas.java │ ├── Kth Missing Positive Number.java │ ├── Median of Two Sorted Arrays.java │ ├── Minimum Number of Days to Make m Bouquets.java │ └── Split Array Largest Sum.java ├── Step 05 strings ├── Step 5.1 Basic and Easy String Problems │ ├── GeeksForGeeks │ │ ├── Anagram.java │ │ ├── Check if strings are rotations of each other or not.java │ │ ├── Isomorphic Strings.java │ │ ├── Longest Common Prefix in an Array.java │ │ └── Reverse words in a given string.java │ └── LeetCode │ │ ├── Isomorphic Strings.java │ │ ├── Largest Odd Number in String.java │ │ ├── Longest Common Prefix.java │ │ ├── Remove Outermost Parentheses.java │ │ ├── Reverse Words in a String.java │ │ ├── Rotate String.java │ │ └── Valid Anagram.java └── Step 5.2 Medium String Problems │ ├── GeeksForGeeks │ ├── Count number of substrings.java │ ├── Implement Atoi.java │ ├── Longest Palindrome in a String.java │ ├── Reverse words in a given string.java │ ├── Roman Number to Integer.java │ └── Sorting Elements of an Array by Frequency.java │ └── LeetCode │ ├── Longest Palindromic Substring.java │ ├── Maximum Nesting Depth of the Parentheses.java │ ├── Reverse Words in a String.java │ ├── Roman to Integer.java │ ├── Sort Characters By Frequency.java │ ├── String to Integer (atoi).java │ └── Sum of Beauty of All Substrings.java ├── Step 06 LinkedList ├── Step 6.1 1D Linked List │ ├── GeeksForGeeks │ │ ├── Count nodes of linked list.java │ │ ├── Delete a Node in Single Linked List.java │ │ ├── Linked List Insertion.java │ │ ├── LinkedList.java │ │ └── Search an element in the LL.java │ └── LeetCode │ │ └── Delete Node in a Linked List.java ├── Step 6.2 Doubly Linked List │ └── GeeksForGeeks │ │ ├── Delete node in Doubly Linked List.java │ │ ├── Doubly LinkedList Implementatin.java │ │ ├── Doubly linked list Insertion at given position.java │ │ └── Reverse a Doubly Linked List.java ├── Step 6.3 Medium Problem of LL │ ├── GeeksForGeeks │ │ ├── Add 1 to a number represented as linked list.java │ │ ├── Add two numbers represented by linked lists.java │ │ ├── Check if Linked List is Palindrome.java │ │ ├── Delete Middle of Linked List.java │ │ ├── Detect Loop in linked list.java │ │ ├── Find length of Loop.java │ │ ├── Finding middle element in a linked list.java │ │ ├── Given a linked list of 0s, 1s and 2s, sort it.java │ │ ├── Intersection of Two Linked Lists.java │ │ ├── Linked List that is Sorted Alternatingly.java │ │ ├── Nth node from end of linked list.java │ │ ├── Reverse a linked list.java │ │ └── Segregate even and odd nodes in a Link List.java │ └── LeetCode │ │ ├── Add Two Numbers.java │ │ ├── Delete the Middle Node of a Linked List.java │ │ ├── Intersection of Two Linked Lists.java │ │ ├── Linked List Cycle II.java │ │ ├── Linked List Cycle.java │ │ ├── Middle of the Linked List.java │ │ ├── Odd Even Linked List.java │ │ ├── Palindrome Linked List.java │ │ ├── Remove Nth Node From End of List.java │ │ ├── Reverse Linked List.java │ │ └── Sort List.java ├── Step 6.4 Medium Problem of DLL │ └── GeeksForGeeks │ │ ├── Delete all occurrences of a key in DLL.java │ │ ├── Find pairs with given sum in DLL.java │ │ └── Remove duplicates from sorted DLL.java └── Step 6.5 Hard Problem of LL │ ├── GeeksForGeeks │ ├── Clone a linked list with next and random pointer.java │ ├── Flattening a Linked List.java │ ├── Reverse Nodes in k-Group.java │ └── Rotate a Linked List.java │ └── LeetCode │ ├── Copy List with Random Pointer.java │ ├── Reverse Nodes in k-Group.java │ └── Rotate List.java ├── Step 07 Recursion ├── Step 7.1 Get a Strong Hold │ ├── GeeksForGeeks │ │ ├── Good Numbers.java │ │ ├── Implement Atoi.java │ │ ├── Power Of Numbers.java │ │ ├── Reverse a Stack.java │ │ └── Sort a stack.java │ └── LeetCode │ │ ├── Count Good Numbers.java │ │ ├── Pow(x, n).java │ │ └── String to Integer (atoi).java ├── Step 7.2 Subsequence Pattern │ ├── GeeksForGeeks │ │ ├── Combination Sum.java │ │ ├── Generate Parentheses.java │ │ ├── Generate_all_binary_strings.java │ │ ├── Possible Words From Phone Digits.java │ │ ├── Power Set.java │ │ └── Subset Sums.java │ └── LeetCode │ │ ├── Combination Sum II.java │ │ ├── Combination Sum III.java │ │ ├── Combination Sum.java │ │ ├── Generate Parentheses.java │ │ ├── Letter Combinations of a Phone Number.java │ │ ├── Subsets II.java │ │ └── Subsets.java └── Step 7.3 Try Out All Combo │ ├── GeeksForGeeks │ ├── M-Coloring Problem.java │ ├── N-Queens.java │ ├── Palindromic Partitioning.java │ ├── Rat in a Maze Problem - I.java │ ├── Sudoku Solver.java │ ├── Word Break - Part 2.java │ └── Word Search.java │ └── LeetCode │ ├── Expression Add Operators.java │ ├── N-Queens.java │ ├── Palindromic Partitioning.java │ ├── Sudoku Solver.java │ ├── Word Break.java │ └── Word Search.java ├── Step 08 Bit Manipulation ├── Step 8.1 Learn Bit Manipulation │ ├── GeeksForGeeks │ │ ├── Check whether K-th bit is set or not.java │ │ ├── Count total set bits.java │ │ ├── Division without using multiplication, division and mod operator.java │ │ ├── Odd or Even.java │ │ ├── Power of 2.java │ │ ├── Set the rightmost unset bit.java │ │ └── Swap two numbers.java │ └── Leetcode │ │ ├── Divide Two Integers.java │ │ └── Power of Two.java ├── Step 8.2 Interview Problems │ ├── GeeksForGeeks │ │ ├── Bit Difference.java │ │ ├── Exceptionally odd.java │ │ ├── Power Set.java │ │ └── Two numbers with odd occurrences.java │ └── Leetcode │ │ ├── Minimum Bit Flips to Convert Number.java │ │ ├── Single Number.java │ │ └── Subsets.java └── Step 8.3 Advance Maths │ ├── GeeksForGeeks │ ├── Power Of Numbers.java │ ├── Prime Factors.java │ └── Sieve of Eratosthenes.java │ └── Leetcode │ ├── Count Primes.java │ └── Pow(x, n).java ├── Step 09 Stack and Queues ├── Step 9.1 Learning │ ├── GeeksForGeeks │ │ ├── Get minimum element from stack.java │ │ ├── Implement Queue using Linked List.java │ │ ├── Implement Queue using array.java │ │ ├── Implement Stack using Linked List.java │ │ ├── Implement stack using array.java │ │ ├── Parenthesis Checker.java │ │ ├── Queue using stack.java │ │ └── Stack using two queues.java │ └── Leetcode │ │ ├── Implement Queue using Stacks.java │ │ ├── Implement Stack using Queues.java │ │ ├── Min Stack.java │ │ └── Valid Parentheses.java ├── Step 9.2 Prefix, Infix, PostFix Conversion Problems │ └── GeeksForGeeks │ │ └── Infix to Postfix.java ├── Step 9.3 Monotonic stack ans Queue Problems │ ├── GeeksForGeeks │ │ ├── Immediate Smaller Element.java │ │ ├── Max rectangle.java │ │ ├── Maximum Rectangular Area in a Histogram.java │ │ ├── Next Greater Element.java │ │ ├── Remove K Digits.java │ │ ├── Stock span problem.java │ │ └── Trapping Rain Water.java │ └── Leetcode │ │ ├── Asteroid Collision.java │ │ ├── Largest Rectangle in Histogram.java │ │ ├── Maximal Rectangle.java │ │ ├── Next Greater Element I.java │ │ ├── Next Greater Element II.java │ │ ├── Online Stock Span.java │ │ ├── Remove K Digits.java │ │ ├── Sum of Subarray Minimums.java │ │ ├── Sum of Subarray Ranges.java │ │ └── Trapping Rain Water.java └── Step 9.4 Implementation Problems │ ├── GeeksForGeeks │ ├── LRU Cache.java │ ├── Maximum of all subarrays of size k.java │ ├── Rotten Oranges.java │ ├── Stock span problem.java │ └── The Celebrity Problem.java │ └── LeetCode │ ├── LFU Cache.java │ ├── LRU Cache.java │ ├── Online Stock Span.java │ ├── Rotting Oranges.java │ └── Sliding Window Maximum.java ├── Step 10 Sliding Window & Two Pointer Combined Problems ├── Step 10.1 Medium Problems │ ├── GeeksForGeeks │ │ ├── Count Subarray with k odds.java │ │ ├── Count Substring.java │ │ ├── Length of the longest substring.java │ │ └── Maximum Consecutive Ones.java │ └── LeetCode │ │ ├── Binary Subarrays With Sum.java │ │ ├── Count Number of Nice Subarrays.java │ │ ├── Longest Repeating Character Replacement.java │ │ ├── Longest Substring Without Repeating Characters.java │ │ ├── Max Consecutive Ones III.java │ │ ├── Maximum Points You Can Obtain from Cards.java │ │ └── Number of Substrings Containing All Three Characters.java └── Step 10.2 Hard Problems │ ├── GeeksForGeeks │ ├── Longest K unique characters substring.java │ └── Smallest window in a string containing all the characters of another string.java │ └── LeetCode │ ├── Minimum Window Substring.java │ └── Subarrays with K Different Integers.java ├── Step 11 Heaps ├── Step 11.1 Learning │ └── GeeksForGeeks │ │ ├── Binary Heap Operations.java │ │ └── Does array represent Heap.java ├── Step 11.2 Medium Problems │ ├── GeeksForGeeks │ │ ├── K largest elements.java │ │ ├── Kth smallest element.java │ │ ├── Merge K sorted linked lists.java │ │ └── Merge k Sorted Arrays.java │ └── LeetCode │ │ ├── Hand of Straights.java │ │ ├── Kth Largest Element in an Array.java │ │ ├── Merge k Sorted Lists.java │ │ └── Task Scheduler..java └── Step 11.3 Hard Problems │ ├── GeeksForGeeks │ ├── Find median in a stream.java │ ├── Kth largest element in a stream.java │ ├── Rod Cutting.java │ └── Top K Frequent Elements in Array.java │ └── LeetCode │ ├── Design Twitter.java │ ├── Find Median from Data Stream.java │ ├── Kth Largest Element in a Stream.java │ └── Top K Frequent Elements.java ├── Step 12 Greedy Algorithms ├── Step 12.1 Easy Problems │ ├── GeeksForGeeks │ │ ├── Fractional Knapsack.java │ │ ├── Minimum number of Coins.java │ │ └── Parenthesis Checker.java │ └── LeetCode │ │ ├── Assign Cookies.java │ │ ├── Lemonade Change.java │ │ └── Valid Parenthesis String.java └── Step 12.2 Medium-Hard Problems │ ├── GeeksForGeeks │ ├── Job Sequencing Problem.java │ ├── Jump Game.java │ ├── Minimum Platforms.java │ ├── Minimum number of jumps.java │ ├── N meetings in one room.java │ ├── Overlapping Intervals.java │ └── Page Faults in LRU.java │ └── LeetCode │ ├── Candy.java │ ├── Insert Interval.java │ ├── Jump Game II.java │ ├── Jump Game.java │ ├── Merge Intervals.java │ └── Non-overlapping Intervals.java └── Step 13 Binary Trees ├── Step 13.1 Traversals ├── GeeksForGeeks │ ├── Inorder Traversal.java │ ├── Level order traversal in spiral form.java │ ├── Postorder Traversal.java │ ├── Preorder Inorder Postorder Traversals in One Traversal.java │ └── Preorder Traversal.java └── LeetCode │ ├── Binary Tree Inorder Traversal.java │ ├── Binary Tree Level Order Traversal.java │ ├── Binary Tree Postorder Traversal.java │ └── Binary Tree Preorder Traversal.java └── Step 13.2 Medium Problems ├── GeeksForGeeks ├── Bottom View of Binary Tree.java ├── Boundary Traversal of binary tree.java ├── Check for Balanced Tree.java ├── Determine if Two Trees are Identical.java ├── Diameter of a Binary Tree.java ├── Height of Binary Tree.java ├── Left View of Binary Tree.java ├── Maximum path sum from any node.java ├── Symmetric Tree.java ├── Top View of Binary Tree.java ├── Vertical Traversal of Binary Tree.java └── ZigZag Tree Traversal.java └── LeetCode ├── Balanced Binary Tree.java ├── Binary Tree Maximum Path Sum.java ├── Binary Tree Right Side View.java ├── Binary Tree Zigzag Level Order Traversal.java ├── Diameter of Binary Tree.java ├── Maximum Depth of Binary Tree.java ├── Same Tree.java ├── Symmetric Tree.java └── Vertical Order Traversal of a Binary Tree.java /Step 01 - Basics/Step 1.3 Basic Maths/Armstrong_number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 01 - Basics/Step 1.3 Basic Maths/Armstrong_number.java -------------------------------------------------------------------------------- /Step 01 - Basics/Step 1.3 Basic Maths/Check_palindrome.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 01 - Basics/Step 1.3 Basic Maths/Check_palindrome.java -------------------------------------------------------------------------------- /Step 01 - Basics/Step 1.3 Basic Maths/Check_prime.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 01 - Basics/Step 1.3 Basic Maths/Check_prime.java -------------------------------------------------------------------------------- /Step 01 - Basics/Step 1.3 Basic Maths/Count_Digits.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 01 - Basics/Step 1.3 Basic Maths/Count_Digits.java -------------------------------------------------------------------------------- /Step 01 - Basics/Step 1.3 Basic Maths/GCD.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 01 - Basics/Step 1.3 Basic Maths/GCD.java -------------------------------------------------------------------------------- /Step 01 - Basics/Step 1.3 Basic Maths/LCM.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 01 - Basics/Step 1.3 Basic Maths/LCM.java -------------------------------------------------------------------------------- /Step 01 - Basics/Step 1.3 Basic Maths/Print_all_divisior.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 01 - Basics/Step 1.3 Basic Maths/Print_all_divisior.java -------------------------------------------------------------------------------- /Step 01 - Basics/Step 1.3 Basic Maths/Reverse_number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 01 - Basics/Step 1.3 Basic Maths/Reverse_number.java -------------------------------------------------------------------------------- /Step 01 - Basics/Step 1.4 Basic Recursion/Fibonacci Number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 01 - Basics/Step 1.4 Basic Recursion/Fibonacci Number.java -------------------------------------------------------------------------------- /Step 01 - Basics/Step 1.4 Basic Recursion/Print 1 to N using recursion.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 01 - Basics/Step 1.4 Basic Recursion/Print 1 to N using recursion.java -------------------------------------------------------------------------------- /Step 01 - Basics/Step 1.5 Basic Hashing/Frequencies of Limited Range Array Elements.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 01 - Basics/Step 1.5 Basic Hashing/Frequencies of Limited Range Array Elements.java -------------------------------------------------------------------------------- /Step 01 - Basics/Step 1.5 Basic Hashing/Frequency of the Most Frequent Element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 01 - Basics/Step 1.5 Basic Hashing/Frequency of the Most Frequent Element.java -------------------------------------------------------------------------------- /Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-I/Bubblesort.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-I/Bubblesort.java -------------------------------------------------------------------------------- /Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-I/Insertionsort.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-I/Insertionsort.java -------------------------------------------------------------------------------- /Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-I/Selectionsort.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-I/Selectionsort.java -------------------------------------------------------------------------------- /Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-II/Mergesort.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-II/Mergesort.java -------------------------------------------------------------------------------- /Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-II/Quicksort.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-II/Quicksort.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Check if array is sorted.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Check if array is sorted.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Find the element that appears once.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Find the element that appears once.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Intersection of two sorted array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Intersection of two sorted array.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Largest Element in Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Largest Element in Array.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Linear Search.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Linear Search.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Longest Sub-Array with Sum K.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Longest Sub-Array with Sum K.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Maximize Number of 1's.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Maximize Number of 1's.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Missing number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Missing number.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Move all zeroes to end of array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Move all zeroes to end of array.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Quick Left Rotation.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Quick Left Rotation.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Remove duplicate elements from sorted Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Remove duplicate elements from sorted Array.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Rotating an Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Rotating an Array.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Row with max 1s.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Row with max 1s.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Search in a matrix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Search in a matrix.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Second Largest element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Second Largest element.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Second Smallest Element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Second Smallest Element.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Union of two sorted array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Union of two sorted array.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/LeetCode/Check if Array Is Sorted and Rotated.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/LeetCode/Check if Array Is Sorted and Rotated.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/LeetCode/Max Consecutive Ones.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/LeetCode/Max Consecutive Ones.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/LeetCode/Missing Number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/LeetCode/Missing Number.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/LeetCode/Move Zeroes.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/LeetCode/Move Zeroes.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/LeetCode/Remove Duplicates from Sorted Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/LeetCode/Remove Duplicates from Sorted Array.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/LeetCode/Rotate Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/LeetCode/Rotate Array.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/LeetCode/Search a 2D Matrix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/LeetCode/Search a 2D Matrix.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.1 Easy/LeetCode/Subarray Sum Equals K.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.1 Easy/LeetCode/Subarray Sum Equals K.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Alternate positive and negative numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Alternate positive and negative numbers.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Find all pairs with a given sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Find all pairs with a given sum.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Kadane's Algorithm.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Kadane's Algorithm.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Leaders in an array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Leaders in an array.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Longest consecutive subsequence.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Longest consecutive subsequence.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Majority Element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Majority Element.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Make Zeroes.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Make Zeroes.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Max sum in sub-arrays.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Max sum in sub-arrays.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Next Permutation.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Next Permutation.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Rotate by 90 degree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Rotate by 90 degree.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Sort an array of 0s, 1s and 2s.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Sort an array of 0s, 1s and 2s.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Spiral Matrix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Spiral Matrix.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Stock buy and sell.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Stock buy and sell.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/LeetCode/Best Time to Buy and Sell Stock.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/LeetCode/Best Time to Buy and Sell Stock.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/LeetCode/Longest Consecutive Sequence.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/LeetCode/Longest Consecutive Sequence.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/LeetCode/Majority Element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/LeetCode/Majority Element.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/LeetCode/Maximum Subarray.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/LeetCode/Maximum Subarray.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/LeetCode/Next Permutation.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/LeetCode/Next Permutation.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/LeetCode/Rearrange Array Elements by Sign.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/LeetCode/Rearrange Array Elements by Sign.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/LeetCode/Rotate Image.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/LeetCode/Rotate Image.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/LeetCode/Set Matrix Zeroes.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/LeetCode/Set Matrix Zeroes.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/LeetCode/Sort Colors.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/LeetCode/Sort Colors.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/LeetCode/Spiral Matrix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/LeetCode/Spiral Matrix.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.2 Medium/LeetCode/Two Sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.2 Medium/LeetCode/Two Sum.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/3 sum closest.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/3 sum closest.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Count Inversions.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Count Inversions.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Find All Four Sum Numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Find All Four Sum Numbers.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Find Missing And Repeating.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Find Missing And Repeating.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Largest subarray with 0 sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Largest subarray with 0 sum.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Maximum Product Subarray.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Maximum Product Subarray.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Merge Without Extra Space.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Merge Without Extra Space.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Overlapping Intervals.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Overlapping Intervals.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Pairwise swap elements of a linked list.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Pairwise swap elements of a linked list.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Pascal Triangle.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Pascal Triangle.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Subsets with XOR value.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Subsets with XOR value.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/LeetCode/3Sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/LeetCode/3Sum.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/LeetCode/4Sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/LeetCode/4Sum.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/LeetCode/Majority Element II.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/LeetCode/Majority Element II.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/LeetCode/Maximum Product Subarray.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/LeetCode/Maximum Product Subarray.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/LeetCode/Merge Intervals.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/LeetCode/Merge Intervals.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/LeetCode/Merge Sorted Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/LeetCode/Merge Sorted Array.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/LeetCode/Pascal's Triangle.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/LeetCode/Pascal's Triangle.java -------------------------------------------------------------------------------- /Step 03 Arrays/Step 3.3 Hard/LeetCode/Reverse Pairs.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 03 Arrays/Step 3.3 Hard/LeetCode/Reverse Pairs.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Binary Search.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Binary Search.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Ceil The Floor.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Ceil The Floor.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Find out how many times has an array been rotated.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Find out how many times has an array been rotated.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/First and last occurrences of x.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/First and last occurrences of x.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Floor in a Sorted Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Floor in a Sorted Array.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/K-th element of two sorted Arrays.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/K-th element of two sorted Arrays.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Minimum element in a sorted and rotated array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Minimum element in a sorted and rotated array.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Number of occurrence.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Number of occurrence.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Peak element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Peak element.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Search in a Rotated Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Search in a Rotated Array.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Search insert position of K in a sorted array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Search insert position of K in a sorted array.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Binary Search.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Binary Search.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Find First and Last Position of Element in Sorted Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Find First and Last Position of Element in Sorted Array.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Find Minimum in Rotated Sorted Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Find Minimum in Rotated Sorted Array.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Find Peak Element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Find Peak Element.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Search Insert Position.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Search Insert Position.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Search in Rotated Sorted Array II.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Search in Rotated Sorted Array II.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Search in Rotated Sorted Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Search in Rotated Sorted Array.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Single Element in a Sorted Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/LeetCode/Single Element in a Sorted Array.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.2 Applying BS on 2D Array/GeeksForGeeks/Median in a row-wise sorted Matrix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.2 Applying BS on 2D Array/GeeksForGeeks/Median in a row-wise sorted Matrix.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.2 Applying BS on 2D Array/GeeksForGeeks/Peak element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.2 Applying BS on 2D Array/GeeksForGeeks/Peak element.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.2 Applying BS on 2D Array/GeeksForGeeks/Search in a matrix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.2 Applying BS on 2D Array/GeeksForGeeks/Search in a matrix.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.2 Applying BS on 2D Array/LeetCode/Find a Peak Element II.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.2 Applying BS on 2D Array/LeetCode/Find a Peak Element II.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.2 Applying BS on 2D Array/LeetCode/Search a 2D Matrix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.2 Applying BS on 2D Array/LeetCode/Search a 2D Matrix.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Allocate minimum number of pages.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Allocate minimum number of pages.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Capacity To Ship Packages Within D Days.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Capacity To Ship Packages Within D Days.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Find Nth root of M.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Find Nth root of M.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/K-th element of two sorted Arrays.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/K-th element of two sorted Arrays.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/K-th missing element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/K-th missing element.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Largest Sum Subarray of Size at least K.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Largest Sum Subarray of Size at least K.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Median of 2 Sorted Arrays of Different Sizes.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Median of 2 Sorted Arrays of Different Sizes.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Square root of a number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Square root of a number.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Capacity To Ship Packages Within D Days.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Capacity To Ship Packages Within D Days.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Find the Smallest Divisor Given a Threshold.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Find the Smallest Divisor Given a Threshold.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Koko Eating Bananas.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Koko Eating Bananas.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Kth Missing Positive Number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Kth Missing Positive Number.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Median of Two Sorted Arrays.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Median of Two Sorted Arrays.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Minimum Number of Days to Make m Bouquets.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Minimum Number of Days to Make m Bouquets.java -------------------------------------------------------------------------------- /Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Split Array Largest Sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Split Array Largest Sum.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Anagram.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Anagram.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Check if strings are rotations of each other or not.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Check if strings are rotations of each other or not.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Isomorphic Strings.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Isomorphic Strings.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Longest Common Prefix in an Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Longest Common Prefix in an Array.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Reverse words in a given string.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Reverse words in a given string.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Isomorphic Strings.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Isomorphic Strings.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Largest Odd Number in String.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Largest Odd Number in String.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Longest Common Prefix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Longest Common Prefix.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Remove Outermost Parentheses.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Remove Outermost Parentheses.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Reverse Words in a String.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Reverse Words in a String.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Rotate String.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Rotate String.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Valid Anagram.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.1 Basic and Easy String Problems/LeetCode/Valid Anagram.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Count number of substrings.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Count number of substrings.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Implement Atoi.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Implement Atoi.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Longest Palindrome in a String.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Longest Palindrome in a String.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Reverse words in a given string.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Reverse words in a given string.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Roman Number to Integer.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Roman Number to Integer.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Sorting Elements of an Array by Frequency.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Sorting Elements of an Array by Frequency.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Longest Palindromic Substring.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Longest Palindromic Substring.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Maximum Nesting Depth of the Parentheses.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Maximum Nesting Depth of the Parentheses.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Reverse Words in a String.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Reverse Words in a String.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Roman to Integer.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Roman to Integer.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Sort Characters By Frequency.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Sort Characters By Frequency.java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/LeetCode/String to Integer (atoi).java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/LeetCode/String to Integer (atoi).java -------------------------------------------------------------------------------- /Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Sum of Beauty of All Substrings.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Sum of Beauty of All Substrings.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.1 1D Linked List/GeeksForGeeks/Count nodes of linked list.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.1 1D Linked List/GeeksForGeeks/Count nodes of linked list.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.1 1D Linked List/GeeksForGeeks/Delete a Node in Single Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.1 1D Linked List/GeeksForGeeks/Delete a Node in Single Linked List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.1 1D Linked List/GeeksForGeeks/Linked List Insertion.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.1 1D Linked List/GeeksForGeeks/Linked List Insertion.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.1 1D Linked List/GeeksForGeeks/LinkedList.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.1 1D Linked List/GeeksForGeeks/LinkedList.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.1 1D Linked List/GeeksForGeeks/Search an element in the LL.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.1 1D Linked List/GeeksForGeeks/Search an element in the LL.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.1 1D Linked List/LeetCode/Delete Node in a Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.1 1D Linked List/LeetCode/Delete Node in a Linked List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.2 Doubly Linked List/GeeksForGeeks/Delete node in Doubly Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.2 Doubly Linked List/GeeksForGeeks/Delete node in Doubly Linked List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.2 Doubly Linked List/GeeksForGeeks/Doubly LinkedList Implementatin.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.2 Doubly Linked List/GeeksForGeeks/Doubly LinkedList Implementatin.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.2 Doubly Linked List/GeeksForGeeks/Doubly linked list Insertion at given position.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.2 Doubly Linked List/GeeksForGeeks/Doubly linked list Insertion at given position.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.2 Doubly Linked List/GeeksForGeeks/Reverse a Doubly Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.2 Doubly Linked List/GeeksForGeeks/Reverse a Doubly Linked List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Add 1 to a number represented as linked list.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Add 1 to a number represented as linked list.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Add two numbers represented by linked lists.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Add two numbers represented by linked lists.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Check if Linked List is Palindrome.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Check if Linked List is Palindrome.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Delete Middle of Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Delete Middle of Linked List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Detect Loop in linked list.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Detect Loop in linked list.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Find length of Loop.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Find length of Loop.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Finding middle element in a linked list.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Finding middle element in a linked list.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Given a linked list of 0s, 1s and 2s, sort it.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Given a linked list of 0s, 1s and 2s, sort it.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Intersection of Two Linked Lists.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Intersection of Two Linked Lists.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Linked List that is Sorted Alternatingly.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Linked List that is Sorted Alternatingly.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Nth node from end of linked list.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Nth node from end of linked list.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Reverse a linked list.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Reverse a linked list.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Segregate even and odd nodes in a Link List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Segregate even and odd nodes in a Link List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Add Two Numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Add Two Numbers.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Delete the Middle Node of a Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Delete the Middle Node of a Linked List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Intersection of Two Linked Lists.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Intersection of Two Linked Lists.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Linked List Cycle II.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Linked List Cycle II.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Linked List Cycle.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Linked List Cycle.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Middle of the Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Middle of the Linked List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Odd Even Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Odd Even Linked List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Palindrome Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Palindrome Linked List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Remove Nth Node From End of List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Remove Nth Node From End of List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Reverse Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Reverse Linked List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Sort List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Sort List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.4 Medium Problem of DLL/GeeksForGeeks/Delete all occurrences of a key in DLL.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.4 Medium Problem of DLL/GeeksForGeeks/Delete all occurrences of a key in DLL.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.4 Medium Problem of DLL/GeeksForGeeks/Find pairs with given sum in DLL.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.4 Medium Problem of DLL/GeeksForGeeks/Find pairs with given sum in DLL.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.4 Medium Problem of DLL/GeeksForGeeks/Remove duplicates from sorted DLL.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.4 Medium Problem of DLL/GeeksForGeeks/Remove duplicates from sorted DLL.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.5 Hard Problem of LL/GeeksForGeeks/Clone a linked list with next and random pointer.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.5 Hard Problem of LL/GeeksForGeeks/Clone a linked list with next and random pointer.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.5 Hard Problem of LL/GeeksForGeeks/Flattening a Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.5 Hard Problem of LL/GeeksForGeeks/Flattening a Linked List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.5 Hard Problem of LL/GeeksForGeeks/Reverse Nodes in k-Group.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.5 Hard Problem of LL/GeeksForGeeks/Reverse Nodes in k-Group.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.5 Hard Problem of LL/GeeksForGeeks/Rotate a Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.5 Hard Problem of LL/GeeksForGeeks/Rotate a Linked List.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.5 Hard Problem of LL/LeetCode/Copy List with Random Pointer.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.5 Hard Problem of LL/LeetCode/Copy List with Random Pointer.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.5 Hard Problem of LL/LeetCode/Reverse Nodes in k-Group.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.5 Hard Problem of LL/LeetCode/Reverse Nodes in k-Group.java -------------------------------------------------------------------------------- /Step 06 LinkedList/Step 6.5 Hard Problem of LL/LeetCode/Rotate List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 06 LinkedList/Step 6.5 Hard Problem of LL/LeetCode/Rotate List.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Good Numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Good Numbers.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Implement Atoi.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Implement Atoi.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Power Of Numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Power Of Numbers.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Reverse a Stack.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Reverse a Stack.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Sort a stack.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Sort a stack.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.1 Get a Strong Hold/LeetCode/Count Good Numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.1 Get a Strong Hold/LeetCode/Count Good Numbers.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.1 Get a Strong Hold/LeetCode/Pow(x, n).java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.1 Get a Strong Hold/LeetCode/Pow(x, n).java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.1 Get a Strong Hold/LeetCode/String to Integer (atoi).java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.1 Get a Strong Hold/LeetCode/String to Integer (atoi).java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Combination Sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Combination Sum.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Generate Parentheses.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Generate Parentheses.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Generate_all_binary_strings.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Generate_all_binary_strings.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Possible Words From Phone Digits.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Possible Words From Phone Digits.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Power Set.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Power Set.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Subset Sums.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Subset Sums.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Combination Sum II.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Combination Sum II.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Combination Sum III.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Combination Sum III.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Combination Sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Combination Sum.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Generate Parentheses.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Generate Parentheses.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Letter Combinations of a Phone Number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Letter Combinations of a Phone Number.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Subsets II.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Subsets II.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Subsets.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Subsets.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/M-Coloring Problem.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/M-Coloring Problem.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/N-Queens.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/N-Queens.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Palindromic Partitioning.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Palindromic Partitioning.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Rat in a Maze Problem - I.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Rat in a Maze Problem - I.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Sudoku Solver.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Sudoku Solver.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Word Break - Part 2.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Word Break - Part 2.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Word Search.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Word Search.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Expression Add Operators.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Expression Add Operators.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/N-Queens.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/N-Queens.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Palindromic Partitioning.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Palindromic Partitioning.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Sudoku Solver.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Sudoku Solver.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Word Break.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Word Break.java -------------------------------------------------------------------------------- /Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Word Search.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Word Search.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Check whether K-th bit is set or not.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Check whether K-th bit is set or not.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Count total set bits.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Count total set bits.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Division without using multiplication, division and mod operator.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Division without using multiplication, division and mod operator.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Odd or Even.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Odd or Even.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Power of 2.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Power of 2.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Set the rightmost unset bit.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Set the rightmost unset bit.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Swap two numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Swap two numbers.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/Leetcode/Divide Two Integers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/Leetcode/Divide Two Integers.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/Leetcode/Power of Two.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/Leetcode/Power of Two.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.2 Interview Problems/GeeksForGeeks/Bit Difference.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.2 Interview Problems/GeeksForGeeks/Bit Difference.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.2 Interview Problems/GeeksForGeeks/Exceptionally odd.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.2 Interview Problems/GeeksForGeeks/Exceptionally odd.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.2 Interview Problems/GeeksForGeeks/Power Set.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.2 Interview Problems/GeeksForGeeks/Power Set.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.2 Interview Problems/GeeksForGeeks/Two numbers with odd occurrences.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.2 Interview Problems/GeeksForGeeks/Two numbers with odd occurrences.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.2 Interview Problems/Leetcode/Minimum Bit Flips to Convert Number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.2 Interview Problems/Leetcode/Minimum Bit Flips to Convert Number.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.2 Interview Problems/Leetcode/Single Number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.2 Interview Problems/Leetcode/Single Number.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.2 Interview Problems/Leetcode/Subsets.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.2 Interview Problems/Leetcode/Subsets.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.3 Advance Maths/GeeksForGeeks/Power Of Numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.3 Advance Maths/GeeksForGeeks/Power Of Numbers.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.3 Advance Maths/GeeksForGeeks/Prime Factors.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.3 Advance Maths/GeeksForGeeks/Prime Factors.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.3 Advance Maths/GeeksForGeeks/Sieve of Eratosthenes.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.3 Advance Maths/GeeksForGeeks/Sieve of Eratosthenes.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.3 Advance Maths/Leetcode/Count Primes.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.3 Advance Maths/Leetcode/Count Primes.java -------------------------------------------------------------------------------- /Step 08 Bit Manipulation/Step 8.3 Advance Maths/Leetcode/Pow(x, n).java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 08 Bit Manipulation/Step 8.3 Advance Maths/Leetcode/Pow(x, n).java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Get minimum element from stack.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Get minimum element from stack.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Implement Queue using Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Implement Queue using Linked List.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Implement Queue using array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Implement Queue using array.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Implement Stack using Linked List.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Implement Stack using Linked List.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Implement stack using array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Implement stack using array.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Parenthesis Checker.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Parenthesis Checker.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Queue using stack.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Queue using stack.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Stack using two queues.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Stack using two queues.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Implement Queue using Stacks.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Implement Queue using Stacks.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Implement Stack using Queues.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Implement Stack using Queues.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Min Stack.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Min Stack.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Valid Parentheses.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Valid Parentheses.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.2 Prefix, Infix, PostFix Conversion Problems/GeeksForGeeks/Infix to Postfix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.2 Prefix, Infix, PostFix Conversion Problems/GeeksForGeeks/Infix to Postfix.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Immediate Smaller Element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Immediate Smaller Element.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Max rectangle.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Max rectangle.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Maximum Rectangular Area in a Histogram.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Maximum Rectangular Area in a Histogram.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Next Greater Element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Next Greater Element.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Remove K Digits.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Remove K Digits.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Stock span problem.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Stock span problem.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Trapping Rain Water.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/GeeksForGeeks/Trapping Rain Water.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Asteroid Collision.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Asteroid Collision.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Largest Rectangle in Histogram.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Largest Rectangle in Histogram.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Maximal Rectangle.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Maximal Rectangle.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Next Greater Element I.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Next Greater Element I.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Next Greater Element II.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Next Greater Element II.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Online Stock Span.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Online Stock Span.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Remove K Digits.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Remove K Digits.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Sum of Subarray Minimums.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Sum of Subarray Minimums.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Sum of Subarray Ranges.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Sum of Subarray Ranges.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Trapping Rain Water.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Trapping Rain Water.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/LRU Cache.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/LRU Cache.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/Maximum of all subarrays of size k.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/Maximum of all subarrays of size k.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/Rotten Oranges.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/Rotten Oranges.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/Stock span problem.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/Stock span problem.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/The Celebrity Problem.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/The Celebrity Problem.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/LFU Cache.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/LFU Cache.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/LRU Cache.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/LRU Cache.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/Online Stock Span.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/Online Stock Span.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/Rotting Oranges.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/Rotting Oranges.java -------------------------------------------------------------------------------- /Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/Sliding Window Maximum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/Sliding Window Maximum.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/GeeksForGeeks/Count Subarray with k odds.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/GeeksForGeeks/Count Subarray with k odds.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/GeeksForGeeks/Count Substring.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/GeeksForGeeks/Count Substring.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/GeeksForGeeks/Length of the longest substring.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/GeeksForGeeks/Length of the longest substring.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/GeeksForGeeks/Maximum Consecutive Ones.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/GeeksForGeeks/Maximum Consecutive Ones.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Binary Subarrays With Sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Binary Subarrays With Sum.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Count Number of Nice Subarrays.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Count Number of Nice Subarrays.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Longest Repeating Character Replacement.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Longest Repeating Character Replacement.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Longest Substring Without Repeating Characters.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Longest Substring Without Repeating Characters.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Max Consecutive Ones III.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Max Consecutive Ones III.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Maximum Points You Can Obtain from Cards.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Maximum Points You Can Obtain from Cards.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Number of Substrings Containing All Three Characters.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.1 Medium Problems/LeetCode/Number of Substrings Containing All Three Characters.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.2 Hard Problems/GeeksForGeeks/Longest K unique characters substring.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.2 Hard Problems/GeeksForGeeks/Longest K unique characters substring.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.2 Hard Problems/GeeksForGeeks/Smallest window in a string containing all the characters of another string.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.2 Hard Problems/GeeksForGeeks/Smallest window in a string containing all the characters of another string.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.2 Hard Problems/LeetCode/Minimum Window Substring.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.2 Hard Problems/LeetCode/Minimum Window Substring.java -------------------------------------------------------------------------------- /Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.2 Hard Problems/LeetCode/Subarrays with K Different Integers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.2 Hard Problems/LeetCode/Subarrays with K Different Integers.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.1 Learning/GeeksForGeeks/Binary Heap Operations.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.1 Learning/GeeksForGeeks/Binary Heap Operations.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.1 Learning/GeeksForGeeks/Does array represent Heap.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.1 Learning/GeeksForGeeks/Does array represent Heap.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.2 Medium Problems/GeeksForGeeks/K largest elements.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.2 Medium Problems/GeeksForGeeks/K largest elements.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.2 Medium Problems/GeeksForGeeks/Kth smallest element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.2 Medium Problems/GeeksForGeeks/Kth smallest element.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.2 Medium Problems/GeeksForGeeks/Merge K sorted linked lists.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.2 Medium Problems/GeeksForGeeks/Merge K sorted linked lists.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.2 Medium Problems/GeeksForGeeks/Merge k Sorted Arrays.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.2 Medium Problems/GeeksForGeeks/Merge k Sorted Arrays.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.2 Medium Problems/LeetCode/Hand of Straights.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.2 Medium Problems/LeetCode/Hand of Straights.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.2 Medium Problems/LeetCode/Kth Largest Element in an Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.2 Medium Problems/LeetCode/Kth Largest Element in an Array.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.2 Medium Problems/LeetCode/Merge k Sorted Lists.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.2 Medium Problems/LeetCode/Merge k Sorted Lists.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.2 Medium Problems/LeetCode/Task Scheduler..java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.2 Medium Problems/LeetCode/Task Scheduler..java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.3 Hard Problems/GeeksForGeeks/Find median in a stream.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.3 Hard Problems/GeeksForGeeks/Find median in a stream.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.3 Hard Problems/GeeksForGeeks/Kth largest element in a stream.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.3 Hard Problems/GeeksForGeeks/Kth largest element in a stream.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.3 Hard Problems/GeeksForGeeks/Rod Cutting.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.3 Hard Problems/GeeksForGeeks/Rod Cutting.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.3 Hard Problems/GeeksForGeeks/Top K Frequent Elements in Array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.3 Hard Problems/GeeksForGeeks/Top K Frequent Elements in Array.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.3 Hard Problems/LeetCode/Design Twitter.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.3 Hard Problems/LeetCode/Design Twitter.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.3 Hard Problems/LeetCode/Find Median from Data Stream.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.3 Hard Problems/LeetCode/Find Median from Data Stream.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.3 Hard Problems/LeetCode/Kth Largest Element in a Stream.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.3 Hard Problems/LeetCode/Kth Largest Element in a Stream.java -------------------------------------------------------------------------------- /Step 11 Heaps/Step 11.3 Hard Problems/LeetCode/Top K Frequent Elements.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 11 Heaps/Step 11.3 Hard Problems/LeetCode/Top K Frequent Elements.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.1 Easy Problems/GeeksForGeeks/Fractional Knapsack.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.1 Easy Problems/GeeksForGeeks/Fractional Knapsack.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.1 Easy Problems/GeeksForGeeks/Minimum number of Coins.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.1 Easy Problems/GeeksForGeeks/Minimum number of Coins.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.1 Easy Problems/GeeksForGeeks/Parenthesis Checker.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.1 Easy Problems/GeeksForGeeks/Parenthesis Checker.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.1 Easy Problems/LeetCode/Assign Cookies.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.1 Easy Problems/LeetCode/Assign Cookies.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.1 Easy Problems/LeetCode/Lemonade Change.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.1 Easy Problems/LeetCode/Lemonade Change.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.1 Easy Problems/LeetCode/Valid Parenthesis String.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.1 Easy Problems/LeetCode/Valid Parenthesis String.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Job Sequencing Problem.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Job Sequencing Problem.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Jump Game.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Jump Game.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Minimum Platforms.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Minimum Platforms.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Minimum number of jumps.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Minimum number of jumps.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/N meetings in one room.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/N meetings in one room.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Overlapping Intervals.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Overlapping Intervals.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Page Faults in LRU.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Page Faults in LRU.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/LeetCode/Candy.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/LeetCode/Candy.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/LeetCode/Insert Interval.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/LeetCode/Insert Interval.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/LeetCode/Jump Game II.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/LeetCode/Jump Game II.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/LeetCode/Jump Game.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/LeetCode/Jump Game.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/LeetCode/Merge Intervals.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/LeetCode/Merge Intervals.java -------------------------------------------------------------------------------- /Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/LeetCode/Non-overlapping Intervals.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/LeetCode/Non-overlapping Intervals.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.1 Traversals/GeeksForGeeks/Inorder Traversal.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.1 Traversals/GeeksForGeeks/Inorder Traversal.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.1 Traversals/GeeksForGeeks/Level order traversal in spiral form.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.1 Traversals/GeeksForGeeks/Level order traversal in spiral form.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.1 Traversals/GeeksForGeeks/Postorder Traversal.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.1 Traversals/GeeksForGeeks/Postorder Traversal.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.1 Traversals/GeeksForGeeks/Preorder Inorder Postorder Traversals in One Traversal.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.1 Traversals/GeeksForGeeks/Preorder Inorder Postorder Traversals in One Traversal.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.1 Traversals/GeeksForGeeks/Preorder Traversal.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.1 Traversals/GeeksForGeeks/Preorder Traversal.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.1 Traversals/LeetCode/Binary Tree Inorder Traversal.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.1 Traversals/LeetCode/Binary Tree Inorder Traversal.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.1 Traversals/LeetCode/Binary Tree Level Order Traversal.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.1 Traversals/LeetCode/Binary Tree Level Order Traversal.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.1 Traversals/LeetCode/Binary Tree Postorder Traversal.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.1 Traversals/LeetCode/Binary Tree Postorder Traversal.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.1 Traversals/LeetCode/Binary Tree Preorder Traversal.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.1 Traversals/LeetCode/Binary Tree Preorder Traversal.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Bottom View of Binary Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Bottom View of Binary Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Boundary Traversal of binary tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Boundary Traversal of binary tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Check for Balanced Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Check for Balanced Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Determine if Two Trees are Identical.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Determine if Two Trees are Identical.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Diameter of a Binary Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Diameter of a Binary Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Height of Binary Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Height of Binary Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Left View of Binary Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Left View of Binary Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Maximum path sum from any node.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Maximum path sum from any node.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Symmetric Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Symmetric Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Top View of Binary Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Top View of Binary Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Vertical Traversal of Binary Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Vertical Traversal of Binary Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/ZigZag Tree Traversal.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/ZigZag Tree Traversal.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Balanced Binary Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Balanced Binary Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Binary Tree Maximum Path Sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Binary Tree Maximum Path Sum.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Binary Tree Right Side View.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Binary Tree Right Side View.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Binary Tree Zigzag Level Order Traversal.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Binary Tree Zigzag Level Order Traversal.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Diameter of Binary Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Diameter of Binary Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Maximum Depth of Binary Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Maximum Depth of Binary Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Same Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Same Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Symmetric Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Symmetric Tree.java -------------------------------------------------------------------------------- /Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Vertical Order Traversal of a Binary Tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet/HEAD/Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Vertical Order Traversal of a Binary Tree.java --------------------------------------------------------------------------------