Return Sum 25.0% Easy Free Return Sum of 3 0% Easy Free Better Math 0% Easy Free Programmatically group menu items 0% Medium Free Validate a form 0% Medium Free Combine JS/CSS 0% Easy Free Implement an Elevator 0% Hard Free Maximize the number of toys that can be purchased 68.2% Easy Free Swapping Dominoes 0% Medium Free String pattern matching 84.0% Easy Free Fix student name string matching challenge 84.0% Medium Free Preparation for exam 0% Easy Free Find the common friend. 0% Easy Free Group dealing with a mission array coding challenge 75.0% Medium Premium Word association game string question 84.0% Easy Premium An architect building an apartment 0% Medium Free Sorting: Document file for results 0% Medium Free Arrange files in ascending order 84.0% Medium Premium Programming language project 0% Medium Free Special type of musical instrument 84.0% Easy Premium Minimum time for production 62.5% Medium Premium To solve math problem 84.0% Medium Premium Insert missing position 0% Easy Free Make two strings alike. 84.0% Easy Premium arrange wooden sticks 84.0% Hard Premium Scrabble game 0% Hard Free Pass the item. 0% Medium Free Pair for debate competition 0% Medium Free Sort in alphabetically ascending order 0% Expert Free Make group of three numbers 0% Medium Free Collect movie tickets 0% Medium Free Curzon Number 84.0% Easy Premium Clues by anagrams 0% Medium Free Number Cards 0% Medium Free Peter and the job 84.0% Hard Premium Message notification 0% Medium Free Assignment and Deletions 84.0% Easy Premium The name of the new-born Prince 0% Medium Free The name of the new product 83.3% Medium Premium Grasping Shopkeeper 0% Medium Free Order of the Alphabets 0% Expert Free Minimum distance between the Places 84.0% Medium Premium Portal and the password 0% Medium Free Team selection 84.0% Medium Premium Mr. X and the Formula 0% Medium Free Matching Two Words 0% Medium Free Minimum Sweets 0% Medium Free Area of Buildings 0% Medium Free Max Min 84.0% Medium Premium Dying Plants 84.0% Hard Premium Node in Linked List 0% Easy Free Node in Doubly-Linked List 0% Easy Free Converse the Order of Nodes 0% Easy Free Intersecting Points of Two Lists 0% Easy Free The Fibonacci Series 0% Easy Free Crossword 0% Medium Free Kidnapper and Note 0% Easy Free Bubble Sorting 0% Easy Free Making Anagrams 0% Easy Free Minimum Differences 84.0% Easy Premium Ice-cream Flavours 0% Medium Free Bake Factory 0% Hard Free Modulus of Subarrays 84.0% Hard Premium Cycle in Linked Lists 0% Easy Free Grid Game 0% Medium Free Deci-Binary 0% Medium Free Flipping bits 84.0% Easy Premium Primality Test 84.0% Medium Premium F.R.I.E.N.D.S 0% Medium Free Greatest Exclusive Or 0% Medium Free Kelvin Climbs 84.0% Medium Premium Equal to Sum 0% Easy Free Count the Triplets 22.2% Easy Premium Max Sum of Subarray 0% Medium Free Missing Element 84.0% Easy Premium Merging Two Arrays 84.0% Hard Premium Modify the Array 84.0% Medium Premium Power of Pair 26.7% Medium Premium Zeros, Ones and Twos 84.0% Easy Premium Equilibrium Value 0% Easy Free Finding Leader 84.0% Easy Premium Reverse Sub-Array 84.0% Easy Premium Railway Platforms 0% Medium Free Smallest at Position 84.0% Medium Premium Rain Water 0% Medium Free Pythagoras 84.0% Easy Premium Left and Right 84.0% Easy Premium Zig-Zag 84.0% Easy Premium Profit on Sell 0% Medium Free Last Index 0% Easy Free Matrix in Spiral 0% Medium Free Form Largest Number 0% Medium Free Possibilities 0% Easy Free Palindrome in String 84.0% Medium Premium Remove Adjacent Duplicates 84.0% Medium Premium Integer and Roman 84.0% Easy Premium Rotate the String 0% Easy Free Remove Similar Characters 84.0% Easy Premium Forming Palindrome 84.0% Medium Premium Sub string with Distinct Characters 60.0% Easy Premium String to Integer (atoi) 84.0% Medium Premium Find the Index 84.0% Easy Premium Common Prefix 0% Easy Free Middle of LinkedList 0% Easy Free Reversing 0% Easy Free Rotating 0% Easy Free Reversing of Groups 0% Medium Free Intersection 0% Medium Free Loop Detection 0% Easy Free Removing Loop 0% Medium Free Finding Node 0% Easy Free Narrowing the Linked List 0% Medium Free Merging 0% Medium Free Swapping 0% Easy Free Adding Two Lists 0% Easy Free Palindrome or Not 0% Easy Free Stack and Linked List 0% Easy Free Sort the Linked List 0% Easy Free Without Head Pointer 0% Medium Free Check for Brackets 0% Medium Free Bigger Element 84.0% Medium Premium Two Stacks and A Queue 0% Easy Free Two Queues and A Stack 0% Easy Free Obtain Minimum 0% Medium Free Queue and Linked List 0% Easy Free Petrol and Distance 0% Medium Free Fresh and Rotten 0% Medium Free Design Cache 0% Medium Free Non-repeating Character 0% Medium Free Max from Subarray 84.0% Medium Premium Median in Stream 0% Hard Free Heap Sort 84.0% Easy Premium Reset Characters 0% Medium Free nth Largest 0% Medium Free Binary Heap 0% Easy Free Merge Linked Lists 0% Medium Free Several Ways 84.0% Easy Premium Designed Keyboard 20.0% Easy Premium Safe Position 84.0% Easy Premium Colored Pixels 0% Medium Free Same Sorting 0% Medium Free Sorting by Frequency 84.0% Medium Premium 0 Sum Subarray 84.0% Easy Premium Quadruple Sum 77.8% Medium Premium List form by Common Elements 0% Easy Free Swapping Elements 0% Easy Free Count Distinct Elements in Array 84.0% Easy Premium Divisible by X 84.0% Easy Premium Consecutive Sub-Sequence 84.0% Medium Premium Subset of Another 0% Easy Free Pair having Sum 0% Easy Free Repeated Character 84.0% Easy Premium Sum Equal to 0 0% Medium Free Same Characters 84.0% Easy Premium Equality of Arrays 0% Easy Free Not Same Characters 84.0% Easy Premium Smallest Substring 0% Medium Free First Occuring Element 0% Easy Free Equal Frequency 84.0% Easy Premium Working Time 0% Easy Free Meeting Room 0% Easy Free Form Digit 0% Easy Free Height of Towers 84.0% Medium Premium Arrays: Sum of Product 0% Easy Free Huffman Coding 0% Easy Free Collecting Balls 0% Medium Free Candy Store 0% Easy Free LRU Algorithm 84.0% Medium Premium Piles of Coins 0% Medium Free Operations 0% Easy Free Forming Chains 0% Medium Free Longest Substring 0% Medium Free Longest Subsequence 84.0% Medium Premium Longest Similar Subsequence 84.0% Medium Premium Increasing Subsequence Sum 84.0% Medium Premium Backpack Issue 0% Easy Free Jump to Last 84.0% Medium Premium Change for Coin 0% Medium Free Partition of Array 84.0% Medium Premium Cutting Length 0% Easy Free Stack the Boxes 0% Medium Free Minimum Difference Subarray 84.0% Hard Premium Hopping Rabbit 87.5% Easy Premium Collect Coins 84.0% Medium Premium Common Supersequence 84.0% Easy Premium Element Appears Once 84.0% Easy Premium Search X Element 84.0% Easy Premium Binary Search 84.0% Easy Premium Addition of Middle Elements 0% Medium Free Quick Sort 0% Medium Free Merge Sort 84.0% Medium Premium X-th Element 84.0% Medium Premium Maze Runner 0% Medium Free Wonder Word 0% Medium Free Form IP Address From String 84.0% Medium Premium First Set Bit 84.0% Easy Premium Different Bit at Right 84.0% Easy Premium X-th Bit is Set or Not 0% Easy Free Toggle Bits 84.0% Easy Premium Flipping 84.0% Easy Premium Rotating Bits 0% Easy Free Swap Odd and Even 84.0% Easy Premium Total Set Bits 84.0% Medium Premium Consecutive 1's 84.0% Easy Premium Sparse or Not 84.0% Easy Premium Single Person 0% Medium Free Maximum XOR 84.0% Hard Premium Repeating and Missing 0% Medium Free Index Difference 66.7% Medium Premium No Continuous 1's 84.0% Medium Premium Elements in Majority 0% Medium Free Sum Closest to 0 84.0% Medium Premium Bolts and Nuts 0% Medium Free Modification of Matrix 0% Medium Free Positive Missing Number 84.0% Medium Premium Caterpillars and Leaves 0% Easy Free Repeating Strings 0% Medium Free Camel Case 0% Medium Free Shorter URL 84.0% Medium Premium Ignore Repeating String 84.0% Easy Premium Do not Repeat Character 20.0% Easy Premium Check for Rotations 0% Easy Free Jarvis and Ironman 0% Easy Free Common Character and Concatenate 84.0% Easy Premium Colors and Strings 0% Easy Free Second Most Repeated 0% Easy Free Depth First Traversal 0% Easy Free Breadth First Traversal 0% Easy Free Cycle in Undirected Graph 0% Medium Free Cycle in Directed Graph 0% Medium Free Topological Sorting 0% Medium Free Islands 0% Medium Free Dijkstra Algorithm 0% Medium Free Number of Swaps 84.0% Medium Premium Strong Bonds 0% Medium Free Minimum Steps 0% Medium Free Short Path 0% Medium Free Min Cost Path 0% Hard Free Circle Formation 0% Medium Free Distance Between Vertices 0% Medium Free Dictionary For Aliens 0% Hard Free Snake and Ladder 0% Medium Free Left View 0% Easy Free BST 0% Easy Free Bottom View 0% Medium Free Vertical Traversal 0% Medium Free Spiral Order 0% Easy Free Connecting Nodes 0% Medium Free Lowest Common Ancestors 0% Easy Free BT into DLL 0% Hard Free Symmetric or Not 0% Easy Free Identical Trees 0% Easy Free Binary Tree Height 0% Easy Free Max Sum of Leaf Node 0% Hard Free BT Diameter 0% Easy Free Counting Leaves 0% Easy Free Balance the Height 0% Easy Free Serialize and Deserialize 0% Medium Free Longest Sequence 0% Easy Free Mirror of Tree 0% Easy Free Missing Positive Integer 84.0% Hard Premium A Pair 0% Hard Premium XOR Linked List 0% Expert Premium Encoded Message 0% Hard Premium Unival Subtrees 0% Medium Premium Big Sum 84.0% Expert Premium Job Scheduler 0% Hard Premium Autocomplete System 0% Hard Premium Substring with Distinct Characters 0% Expert Premium Area of Circle 0% Hard Premium Uniform Probability 0% Hard Premium Record Ids 0% Medium Premium File System 0% Expert Premium Max Value of Subarray 0% Expert Premium Coloring Houses 0% Hard Premium Intersecting Nodes 0% Medium Premium Time Overlapping 0% Premium Sentence in a List 0% Premium Start End 0% Premium Node Class 0% Premium Product array 0% Expert Free test question 0% Easy Free Add up to make equal 84.0% Medium Free Return product except one at [i] 84.0% Expert Free Serialize and De-serialize 0% Hard Free Lowest Positive Integer 33.3% Expert Free Return first and last element from pair 0% Hard Free Ways message can be decoded 90.9% Hard Free Count universal sub-tree 0% Medium Free largest sum of non-adjacent numbers. 33.3% Expert Free Return string with given prefix 84.0% Hard Free Staircase Problem 84.0% Expert Free K-Longest Substring 0% Expert Free e-commerce website 0% Medium Free length of the longest absolute path to a file 0% Expert Free return the maximum values of subarray 84.0% Expert Free return the minimum cost 0% Hard Free return the intersecting node 0% Medium Free return minimum number of rooms required 0% Medium Free return possible reconstruction 0% Hard Free least number of steps required 0% Medium Free string matches the regular expression 0% Expert Free remove the kth last element 0% Hard Free round, curly, and square brackets 0% Medium Free return a list of strings that represents each line 0% Hard Free Run-length encoding 0% Medium Free two-dimensional elevation 84.0% Hard Free distance between two strings 84.0% Medium Free stream of numbers 84.0% Medium Free palindrome of minimum length 84.0% Hard Free Segregate the values of the array 84.0% Expert Free second-largest node in the tree 0% Hard Free The power set 0% Medium Free N by N board 0% Expert Free two-dimensional board of square cells 0% Hard Free non-duplicated integer 84.0% Expert Free compute the person's itinerary 0% Hard Free subset of S 0% Expert Free parameter(s) 0% Medium Free counting the number of inversions 84.0% Hard Free longest palindromic contiguous substring 0% Hard Free stock prices of a company 84.0% Medium Free pre-order and in-order traversals of a binary tree 0% Hard Free Maximum subarray sum 84.0% Hard Free arithmetic expression is given as a binary tree 0% Medium Free shuffles a deck of cards 0% Hard Free LRU (Least Recently Used) cache 0% Expert Free queue using two stacks 0% Expert Free Sudoku 0% Expert Free undirected graph 0% Hard Free string s and an integer k 0% Hard Free index of the element in the array 84.0% Hard Free multiset of integers 0% Hard Free integer exponentiation 0% Hard Premium N by M matrix of zeroes 0% Hard Free 2D matrix of characters and a target word 0% Medium Free N by M matrix of numbers 0% Medium Free non-decreasing array 0% Hard Free two bishops attack each other 0% Hard Free largest product 84.0% Medium Free sum up to exactly 10 84.0% Medium Free directed graph 0% Expert Free head of a singly linked list 84.0% Medium Free multiplication table 84.0% Hard Premium longest increasing subsequence 84.0% Expert Free matrix of lowercase letters 0% Hard Free overlapping intervals 0% Medium Free sorted singly-linked lists 0% Hard Free deepest node 0% Medium Free mapping of digits to letters 0% Hard Free read7() method 0% Medium Free invert a Binary tree 0% Hard Free number of "islands" 0% Hard Free string of parentheses 0% Hard Free division of two positive integers 84.0% Hard Free valid binary search 0% Hard Free Generate a number from 0 to n-1 which are not in an array 0% Hard Free largest tree/subtree 0% Expert Free maximum path sum 0% Medium Free possible permutations 0% Medium Free sequentially adjacent cell 0% Medium Free longest consecutive elements 84.0% Hard Free infinite 2D grid 0% Medium Free two prime numbers 84.0% Medium Free contiguous elements of the list 84.0% Hard Free shortest substring 50.0% Hard Free linked list is a palindrome 0% Medium Free number of Jumps 0% Hard Free nodes in a binary tree level-wise. 0% Medium Free Can we shift string A to string B? 84.0% Medium Free 