# Status Problem video Level Completes Likes 215 Find duplicates in an given array in O(n) time and O(1) space Medium % 0 214 Find the last non repeating character in a given string. Beginner % 0 213 Find the last repeating character in a given string Beginner % 0 212 Find the first non repeating character in a given string Beginner % 0 211 Find the first repeating character in a given string Beginner % 0 205 Print All Diagonals of a given matrix Medium % 1 198 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 193 Implement Stack Using Linked List Beginner % 0 187 Reverse Alternative 'k' nodes in a Linked List. Medium % 0 186 Reverse a Linked List in groups of given size 'K' Medium % 0 155 Find the Kth Smallest/Largest Element in an Array Using Heap Beginner % 0 146 Dynamic Programming - Stairs Climbing Puzzle Beginner % 1 141 Find the Single Occurrence Element in an Array (Odd One Out) Beginner % 1 140 Rearrange Array Elements (A[i] = i) | In-place Approach Medium % 0 139 Find Missing Numbers in Sequences - XOR Method Beginner % 1 138 Find the Maximum Value in a Binary Tree Beginner % 0 132 Find the Deepest Node in a Binary Tree Medium % 1 127 Numbers Palindrome in Both Decimal and Octal Beginner % 0 125 Find the Increasing Triplet Sub-sequence in an array Medium % 0 120 Convert Decimal to Irreducible Fraction (Simplified Form) Beginner % 0 Find duplicates in an given array in O(n) time and O(1) space Find the last non repeating character in a given string. Find the last repeating character in a given string Find the first non repeating character in a given string Find the first repeating character in a given string Print All Diagonals of a given matrix Kadane's Algorithm - Maximum Subarray Problem Implement Stack Using Linked List Reverse Alternative 'k' nodes in a Linked List. Reverse a Linked List in groups of given size 'K' Find the Kth Smallest/Largest Element in an Array Using Heap Dynamic Programming - Stairs Climbing Puzzle Find the Single Occurrence Element in an Array (Odd One Out) Rearrange Array Elements (A[i] = i) | In-place Approach Find Missing Numbers in Sequences - XOR Method Find the Maximum Value in a Binary Tree Find the Deepest Node in a Binary Tree Numbers Palindrome in Both Decimal and Octal Find the Increasing Triplet Sub-sequence in an array Convert Decimal to Irreducible Fraction (Simplified Form) 1 2 3 4 5 6 7 8
