You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
- Luck Balance (Greedy)
- Marc's Cakewalk (Greedy)
- Minimum absolute difference in an array (Greedy)
- Angry Professor (Implementation)
- Apple and Orange (Implementation)
- Beautiful days at the movies (Implementation)
- Beautiful Triplets (Implementation)
- Between Two Sets (Implementation)
- Birthday Chocolate (Implementation)
- Bon Appetit (Implementation)
- Breaking the records (Implementation)
- Cats and Mouse (Implementation)
- Cavity Map (Implementation)
- Circular Array Rotation (Implementation)
- Counting Valleys (Implementation)
- Cut the Sticks (Implementation)
- Day of the Programmer (Implementation)
- Designer PDF Viewer (Implementation)
- Divisible Sum Pair (Implementation)
- Drawing Book (Implementation)
- Electronics Shop (Implementation)
- Equalize the Array (Implementation)
- Fair Rations (Implementation)
- Find Digits (Implementation)
- Forming a Magic Square (Implementation)
- Grading Student (Implementation)
- Jumping on the Clouds (Implementation)
- Kangaroo (Implementation)
- Library Fine (Implementation)
- Lisa's Workbook (Implementation)
- Migratory Birds (Implementation)
- Minimum Distances (Implementation)
- Picking Numbers (Implementation)
- Repeated String (Implementation)
- Save the Prisoner (Implementation)
- Sequence Equation (Implementation)
- Service Lane (Implementation)
- Sherlock and Square (Implementation)
- Sock Merchant (Implementation)
- Taum and Birthday (Implementation)
- The Hurdle Race (Implementation)
- Utopian Tree (Implementation)
- Viral Advertising (Implementation)
- Correctness and the Loop Invariant (Sorting)
- Counting Sort I (Sorting)
- Insertion Sort Part I (Sorting)
- Insertion Sort Part II (Sorting)
- Intro to Tutorial Challenges (Sorting)
- Quicksort 1 - Partition (Sorting)
- Quicksort 2 - Sorting (Sorting)
- Running Time of Algorithm (Sorting)
- Alternating Characters (Strings)
- Anagram (Strings)
- Beautiful Binary String (Strings)
- Camel Case (Strings)
- Funny String (Strings)
- Game of Thrones I (Strings)
- Gemstones (Strings)
- Hackerrank in a String (Strings)
- Making Anagrams (Strings)
- Mars Exploration (Strings)
- Pangrams (Strings)
- Separate the Numbers (Strings)
- String Construction (Strings)
- Super Reduced String (Strings)
- The Love Letter Mystery (Strings)
- Two Strings (Strings)
- A very big Sum (Warm up)
- Birthday Cake Candle (Warm up)
- Compare the Triplets (Warm up)
- Diagonal Difference (Warm up)
- Min-Max Sum (Warm up)
- Plus Minus (Warm up)
- Simple Array Sum (Warm up)
- Solve Me First (Warm up)
- Staircase (Warm up)
- Time Conversion (Warm up)
Medium
- Full Counting Sort (Sorting)
Data Structures
Easy
- 2D Array (Arrays)
- Dynamic Array (Arrays)
- Left Rotation (Arrays)
- Delete a Node (Linked Lists)
- Print in Reverse (Linked Lists)
- Print the Elements (Linked Lists)
- Reverse a Linked List (Linked Lists)
- Equal Stacks (Stacks)
- Preorder Traversal (Trees)
- Reverse a Linked List (Linked Lists)
- Maximum Element (Stacks)
Medium
- Balanced Brackets (Stacks)
- Simple Text Editor (Stacks)
- Game of Two Stacks (Stacks)
Interview Preparation Kit
Easy
- Arrays Left Rotation (Arrays)
- HashTables Ransom Notes (Dictionaries and HashMaps)
- Insert a Node at a Specific Position in a Linked List (Linked List)
- Linked List Detect a Cycle (Linked List)
- Bubble Sort (Sorting)
- Mark and Toys (Sorting)
- Strings Making Anagram (String Manipulation)
- Day 00: Hello World
- Day 01: Data Type
- Day 02: Operators
- Day 03: Intro to Conditional Statements
- Day 04: Class vs Instance
- Day 05: Loops
- Day 06: Let's Review
- Day 07: Arrays
- Day 08: Dictionaries and Maps
- Day 09: Recursion 3
- Day 10: Binary Numbers
- Day 11: 2D Arrays
- Day 12: Inheritance
- Day 13: Abstract Classes
- Day 14: Scope
- Day 15: Linked List
- Day 16: Exceptions - String to Integer
- Day 17: More Exceptions
- Day 18: Queues and Stacks
- Day 19: Interfaces
- Day 20: Sorting
- Day 21: Genarics
- Day 22: Binary Search Trees
- Day 23: BST Level-Order Traversal
- Day 24: More Linked Lists
- Day 26: Nested Logic
- Day 27: Testing
Medium
- Day 25: Running Time and Complexity
- Day 28: RegEx, Patterns and Intro to Database
- Day 29: Bitwise AND