- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
R
raushanikuf9x7
STREAK
26/1426
days
Longest streak/Global longest streak
Institution
SRLKG College sitamarhi
Language Used
C++
Coding Score
461
Problem Solved
144
Contest Rating
__
480 points
Contributor
480 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 (2)
EASY (58)
MEDIUM (74)
HARD (10)
- Reverse alternate nodes in Link List
- Sort a linked list of 0s, 1s and 2s
- Merge 2 sorted linked list in reverse order
- Insert in Sorted Circular Linked List
- Two Stacks in an Array
- Implement Atoi
- Print matrix in diagonal pattern
- Duplicate Subtree
- Leftmost and rightmost nodes of binary tree
- Count the nodes at distance K from leaf
- Isomorphic Trees
- Children Sum in a Binary Tree
- Kth Ancestor in a Tree
- Power Of Numbers
- Indexes of Subarray Sum
- Boolean Matrix
- Determinant of a Matrix
- Fractional Knapsack
- Stickler Thief
- Longest Increasing Subsequence
- Longest Common Subsequence
- Lucky Numbers
- Implement Trie
- Nth Catalan Number
- Top K Frequent in Array
- 4 Sum - All Quadruples
- Pascal Triangle
- Top k numbers in a stream
- Pythagorean Triplet
- Sum of bit differences
- Longest subarray with sum divisible by K
- Check if a string is repetition of its substring of k-length
- Column name from a given column number
- Substrings with K Distinct
- Sum of XOR of all pairs
- LCS of three strings
- Longest Palindromic Subsequence
- Largest Sum Subarray of Size at least K
- First and Last Occurrences
- Minimum Deletions
- Bleak Numbers
- Largest prime factor
- Max Sum Increasing Subsequence
- Sequence of Sequence
- Perfect Sum Problem
- Partition Equal Subset Sum
- Count possible ways to construct buildings
- Count digit groupings of a number
- Array Pair Sum Divisibility Problem
- Number of paths
- Number of paths in a matrix with k coins
- Longest Repeating Subsequence
- Stream First Non-repeating
- Transitive closure of a Graph
- Replace O's with X's
- Techfest and the Queue
- Remove K Digits
- Find duplicate rows in a binary matrix
- Paths from root with a specified sum
- Shortest Prime Path
- Insertion Sort for Singly Linked List
- Anti Diagonal Traversal of Matrix
- Unique Number III
- All Unique Permutations of an array
- Clone an Undirected Graph
- Reverse a Stack
- Graph is Tree or Not
- Number Of Enclaves
- Maximum Sum Combination
- Floor in BST
- Water the plants
- Number of Good Components
- New Year Resolution
- Grinding Geek
- Pairwise swap elements of a linked list
- Remove duplicates from an unsorted linked list
- Right View of Binary Tree
- Height of Binary Tree
- Balanced Tree Check
- Decimal Equivalent of Binary Linked List
- Find Transition Point
- Remove Duplicates from a Sorted Linked List
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Lowest Common Ancestor in a BST
- Binary Tree to BST
- Leaves at Same Level or Not
- Delete in a Singly Linked List
- Kth largest element in BST
- Minimum distance in an Array
- Array Duplicates
- Inorder Successor in BST
- Insert in a Sorted List
- Sum of leaf nodes in BST
- Symmetric Tree
- Median of BST
- Queue Reversal
- Reverse first K of a Queue
- First Set Bit
- Rightmost different bit
- K-th Bit is Set or Not
- Power of 2
- Wave Array
- Frequencies in a Limited Array
- Equilibrium Point
- Array Leaders
- Print adjacency list
- Sum of upper and lower triangles
- Matrix Boundary Traversal
- Winner of an election
- Panagram Checking
- Roman Number to Integer
- Move All Zeroes to End
- Chocolate Distribution Problem
- Rotate Bits
- Number of occurrence
- Does array represent Heap
- Play With OR
- Find the closest pair from two arrays
- Minimum Operations
- Divisibility by 8
- Nth Fibonacci Number
- Sum 1 to n Divisors
- Perfect Numbers
- Largest number possible
- Recamans sequence
- Form a number divisible by 3 using array digits
- Surround the 1's
- Sum of dependencies in a graph
- Smallest window containing 0, 1 and 2
- Unique Number of Occurrences
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