Problems # Status Problem Level Completes Likes 316 Algorithm to calculate power(k,n). Beginner % 0 317 Find remainder without using modulo operator Beginner % 0 318 Swap two numbers without using extra variable Beginner % 0 319 Number of 1’s in bit representation of a number Beginner % 0 320 Stock Single Sell Problem - O(n) Solution Hard % 1 321 Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Hard % 0 322 Maximum difference between two elements where larger element appears after the smaller element Medium % 0 323 Find the right most unset bit OR zero bit of a number Beginner % 0 324 Find the two repeating elements in a given array | 6 Approaches Medium % 1 325 Find the right most set bit of a number Beginner % 0 326 Find two elements whose sum is closest to zero Medium % 0 327 Find the element which appears maximum number of times in the array. Medium % 0 328 Find duplicates in an given array in O(n) time and O(1) extra space. Medium % 0 329 Find the last non repeating character in a given string. Beginner % 0 330 Find the last repeating character in a given string. Beginner % 0 331 Find the first non repeating character in a given string Beginner % 0 332 Find the first repeating character in a given string Beginner % 0 333 k-Nearest Neighbors Hard % 0 334 Find longest Snake sequence in a given matrix Medium % 0 335 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 0 336 Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Medium % 0 337 Reverse the given Array without using built in function Beginner % 0 338 Print All Diagonals of a given matrix Medium % 0 339 Dynamic Programming - Edit Distance Problem Hard % 1 340 Dynamic Programming - Coin In a Line Game Problem Hard % 0 341 Dynamic Programming - Box Stacking Problem Hard % 0 342 Dynamic Programming - Split the String into Minimum number of Palindromes. Hard % 0 343 Dynamic Programming - Highway Billboard Problem Hard % 0 344 Dynamic Programming - Maximum Subarray Problem Medium % 0 345 Kadane's Algorithm - Maximum Subarray Problem Medium % 0 346 Convert Binary Tree into Threaded Binary Tree Hard % 0 347 Double Threaded Binary Tree Complete Implementation Hard % 0 348 Single Threaded Binary Tree Complete Implementation Hard % 0 349 Introduction to Threaded Binary Tree Medium % 0 350 Implement Stack Using Linked List Beginner % 0 Algorithm to calculate power(k,n). Find remainder without using modulo operator Swap two numbers without using extra variable Number of 1’s in bit representation of a number Stock Single Sell Problem - O(n) Solution Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Maximum difference between two elements where larger element appears after the smaller element Find the right most unset bit OR zero bit of a number Find the two repeating elements in a given array | 6 Approaches Find the right most set bit of a number Find two elements whose sum is closest to zero Find the element which appears maximum number of times in the array. Find duplicates in an given array in O(n) time and O(1) extra 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 k-Nearest Neighbors Find longest Snake sequence in a given matrix Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Reverse the given Array without using built in function Print All Diagonals of a given matrix Dynamic Programming - Edit Distance Problem Dynamic Programming - Coin In a Line Game Problem Dynamic Programming - Box Stacking Problem Dynamic Programming - Split the String into Minimum number of Palindromes. Dynamic Programming - Highway Billboard Problem Dynamic Programming - Maximum Subarray Problem Kadane's Algorithm - Maximum Subarray Problem Convert Binary Tree into Threaded Binary Tree Double Threaded Binary Tree Complete Implementation Single Threaded Binary Tree Complete Implementation Introduction to Threaded Binary Tree Implement Stack Using Linked List 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
