S
raj2002
STREAK
00/1466
days
Longest streak/Global longest streak
Language Used
C++, C, Java
Coding Score
770
Problem Solved
314
Contest Rating
__
787 points
Contributor
787 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 (1)
BASIC (55)
EASY (134)
MEDIUM (105)
HARD (19)
- Pairwise swap elements of a linked list
- Delete in a Doubly Linked List
- Inorder Traversal
- Reverse a Doubly Linked List
- Bubble Sort
- Selection Sort
- Insertion Sort
- Check for BST
- K distance from root
- 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
- Intersection Sorted Linked Lists
- Remove Duplicates from a Sorted Linked List
- Stack using two queues
- Level Order in spiral form
- DFS of Graph
- Stack using Linked List
- Implement stack using array
- Insert a node in a BST
- BFS of graph
- Square Root
- Insertion at doubly linked list
- Binary Search
- Largest subarray of 0's and 1's
- Remove Duplicates Sorted Array
- Level Order Line by Line
- Josephus problem
- Delete in a Singly Linked List
- Array Duplicates
- Level order traversal
- Disjoint set (Union-Find)
- Insert in a Sorted List
- More than n/k Occurrences
- Max and min element in Binary Tree
- Perfect Binary Tree
- Reverse Using Stack
- Find length of Loop
- Find n/k th node in Linked list
- Queue Reversal
- Reverse first K of a Queue
- Delete Mid of a Stack
- Learning to be precise
- Find the Frequency
- 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
- Print adjacency list
- Print Matrix in snake Pattern
- Transpose of Matrix
- Check if a string is Isogram or not
- Anagram
- Winner of an election
- Isomorphic Strings
- Most Frequent Character
- Reverse Words
- Sum of numbers in string
- Minimum indexed character
- Panagram Checking
- Non Repeating Character
- Generate Binary Numbers
- K largest elements
- Union-Find
- Pattern searching
- First Repeating Element
- Union of Arrays with Duplicates
- Check Equal Arrays
- Missing in Array
- Search an element in sorted and rotated array
- Intersection of Arrays with Distinct
- Missing And Repeating
- Cumulative frequency of count of each element in an unsorted array
- Last seen array element
- Pairs of equals Sum
- Adding Ones
- First Come First Serve
- Search in a Row-Column sorted matrix
- Move All Zeroes to End
- Find pairs with given relation
- Move all negative elements to end
- Chocolate Distribution Problem
- Count the triplets
- Bitonic Point
- Left most and right most index
- Twice Counter
- Bitonic Generator Sort
- Two Sum - Pair with Given Sum
- Check if array contains contiguous integers
- Rearrange to Make arr[i] = i
- Find all pairs with a given sum
- Number of occurrence
- Check if array is sorted
- First Repeated Character
- Min Number of Flips
- Counts Zeros Xor Pairs
- Segregate 0s and 1s
- Play With OR
- Count the Zeros
- Palindrome String
- Pair with given sum in a sorted array
- Number of 1 Bits
- Armstrong Numbers
- Compute sum of digits in all numbers from 1 to n
- Midori and chocolates
- Love For The Twins
- Lucky Number
- Reverse Bits
- Max Sum Subarray of size K
- Nth Fibonacci Number
- Change Bits
- Sum Of Digits
- Palindrome
- Shortest path from 1 to n
- Swap bits
- Maximize Toys
- Tricky Sorting Cost
- Trailing zeroes in factorial
- Natural Sum
- Right angled triangles
- Summed Matrix
- Boundary Elements of Matrix
- Sum of two numbers without using arithmetic operators
- First and last occurrences of x
- Find distinct elements
- Sorting Elements of an Array by Frequency
- Add Number Linked Lists
- Detect Loop in linked list
- Merge Sort
- Bottom View of Binary Tree
- Delete without head pointer
- Diameter of a Binary Tree
- Heap Sort
- Merge two sorted linked lists
- Delete a node from BST
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Two Stacks in an Array
- Binary Heap Operations
- Largest subarray with 0 sum
- Topological sort
- Vertical Tree Traversal
- Find the number of islands
- Get Min from Stack
- Serialize and deserialize a binary tree
- Gas Station
- Remove loop in Linked List
- Minimum Spanning Tree
- Palindrome Linked List
- Strongly Connected
- Rat in a Maze Problem - I
- Count distinct elements in every window
- Merge k Sorted Arrays
- Find triplets with zero sum
- Top View of Binary Tree
- k-th Smallest in BST
- Peak element
- Pair Sum in BST
- Construct Tree from Inorder & Preorder
- Vertical sum
- Children Sum in a Binary Tree
- C++ Generic sort
- Ceil in BST
- Count set bits
- Maximum AND Value
- Tower Of Hanoi
- Maximum occured integer
- Wave Array
- Stock buy and sell
- Kadane's Algorithm
- Majority Element
- Binary Array Sorting
- Count Inversions
- Unique BST's
- Union of 2 Sorted Arrays
- Indexes of Subarray Sum
- Triplet Sum in Array
- Merge Without Extra Space
- Make Matrix Beautiful
- Rotate by 90 degree
- Subarray with 0 sum
- Longest Consecutive Subsequence
- Strings Rotations of Each Other
- Postfix Evaluation
- Stock span problem
- Next Greater Element
- Infix to Postfix
- K Sized Subarray Maximum
- Nearly sorted
- Activity Selection
- Fractional Knapsack
- Egg Dropping Puzzle
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Allocate Minimum Pages
- Kth Smallest
- Implement Trie
- Nth number made of prime digits
- Maximize The Cut Segments
- Rotate by 90 degree
- Sort 0s, 1s and 2s
- Longest Span in two Binary Arrays
- Search in Rotated Sorted Array
- Sum of bit differences
- Longest Subarray with Sum K
- k largest elements
- Longest substring with distinct characters
- Valid Expression
- Arranging the array
- First and Last Occurrences
- Permutations of a String
- Unique Number II
- Coin Change (Count Ways)
- Coin Change (Minimum Coins)
- Power Set
- Find distinct elements
- Sum of Query II
- Find the Safe Position
- Rank The Permutations
- Exit Point in a Matrix
- Longest Repeating Subsequence
- Segregate even and odd nodes in a Linked List
- Two odd Occuring
- Floyd Warshall
- Subset Sum Problem
- Bellman-Ford
- Rank The Permutations
- Overlapping Intervals
- Print Linked List
- Size of Binary Tree
- Postorder Traversal
- Queue Using Array
- Preorder Traversal
- Search a node in BST
- Linked List Insertion At End
- Anagram of String
- Mrs. S- JAVA Bits Set 1
- Bit Difference
- Number is sparse or not
- Array Search
- Sorted Array Search
- Binary String
- Reverse a String
- Keypad typing
- First n Fibonacci
- Merge and Sort
- Count pair sum
- Check Arithmetic Progression
- Distinct Elements in a Stream
- Check for subsequence
- Segregate Even and Odd numbers
- Count the characters
- Quick Left Rotation
- Repeated Character
- First 1 in a Sorted Binary Array
- Missing number in shuffled array
- Largest Element in Array
- Game with nos
- One odd Occuring
- Remove Duplicates from unsorted array
- Min and Max in Array
- Positive and negative elements
- Smallest number repeating K times
- Anagram Strings
- Difference between highest and lowest occurrence
- 1s Complement
- Odd or Even
- XOR of all elements
- The OR Gate
- Gray Code
- Find position of set bit
- Set kth bit
- The XOR Gate
- XOR Count Zero and One
- set-bits and number
- LCM And GCD
- Binary Shift to Divide
- Ladoo problem
- Print 1 to n without using loops
- Sum of Digit Modified
- Unique Numbers
- Evaluate the expression
- Corner Digits Sum
- Linked List Group Reverse
- Binary Tree to DLL
- Clone List with Next and Random
- Max rectangle
- Fixing Two nodes of a BST
- Trapping Rain Water
- Max Circular Subarray Sum
- Histogram Max Rectangular Area
- Find median in a stream
- Solve the Sudoku
- Strongly connected component (Tarjans's Algo)
- Median of 2 Sorted Arrays of Different Sizes
- Burning Tree
- Merge Without Extra Space
- Edit Distance
- Matrix Chain Multiplication
- Bit Difference
- N-Queen Problem
- Search Pattern (Rabin-Karp Algorithm)
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