azad
STREAK
00/1468
days
Longest streak/Global longest streak
Language Used
C++, Java, C, Python
Coding Score
1888
Problem Solved
1041
Contest Rating
__
18 points
Contributor
18 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
2 submissions in current year
SCHOOL (9)
BASIC (330)
EASY (415)
MEDIUM (265)
HARD (22)
- Sorting Elements of an Array by Frequency
- Rearrange characters
- Nearly Sorted Algorithm
- Reverse alternate nodes in Link List
- Rotate a Linked List
- Sort a linked list of 0s, 1s and 2s
- Add Number Linked Lists
- Add 1 to a Linked List Number
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- Count BST nodes that lie in a given range
- Merge Sort
- Quick Sort
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Heap Sort
- Merge two sorted linked lists
- Sum Tree
- Connect Nodes of Levels
- Flattening a Linked List
- Diagonal Tree Traversal
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Maximum difference between node and its ancestor
- Two Stacks in an Array
- The Celebrity Problem
- Largest subarray with 0 sum
- Topological sort
- Vertical Tree Traversal
- Merge K sorted linked lists
- Find the number of islands
- Get Min from Stack
- Serialize and deserialize a binary tree
- Gas Station
- Linked List to Binary Tree
- Check if subtree
- Extreme nodes in alternate order
- Is Binary Tree Heap
- Remove loop in Linked List
- Dijkstra Algorithm
- Minimum Spanning Tree
- Largest BST
- Minimum Swaps to Sort
- Implement Atoi
- Maximum Difference
- Palindrome Linked List
- Strongly Connected
- Rat in a Maze Problem - I
- Bipartite Graph
- Number of root to leaf paths
- BST with Dead End
- Merge two BST 's
- Minimum four sum subsequence
- Count distinct elements in every window
- k-Anagram
- Root to leaf paths sum
- Print Nodes having K leaves
- Find triplets with zero sum
- Sort a stack
- Top View of Binary Tree
- k-th Smallest in BST
- Union of Two Linked Lists
- Ancestors in Binary Tree
- Root to Leaf Paths
- Populate Inorder Successor for all nodes
- Counting elements in two arrays
- K Sum Paths
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Construct Tree from Inorder & Preorder
- Count the nodes at distance K from leaf
- Vertical sum
- Mirror of a given node
- Insert in Sorted way in a Sorted DLL
- Isomorphic Trees
- Children Sum in a Binary Tree
- Diagonal sum in binary tree
- Sum of nodes on the longest path
- Kth Ancestor in a Tree
- Check if two Nodes are Cousins
- Convert Level Order Traversal to BST
- ZigZag Tree Traversal
- Count Number of SubTrees having given Sum
- Vertical Width of a Binary Tree
- Count set bits
- Reverse array in groups
- Smallest Positive Missing
- Wave Array
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Stock buy and sell
- Kadane's Algorithm
- Majority Element
- Binary Array Sorting
- Unique BST's
- Indexes of Subarray Sum
- Triplet Sum in Array
- Level of Nodes
- Boolean Matrix
- Spirally traversing a matrix
- Rotate by 90 degree
- Distance of nearest cell having 1
- Unit Area of largest region of 1's
- Subarray with 0 sum
- Longest Consecutive Subsequence
- Strings Rotations of Each Other
- Case-specific Sorting of Strings
- Postfix Evaluation
- Stock span problem
- Next Greater Element
- Infix to Postfix
- K Sized Subarray Maximum
- Kth smallest element
- Activity Selection
- Fractional Knapsack
- Minimum Platforms
- Detect Cycle using DSU
- Ways to write n as sum
- Stickler Thief
- Ways to Reach the n'th Stair
- Egg Dropping Puzzle
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Number of Unique Paths
- Equal Sum Partition
- Sort according to an Array
- Allocate Minimum Pages
- X Total Shapes
- Zero Sum Subarrays
- Find whether path exist
- Implement Trie
- Shortest Common Supersequence
- Nth Catalan Number
- Rotten Oranges
- Steps by Knight
- Most frequent word in an array of strings
- Maximize The Cut Segments
- Container With Most Water
- Print Anagrams Together
- Overlapping Intervals
- Prerequisite Tasks
- Sort 0s, 1s and 2s
- Paths to reach origin
- Pascal Triangle
- Maximum Index
- Equal Sum
- Sum of Middle elements of two sorted arrays
- Pair array product sum
- Equivalent Sub-Arrays
- Single Among Doubles in a Sorted
- Consecutive 1's not allowed
- Count Occurences of Anagrams
- Single Among Doubles
- Pythagorean Triplet
- Mr Modulo and Pairs
- Pair Sum Closest to 0
- Search in Rotated Sorted Array
- Sum of bit differences
- Max Score from Subarray Mins
- Form the Largest Number
- Efficiently sorting numbers in range from 0 to n^2 - 1
- Maximum Product Subarray
- Row with max 1s
- Swapping pairs make sum equal
- Check if frequencies can be equal
- Form a palindrome
- Nuts and Bolts Problem
- Rotate a Matrix
- Maximum distinct elements after removing K elements
- Count the Reversals
- Max Sum without Adjacents
- Reverse each word in a given string
- Length of the longest substring
- k largest elements
- Longest Common Substring
- Longest substring with distinct characters
- Longest Palindrome in a String
- Look and Say Pattern
- K-th element of two Arrays
- Arranging the array
- Rod Cutting
- Greater tower sum
- Smallest Absolute Difference
- Longest Palindromic Subsequence
- Largest Sum Subarray of Size at least K
- First negative in every window of size k
- Surpasser Count
- First and Last Occurrences
- Palindrome in Alphanumeric String
- Minimum Deletions
- Valid Substring
- Minimum number of deletions
- Permutations of a String
- CamelCase Pattern Matching
- Sum of Products
- Bleak Numbers
- Modular Exponentiation
- Game of XOR
- Minimum number of deletions and insertions
- Coin Change (Count Ways)
- Sieve of Eratosthenes
- Coin Change (Minimum Coins)
- K-Palindrome
- Power Set
- Count ways to N'th Stair(Order does not matter)
- Minimum Cost To Make Two Strings Identical
- Knapsack with Duplicate Items
- Partition Equal Subset Sum
- Array Pair Sum Divisibility Problem
- Subset Sums
- Number of paths
- Knight Walk
- Sum of Query II
- Find Prime numbers in a range
- Game with String
- Numbers with alternative 1's
- Find the Safe Position
- Next Permutation
- Smaller on Left
- Longest Repeating Subsequence
- Total Decoding Messages
- Stream First Non-repeating
- Kth Largest in a Stream
- Snake and Ladder Problem
- Transitive closure of a Graph
- Replace O's with X's
- Two odd Occuring
- Nodes at even distance
- Count the paths
- Floyd Warshall
- Negative weight cycle
- Flood fill Algorithm
- Shortest Source to Destination Path
- Divisibility tree
- Valentine Sum
- Spidey Sense
- Preorder traversal (Iterative)
- Subset Sum Problem
- Form a palindrome
- Covid Spread
- Partition a Linked List around a given value
- Number of Provinces
- Maximum sum leaf to root path
- Paths from root with a specified sum
- Cousins of a given node
- Remove all occurences of duplicates in a linked list
- Sum Distance K in Tree
- Course Schedule
- Sum of nodes within k distance from target
- Shortest Distance in a Binary Maze
- Number Of Enclaves
- City With the Smallest Number of Neighbors at a Threshold Distance
- Alex Travelling
- Path With Minimum Effort
- Cheapest Flights Within K Stops
- Shortest path in Directed Acyclic Graph
- Shortest Path in Weighted undirected graph
- Postfix to Infix Conversion
- Maximum Value
- Bheem Wants Ladoos
- Rotate Array
- Sort String
- Weight of strings
- Print Linked List
- Find Length of Linked List
- Power of Four
- Check for Binary String
- Size of Binary Tree
- Count Leaves in Binary Tree
- Postorder Traversal
- Queue using Linked List
- Replace all 0's with 5
- Replace all 0's with 5
- Count zeros in a sorted matrix
- Print number pattern
- Preorder Traversal
- First Occurence
- C++ STL | Set 1 (vector)
- C++ STL | Set 3 (map)
- Sum Except First and Last
- C++ STL | Set 4 (stack)
- C++ STL | Set 5 (queue)
- C++ STL | Set 6 (set)
- Equal Sum and XOR
- C++ STL | Set 7 (unordered map)
- C++ STL | Set 8 (unordered set)
- Palindromic Array
- Linked List Insertion At End
- C++ Functions (Sum of numbers) | Set 1
- Minimum element in BST
- Anagram of String
- Circular Linked List Traversal
- Is Linked List Length Even?
- Identical Linked Lists
- Sum of Binary Tree
- Insert in Middle of Linked List
- longest substring containing '1'
- Pairwise Consecutive Elements
- Count Non-Leaf Nodes in Tree
- Mrs. S- JAVA Bits Set 1
- Alternates in an Array
- Java Inheritance
- Start Coding
- The Size of
- Logical Operators
- Count Odd and Even
- Sort and Reverse Vector
- Front to Back
- Stack designer
- Queue Push & Pop
- Set Operations
- Map Operations
- Bit Difference
- Number is sparse or not
- Print 1 To N Without Loop
- Array Search
- Binary String
- Remove common characters and concatenate
- Reverse a String
- Keypad typing
- C++ Hello World
- Find second largest element
- Minimum Product of k Integers
- Merge and Sort
- Palindrome Array
- Multiply Array
- Rearranging array
- Count number of elements between two given elements in array
- Mega Sale
- Sum of Array
- Sum of Natural Numbers
- Searching in an Array
- Doubling the value
- Count pair sum
- Print Elements of Array
- Elements before which no element is bigger
- Remove consonants from a string
- Friendly Array
- Sort the Half Sorted
- At least two greater elements
- Sort a String
- Anagram Palindrome
- Sort Array II
- Alternative Sorting
- Check if divisible by 11
- Check Binary String
- Change the string
- Maximum product of two numbers
- Value equal to index value
- Check for subsequence
- Check String
- Convert a list of characters into a String
- Confused pappu
- Remove characters from alphanumeric string
- Segregate Even and Odd numbers
- Count of camel case characters
- Encrypt the string - 1
- Maximum triplet sum in array
- Fighting the darkness
- Count Pairs Odd Xor
- The problem of identical arrays
- Sum of alternate product
- Reverse sub array
- Immediate Smaller Element
- Sum of distinct elements
- Count the characters
- Count type of Characters
- Uncommon characters
- Sum of all sub-sequences of a number
- Swap kth elements
- Reversing the vowels
- Rock Paper Scissors!
- Duck Number
- Fake Profile
- Lower case to upper case
- Smaller and Larger
- String Reversal
- A guy with a mental problem
- Remove repeated digits in a given number
- Remove Spaces
- Repeated Character
- Replace the Bit
- First 1 in a Sorted Binary Array
- Length of Last word
- Find the Number which contain the digit d
- Missing number in shuffled array
- Max and Min Product from 2 Arrays
- The Penalty Shootout
- Elements in the Range
- Display longest name
- Find element at a given Index
- Last index of One
- Sort the string in descending order
- Merge two strings
- Message decoding
- Good String
- Crazy String
- String with numbers at its end
- Last duplicate element in a sorted array
- Largest Element in Array
- Rotate Array by One
- Game with nos
- Why is Melody so chocolaty?
- One odd Occuring
- Ishaan Loves Chocolates
- Jay's Apples
- Split Strings
- Array Subset
- Wrong Ball
- Rotating an Array
- Product is even or odd?
- Remove Duplicates from unsorted array
- Find Substring from last of the Given String
- Minimum sum of two elements from two arrays
- Even occurring elements
- Minimum number to form the sum even
- C++ Strings
- Count of smaller elements
- Min and Max in Array
- Reducing Walls
- Multiply left and right array sum
- Maximum Perimeter of Triangle from array
- Positive and negative elements
- Pattern of Strings
- Extract Maximum
- Smallest number repeating K times
- Print first letter of every word in the string
- Last index of a character in the string
- Perfect Square String
- Perfect Reversible String
- Remove character
- Red OR Green
- Convert String to LowerCase
- Snake Case
- Anagram Strings
- Minimum number of flipped bits
- The Muskteers
- Triangle shrinking downwards
- Triangle growing downwards
- Reverse a String
- Sort the fest
- Magical String[Duplicate Problem]
- First and last Bit
- Difference between highest and lowest occurrence
- GCD of two numbers
- Find unique element
- C++ if-else (Decision Making)
- Addition of Two Numbers
- C++ Input / Output
- 1s Complement
- Odd or Even
- Check set bits
- C++ Operators (Relational) | Set 2
- C++ Switch Case Statement
- One's Complement
- Number of Diagonals
- XOR of all elements
- Invert the Bits
- C++ Operators | Set 1 (Arithmetic)
- The OR Gate
- The AND Gate
- C++ Nega Bit
- Binary representation
- Check for Power
- Find position of set bit
- Set kth bit
- Factor OR Multiple
- Odd Divisors
- Vowel or Not
- The XOR Gate
- Decision Making in Java
- Combinational Logic
- Java Hello World
- Java loops | Set 1
- Smallest power of 2 greater than or equal to n
- Sum of Consecutives
- Numbers having alternate bits
- XOR Count Zero and One
- Find the fine
- Strong Numbers
- Check if divisible by 5
- Check perfect square
- LCM And GCD
- Small Factorial
- House Robber
- Mean of an Array
- Cube root of a number
- Repeated IDs
- C++ Data Types
- C++ Sets
- Find n-th term of series 1, 3, 6, 10, 15, 21
- Binary Shift to Divide
- Leap Year
- Krishnamurthy number
- Strong Numbers
- Median of an Array
- Sort first half in ascending and second half in descending
- Celsius to Fahrenheit Conversion
- Factorial
- Automorphic Number
- Sum of odd and even elements
- Number of divisors
- Parity of unsigned integer
- Sum of Digit is Palindrome or not
- Perfect Number
- Sum of an AP
- Greatest of three numbers
- Pairs with given XOR
- Sum of GP
- Simple Interest
- Reverse digits
- Special Odd Series Sum
- Special Series Sum
- Binary number to decimal number
- Check for three consecutive numbers
- Total digits
- Tough Competitors
- Series AP
- Common Divisors
- Sum of divisors
- Floyd's triangle
- Distance between 2 points
- Multiples Power
- Area of Rectangle, Right Angled Triangle and Circle
- Count numbers divisible by M
- Sum of elements in a matrix
- Identical Matrices
- Find difference between sum of diagonals
- Tidy Number
- C++ 2-D Arrays | Set-2
- Multiplication Table
- Pronic Number
- The dice problem
- Ladoo problem
- Remainder Evaluation
- Pattern Printing
- Print 1 to n without using loops
- Disarium Number
- Count Squares
- Maximum distance
- Matching Pair
- Middle of Three
- Difference between sums of odd and even digits
- Anshuman's Favourite Number
- Repeated sum of digits
- Sum of Digits Divisibility
- Mind Game
- Check whether two numbers differ at one bit position only
- Print the Kth Digit
- Numbers containing 0's from 1 to N
- Swap two numbers
- Unique Numbers
- Series X1
- Number Pattern
- 12 hour clock Multiplication
- Doctors Clinic
- 12 hour clock addition
- 12 hour clock subtraction
- Composite Series
- Number of Integer solutions
- Repetitive Addition Of Digits
- Binary Addition of 1
- Half N by M
- Evaluate the x + a = b statement
- Pattern Jumping
- Perfect Squares in a Range
- Corner Digits Sum
- Multiple of N closest to X
- Sum Terms Nth Row
- Geek's Weight
- String of Commons
- Make a Distinct Digit Array
- Face off Tournament
- Perfect Cubes in a Range
- Minimum difference pair
- Long Long Decimal
- The Lazy Caterer's Problem
- Surface Area and Volume of Cuboid
- Finding Position
- nPr
- Parallel or Perpendicular?
- 2's Complement
- Cricket Average
- Addition of two square matrices
- Diagonal sum
- Sum of primes
- Count Sorted Rows
- Squares Difference
- Sorted matrix
- Student record
- String Ignorance
- GeeksforGeeks New System
- Winner of an election
- SP - Stack Design
- SP - Golden String
- SP - Catch The Nun
- Geek String
- Same Count After Sorting
- Odd Couples
- Geek and Bridges
- Reverse a linked list
- Frequency in a Linked List
- Pairwise swap elements of a linked list
- Node at a given index in linked list
- Linked list of strings forms a palindrome
- Remove duplicates from an unsorted linked list
- Delete in a Doubly Linked List
- Inorder Traversal
- Reverse a Doubly Linked List
- Bubble Sort
- Selection Sort
- Check for BST
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Two Mirror Trees
- Maximum Width of Tree
- Height of Binary Tree
- Balanced Tree Check
- Kth from End of Linked List
- Middle of a Linked List
- Check If Circular Linked List
- Left View of Binary Tree
- Delete Middle of Linked List
- Transform to Sum Tree
- Intersection Sorted Linked Lists
- Find Transition Point
- Queue using two Stacks
- Remove Duplicates from a Sorted Linked List
- Stack using two queues
- Level Order in spiral form
- Reverse Level Order Traversal
- DFS of Graph
- Stack using Linked List
- Implement stack using array
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Root to leaf path sum
- Square Root
- Nodes without a Sibling
- Lowest Common Ancestor in a BST
- Binary Search
- Largest subarray of 0's and 1's
- Level Order Line by Line
- BST Keys in a Range
- Minimum Depth of a Binary Tree
- Odd even level difference
- Binary Tree to BST
- K-Palindrome
- Equilibrium index of an array
- Toeplitz matrix
- Remove every k'th node
- Leaves at Same Level or Not
- Third largest element
- Find Maximum value
- Multiply two linked lists
- Josephus problem
- Max distance between same elements
- Delete in a Singly Linked List
- Kth largest element in BST
- Array Duplicates
- Max Level Sum in Binary Tree
- Longest consecutive sequence in Binary tree
- Level order traversal
- Inorder Successor in BST
- Index of an Extra Element
- Increment a variable
- Sum of given range
- Intersection of Two Linked Lists
- Disjoint set (Union-Find)
- Split Linked List Alternatingly
- Level of a Node in Binary Tree
- Sum of leaf nodes in BST
- Counting Sort
- Max and min element in Binary Tree
- Perfect Binary Tree
- Reverse Using Stack
- XOR of a given range
- Full Binary Tree
- Symmetric Tree
- Delete Alternate Nodes
- Find the Sum of Last N nodes of the Linked List
- Next Right Node
- Depth of node
- Maximum Node Level
- Find length of Loop
- Queue Reversal
- Reverse first K of a Queue
- Remove Half Nodes
- Height of Spiral Tree
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Sum of Leaf Nodes at Min Level
- Tilt of Binary Tree
- Product of an Array
- C++ Function overloading
- C++ complex number addition (operator overloading)
- The New Line
- Taking input
- Learn to Comment
- Learning to be precise
- For Loop- primeCheck
- While loop- printTable
- Learning Macros
- Step by Step Condition
- Start Coding - Java
- Learn to Comment - Java
- Bitwise Operators - Java
- While loop- printTable - Java
- Matrix Interchange
- Xoring and Clearing
- Swap values using References
- Two Dimensional World
- Learning Structs
- Delete Array
- Find the Frequency
- Back to Front
- Pair Sum in Vector
- Deque Implementations
- Min Heap implementation
- Frequency Game
- Duplicate Elements
- Multiset Operations
- Multimap Operations
- Pair Sum Existence- Revisited
- Decimal to binary
- First Set Bit
- Rightmost different bit
- Check K-th Bit
- Longest Consecutive 1's
- Power of 2
- Swap odd and even bits
- Frequencies in a Limited Array
- Equilibrium Point
- Array Leaders
- Floor in a Sorted Array
- Print adjacency list
- Transpose of Matrix
- Check if a string is Isogram or not
- Anagram
- Winner of an election
- Isomorphic Strings
- Most Frequent Character
- Sum of numbers in string
- Minimum indexed character
- Panagram Checking
- Non Repeating Character
- Parenthesis Checker
- Minimum indexed character
- Generate Binary Numbers
- Minimum Cost of ropes
- N meetings in one room
- Reach a given score
- Union-Find
- Count ways to N'th Stair
- Count number of hops
- First Repeating Element
- Union of Arrays with Duplicates
- Check Equal Arrays
- Missing in Array
- Product array puzzle
- Roman Number to Integer
- Intersection of Arrays with Distinct
- Longest Increasing subarray
- Find Unique pair in an array with pairs of numbers
- Mean of range in array
- Count minimum right flips to set all values in an array
- Missing And Repeating
- Buildings receiving sunlight
- Find Index
- Non-Repeating Element
- Last seen array element
- Max value
- Count the elements
- Maximum Gap
- Professor and Parties
- Pairs which are Divisible by 4
- Maximize sum after K negations
- Find Maximum Sum Strictly Increasing Subarray
- Common in 3 Sorted Arrays
- Good Pairs
- First Come First Serve
- Greedy Fox
- Sorted and Rotated Minimum
- Maximum no of 1's row
- Sum of elements between k1'th and k2'th smallest elements
- Move All Zeroes to End
- String Duplicates Removal
- Equal Sum and Product
- Minimize the sum of product
- Move all negative elements to end
- Unusual String Sort
- String Manipulation
- Chocolate Distribution Problem
- Strange Sort
- Minimum Distinct Ids
- Count the triplets
- Punish the Students
- Find Pair Given Difference
- Minimum number of swaps needed
- Pairs with difference k
- Permutations in array
- Pair with greatest product in array
- Fascinating Number
- Bitonic Point
- Find Duplicate Element
- Left most and right most index
- Smallest subarray with sum greater than x
- Amend The Sentence
- Closest Strings
- Single Number
- Alternate Positive Negative
- Check if actual binary representation of a number is palindrome
- Maximum Possible Sum of Products
- 1[0]1 Pattern Count
- Remaining String
- Closing bracket index
- Remove Consecutive Characters
- Remove b and ac from a given string
- Check if the number is balanced
- Count Alphabets
- Rearrange a string
- Form largest number from digits
- Ordering of strings
- Sherlock a Detective
- Remove Duplicates
- Compete the skills
- Same characters in two strings
- Rahul lucky-unlucky
- Convert the string
- Sorting Employees
- Add two numbers represented by two arrays
- Reorganize The Array
- Facing the sun
- Greater on right side
- Count Substrings
- Difficulty of sentence
- Twice Counter
- Word with maximum frequency
- Swap the closest and farthest digits
- Second Largest
- Convert array into Zig-Zag fashion
- Two Sum - Pair with Given Sum
- Second most repeated string in a sequence
- Check if array contains contiguous integers
- Rearrange to Make arr[i] = i
- Find all pairs with a given sum
- Number of occurrence
- Average of Prefix
- Maximum repeating number
- The Even Array
- K-Pangrams
- Find the left over element
- Find the most frequent digit
- C++ Visible Numbers
- Convert an array to reduced form
- Check if array is sorted
- Consecutive Array Elements
- Count even substrings
- Find missing in second array
- Longest Common Prefix of Strings
- First Repeated Character
- Prime String
- Special array reversal
- Meta Strings
- Min Manipulations to make Strings Anagram
- Min Number of Flips
- Maximum number of characters between any two same character
- Sum of distinct elements for a limited range
- Maximum difference Indexes
- Counts Zeros Xor Pairs
- Substrings with same first and last characters
- Two sum -Pairs with 0 Sum
- Segregate 0s and 1s
- Positive distinct count
- Maximum number of zeroes
- Inverse Permutation
- Play With OR
- Three Great Candidates
- Digits in a set
- At Least K Occurrences
- Element with left side smaller and right side greater
- Ishaan and Sticks
- Make a string from another string
- Merging two unsorted arrays in sorted order
- Count the Zeros
- Distinct absolute array elements
- Length of longest subarray
- The Counting Game !!
- Total distance travelled in an array
- First and Second Smallests
- Palindrome String
- Total count
- Left out candies
- Sorting all array elements except one
- Delete Array Elements
- Smallest greater elements in whole array
- Pangram Strings
- Pattern Searching
- Print Bracket Number
- Easy string
- Shop in Candy Store
- Minimum changes to make all substrings distinct
- Sort string
- Tom and String
- Lucas Number
- Generate binary string
- Split the string
- Encrypt the string - 2
- Is Binary Number Multiple of 3
- Cross the Bridge
- Padovan Sequence
- Minimum product pair
- Karatsuba Algorithm
- Extract the Number from the String
- Minimum Operations
- Divisibility by 8
- Swap bits in byte
- Number of 1 Bits
- Find the Highest number
- Armstrong Numbers
- Midori and chocolates
- Love For The Twins
- Set Bits
- XOR of equal length binary numbers
- Remove minimum number of elements
- Reverse Bits
- Rearrange the array
- Nth Fibonacci Number
- Change Bits
- Number of factors
- Count Digits
- Sum Of Digits
- Palindrome
- Toggle bits in the given range
- Game of Nim
- Maximum 0s between two immediate 1s
- Element that appears once where every element occurs twice
- Prime Number
- Print binomial expansion series
- Minimum insertions to sort an array
- Minimum number of deletions to make a sorted sequence
- Party of Couples
- Count numbers
- Make Number Odd
- Find sum of divisors
- Minimum steps to minimize n as per given condition
- Assign Mice Holes
- N-divisors
- Happy Number
- Reach the Nth point
- Minimum number of Coins
- Number Of Open Doors
- Numbers with same first and last digit
- Perfect Numbers
- Maximum height of the staircase
- Day of the week
- Incomplete Array
- Minimum Notes Required
- Adjacents are not allowed
- Maximize Toys
- Raju and coins
- Largest number possible
- Page Faults in LRU
- Letter Writer
- Sum Indexes
- Count ways to express N as the sum of 1,3 and 4
- Number of divisors in a given range
- Division Problem
- Deficient Number
- Trailing zeroes in factorial
- Faulty Keyboard
- Form a number divisible by 3 using array digits
- Number of ways to find two numbers
- Least Prime Factor
- Natural Sum
- Count unset bits in a given Range
- Sum of First N Natural Numbers
- Smallest number by rearranging digits of a given number
- Prime Factors
- Recursive sequence
- Juggler Sequence
- Sum of product of all pairs
- Increasing Sub Sequence
- Water Balloons
- Maximum Diamonds
- Row with Minimum 1s
- Lexicographically Previous Permutation
- Playing with mobile numbers
- Collection of pens
- Inorder Traversal and BST
- Sum of Divisors in an array
- Print Pattern
- Sum of dependencies in a graph
- Count all possible paths from top left to bottom right
- License Key Formatting
- Maximum Depth Of Binary Tree
- Transform to Sum Tree
- Maximum Weight Node
- Reverse both parts
- Max Level Sum in Binary Tree
- Wifi Range
- Linked List Insertion At Beginning
- Find the ODDs
- Linked List Group Reverse
- Binary Tree to DLL
- Min distance between two given nodes of a Binary Tree
- Alien Dictionary
- Nodes at given distance in binary tree
- Max Path Sum 2 Special Nodes
- Trapping Rain Water
- Max Circular Subarray Sum
- Smallest window containing all characters
- Histogram Max Rectangular Area
- Find median in a stream
- Minimum Cost Path
- Burning Tree
- Merge Without Extra Space
- Count Pairs in an Array
- Count Smaller elements
- Longest Prefix Suffix
- Minimum sum partition
- Bit Difference
- Longest valid Parentheses
- Word Break - 2
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy