animeshmaru16
STREAK
71/1477
days
Longest streak/Global longest streak
12 points
Contributor
12 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
0 submissions in current year
SCHOOL (0)
BASIC (24)
EASY (131)
MEDIUM (282)
HARD (58)
- Rotate a Linked List
- Sort a linked list of 0s, 1s and 2s
- Add Number Linked Lists
- Rearrange a linked list
- Detect Loop in linked list
- Quick Sort on Linked List
- Count BST nodes that lie in a given range
- Merge Sort
- Quick Sort
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Merge two sorted linked lists
- Add all greater values to every node in a BST
- Sum Tree
- Flattening a Linked List
- Diagonal Tree Traversal
- Tree Boundary Traversal
- Delete a node from BST
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Maximum difference between node and its ancestor
- Range Minimum Query
- Two Stacks in an Array
- Binary Heap Operations
- 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
- Gas Station
- Check if subtree
- Is Binary Tree Heap
- Validate an IP Address
- Remove loop in Linked List
- Dijkstra Algorithm
- Minimum Spanning Tree
- Largest BST
- Interleaved Strings
- Multiply two strings
- Implement Atoi
- Palindrome Linked List
- Strongly Connected
- Rat in a Maze Problem - I
- Bipartite Graph
- Merge two BST 's
- Count distinct elements in every window
- k-Anagram
- Bridge edge in a graph
- Find triplets with zero sum
- Sort a stack
- Top View of Binary Tree
- Level order traversal
- Peak element
- Root to Leaf Paths
- Populate Inorder Successor for all nodes
- Construct expression tree
- Construct Tree from Inorder & Preorder
- Maximum path sum from any node
- Predecessor and Successor
- Leaves to DLL
- Children Sum in a Binary Tree
- Normal BST to Balanced BST
- Construct Tree from Preorder Traversal
- Count Number of SubTrees
- Swap Kth nodes from ends
- Maximum sum of Non-adjacent nodes
- Ceil in BST
- Count set bits
- Tower Of Hanoi
- Smallest Positive Missing
- Power Of Numbers
- Wave Array
- Possible Words From Phone Digits
- Stock buy and sell
- Rotate Array
- Kadane's Algorithm
- Majority Element
- Binary Array Sorting
- Union of 2 Sorted Arrays
- Indexes of Subarray Sum
- Possible paths between 2 vertices
- Subarrays with equal 1s and 0s
- Longest Consecutive Subsequence
- Postfix Evaluation
- Next Greater Element
- Activity Selection
- Fractional Knapsack
- Job Sequencing Problem
- Minimum Platforms
- Combination Sum
- M-Coloring Problem
- Minimum Jumps
- Stickler Thief
- 0 - 1 Knapsack Problem
- Lucky Numbers
- Number of Unique Paths
- Allocate Minimum Pages
- Kth Smallest
- Implement Trie
- Rotten Oranges
- Steps by Knight
- Maximize The Cut Segments
- Rotate by 90 degree
- Word Break
- Word Boggle
- Prerequisite Tasks
- Excel Sheet | Part - 1
- Sort 0s, 1s and 2s
- Pascal Triangle
- Count Occurences of Anagrams
- Single Among Doubles
- Pair Sum Closest to 0
- Search in Rotated Sorted Array
- Add Binary Strings
- Super Primes
- Maximum Product Subarray
- Row with max 1s
- Concatenation of Zig-Zag String in n Rows
- Count the Reversals
- Max Sum without Adjacents
- Factorials of large numbers
- Reverse each word in a given string
- Length of the longest substring
- Remove leading zeros from an IP address
- Longest Common Substring
- Longest Substring with K Uniques
- Look and Say Pattern
- Integer to Words
- Triplets with Smaller Sum
- Rod Cutting
- Minimum swaps and K together
- Smallest Absolute Difference
- LCS of three strings
- First negative in every window of size k
- Maximum difference of zeros and ones in binary string
- Number of palindromic strings
- Minimum sum
- Smaller on Left
- Minimum Deletions
- Maximum Product of Increasing Subsequence of Size 3
- Valid Substring
- Permutations of a String
- Previous number in one swap
- Coin Change (Count Ways)
- Sequence of Sequence
- Coin Change (Minimum Coins)
- Perfect Sum Problem
- Kth Smallest Factor
- Count of sum of consecutives
- Subsets with XOR value
- Maximum path sum in matrix
- Special Keyboard
- XOR Game
- Min Coin
- Lucky alive person in a circle
- Handshakes
- Count distinct pairs with difference k
- Money Distributions
- Find Last Digit Of a^b for Large Numbers
- Killing Spree
- Subset Sums
- N Digit numbers with digits in increasing order
- Yes XOR No
- Permutation with Spaces
- Bell Numbers
- Return two prime numbers
- Find nth root of m
- Sum of Query II
- Find Prime numbers in a range
- Party in Town
- Game with String
- Fraction to Repeating Decimal
- Dudeney's Cow Problem
- Next Permutation
- Array Sum Excluding Subarrays
- Preorder Traversal and BST
- Stream First Non-repeating
- Possible paths
- Segregate even and odd nodes in a Linked List
- Snake and Ladder Problem
- Pairs of Non Coinciding Points
- 7 Segment Display
- Product of Primes
- Eulerian Path in an Undirected Graph
- nCr mod M | Part 2
- Check Mirror in N-ary tree
- Queries on Strings
- Special Matrix
- Number of Palindromic paths in a Matrix
- Nodes at even distance
- Biconnected Graph
- Floyd Warshall
- Negative weight cycle
- Flood fill Algorithm
- Form coils in a matrix
- Moving on grid
- Height Using Parent Array
- Recursively Remove Adjacent Duplicates
- Theft at World Bank
- Number of minimum picks to get 'k' pairs of socks from a drawer
- Spiral Matrix
- Coins of Geekland
- Valid Pair Sum
- Dam of Candies
- Repeated String Match
- Ruling Pair
- Triplets in Sorted Linked List
- Help Classmates
- Valentine Sum
- Lucy's Neighbours
- Spidey Sense
- Project Manager
- Closest Similar Elements
- Escape the Forbidden Forest
- Iterative Inorder
- Triplets with sum with given range
- Iterative Postorder
- Subset Sum Problem
- Longest Palindromic Substring
- Form a palindrome
- All Palindromic Partitions
- Bellman-Ford
- Subarrays with sum K
- Partition a Linked List around a given value
- Open the gates
- Capacity To Ship Packages Within D Days
- Sort a 2D vector diagonally
- Distribute N candies among K people
- Clone a stack without using extra space
- Number of Provinces
- Find duplicate rows in a binary matrix
- Maximum GCD of siblings of a binary tree
- Find rectangle with corners as 1
- Cousins of a given node
- Division without using multiplication, division and mod operator
- Sort for Singly Linked List
- Minimize the Heights I
- Subsets
- All Unique Permutations of an array
- Course Schedule
- Find and Replace in String
- Min Cost Climbing Stairs
- Minimum times A has to be repeated such that B is a substring of it
- Bitwise AND of the Array
- Overlapping Intervals
- Bitwise AND of the Array
- Cities and Teleporters
- Maximum number of events that can be attended
- Reverse a Stack
- Robots
- Hit most Balloons
- Concatenate Equal to Target
- Exactly one swap
- Maximum Winning score
- Compute Before Matrix
- Maximum selections
- LCP
- Next element with greater frequency
- Sum of nodes within k distance from target
- Minimum increment/decrement to make array non-Increasing
- Remove and Reverse
- Number of Distinct Islands
- Shortest Distance in a Binary Maze
- Minimum Multiplications to reach End
- Number Of Islands
- Shortest Path in Undirected Graph
- Shortest path in Directed Acyclic Graph
- Longest subarray with Atmost two distinct integers
- Sum up the beauty
- Frog Jump
- Water Problem
- Minimal Cost
- Geek's Training
- Bit's basic operations
- Index of the First Occurrence of pattern in a text
- Floor in BST
- Maximum Points Covered
- Reverse a linked list
- Node at a given index in linked list
- Remove duplicates from an unsorted linked list
- Inorder Traversal
- Check for BST
- Mirror 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
- 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
- Reverse Level Order Traversal
- DFS of Graph
- Stack using Linked List
- Implement stack using array
- BFS of graph
- Identical Trees
- Square Root
- Nodes without a Sibling
- Lowest Common Ancestor in a BST
- Remove Duplicates Sorted Array
- BST Keys in a Range
- Minimum Depth of a Binary Tree
- Binary Tree to BST
- K-Palindrome
- Remove every k'th node
- Leaves at Same Level or Not
- Delete in a Singly Linked List
- Minimum distance in an Array
- Array Duplicates
- Special Stack
- Index of an Extra Element
- Disjoint set (Union-Find)
- Reverse Using Stack
- Find length of Loop
- Median of BST
- Find n/k th node in Linked list
- Queue Reversal
- Reverse first K of a Queue
- Brothers From Different Roots
- Move all zeros to the front of the linked list
- Delete Mid of a Stack
- Find the Frequency
- Check K-th Bit
- Power of 2
- Swap odd and even bits
- Equilibrium Point
- Print adjacency list
- Anagram
- Isomorphic Strings
- Reverse Words
- Minimum indexed character
- Parenthesis Checker
- N meetings in one room
- Largest number with given sum
- Positive Negative Pair
- Roman Number to Integer
- Max Value Permutation
- Missing And Repeating
- Sort by Set Bit Count
- k sorted array
- Maximize sum after K negations
- Pairs with certain difference
- Rearrange a string
- Second Largest
- Find all pairs with a given sum
- Longest common prefix
- Longest Common Prefix of Strings
- Meta Strings
- Counts Zeros Xor Pairs
- Hungry Pizza Lovers
- Maximum sum of increasing order elements from n arrays
- Merge two binary Max heaps
- Four Elements
- Maximum average subarray
- Smallest greater elements in whole array
- Shop in Candy Store
- Generate binary string
- Partition a number into two divisible parts
- Encrypt the string - 2
- Maximum prefix sum for a given range
- Swap bits
- Minimum number of Coins
- Right most non zero digit
- Nth item through sum
- Maximize Toys
- Prime Factors
- Circular Prime Number
- Recursive sequence
- Make Zeroes
- K-Ary Tree
- Array to BST
- Rearrange Geek and his Classmates
- Fraction Trouble
- Gadgets of Doraland
- Plus One
- Sum of two numbers without using arithmetic operators
- Minimum steps to make product equal to one
- Even and Odd
- Search insert position of K in a sorted array
- Queue using stack
- Largest value in each level
- Minimum Swaps
- Count the Subarrays
- Fair string
- Smallest window containing 0, 1 and 2
- Can Make Triangle
- Matrix Operations
- Triangle and Square
- Assign Tasks
- Maximum Frequency
- Police Station
- All divisors of a Number
- Find XOR of numbers from L to R.
- Odd Series
- Find the number of Matchsticks
- Bit Manipulation
- Introduction to Trees
- Binary Search Trees
- Graph and Vertices
- Unique Binary Tree Requirements
- Binary Tree Representation
- Geek & Geekina Purchasing Ice Cream
- Toggle
- Linked List Group Reverse
- Binary Tree to DLL
- Clone List with Next and Random
- Min distance between two given nodes of a Binary Tree
- LRU Cache
- Alien Dictionary
- Fixing Two nodes of a BST
- String Permutations
- Trapping Rain Water
- Max Circular Subarray Sum
- Smallest window containing all characters
- Histogram Max Rectangular Area
- Max of min for every window size
- Strongly connected component (Tarjans's Algo)
- Minimum Cost Path
- Median of 2 Sorted Arrays of Different Sizes
- The Painter's Partition Problem-II
- Distinct palindromic substrings
- Search Pattern
- Largest rectangle of 1s with swapping of columns allowed
- Maximum XOR subset
- Edit Distance
- Stock Buy and Sell – Max K Transactions Allowed
- Check Tree Traversal
- Matrix Chain Multiplication
- Bit Difference
- Longest valid Parentheses
- Geek collects the balls
- nCr mod M | Part 1
- Adventure in a Maze
- Closest Palindrome
- Optimal binary search tree
- Longest Path in a matrix
- Word Wrap
- Maximum sum Rectangle
- Huffman Encoding
- Water Connection Problem
- Find the Maximum Flow
- Secret Cipher
- 132 Geeky Buildings
- Corona Vaccine
- Shortest Range In BST
- Elixir of Life
- Search Pattern (Z-algorithm)
- Number of subsets with product less than k
- Maximum XOR subarray
- Longest substring to form a Palindrome
- Minimum operations to convert array A to B
- Palindrome Pairs
- Array Partition
- Number of distinct words with K maximum contiguous vowels
- Word Ladder II
- Shortest Unique prefix for every word
- Count the number of subarrays
- Articulation Point - I
- Kth Smallest Number in Multiplication Table
- Geek in a Maze
- Largest Sum Cycle
- Print Linked List
- Find Length of Linked List
- Size of Binary Tree
- Count Leaves in Binary Tree
- Postorder Traversal
- Queue Using Array
- Preorder Traversal
- First Occurence
- Linked List Insertion At End
- Minimum element in BST
- Anagram of String
- Sum of Binary Tree
- Count Non-Leaf Nodes in Tree
- Print 1 To N Without Loop
- Sorted Array Search
- Array Subset
- Maximum Integer Value
- 1s Complement
- Odd or Even
- Find position of set bit
- Set the rightmost unset bit
- Binary number to decimal number
- Print 1 to n without using loops
- Finding Position
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