- Courses
- Tutorials
- Practice
Data Structure
Java
Python
HTML
Interview Preparation
user_u3so
STREAK
01/1401
days
Longest streak/Global longest streak
Language Used
C++, Java, C
Coding Score
326
Problem Solved
113
Contest Rating
__
Campus Ambassador
sahelipaul2366 points
Contributor
66 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
3 submissions in current year
SCHOOL (1)
BASIC (8)
EASY (36)
MEDIUM (62)
HARD (6)
- Sort a linked list of 0s, 1s and 2s
- Add 1 to a Linked List Number
- Bottom View of Binary Tree
- Intersection in Y Shaped Lists
- Sum Tree
- Flattening a Linked List
- Tree Boundary Traversal
- Directed Graph Cycle
- Undirected Graph Cycle
- The Celebrity Problem
- Largest subarray with 0 sum
- Topological sort
- Find the number of islands
- Gas Station
- Is Binary Tree Heap
- Palindrome Linked List
- Count distinct elements in every window
- Top View of Binary Tree
- Ceil in BST
- Kadane's Algorithm
- Count Inversions
- Distance of nearest cell having 1
- Subarray with 0 sum
- Postfix Evaluation
- Next Greater Element
- Infix to Postfix
- 0 - 1 Knapsack Problem
- Kth Smallest
- Sort 0s, 1s and 2s
- Count Occurences of Anagrams
- Max Score from Subarray Mins
- Row with max 1s
- Longest Subarray with Sum K
- Longest Common Substring
- Longest Substring with K Uniques
- Longest Palindrome in a String
- Rod Cutting
- First negative in every window of size k
- Valid Substring
- Friends Pairing Problem
- Minimum number of deletions and insertions
- Perfect Sum Problem
- Knapsack with Duplicate Items
- Get Minimum Squares
- Subset Sums
- Stream First Non-repeating
- Floyd Warshall
- Help Classmates
- Subset Sum Problem
- Longest Palindromic Substring
- Subarrays with sum K
- Reverse a Stack
- Hit most Balloons
- Number Of Enclaves
- Shortest path in Directed Acyclic Graph
- Aggressive Cows
- Number of greater elements to the right
- Prefix to Infix Conversion
- Prefix to Postfix Conversion
- Postfix to Prefix Conversion
- Postfix to Infix Conversion
- Floor in BST
- Delete nodes having greater value on right
- Remove duplicates from an unsorted linked list
- Split a Linked List into two halves
- Kth from End of Linked List
- Check If Circular Linked List
- Left View of Binary Tree
- Intersection Sorted Linked Lists
- Remove Duplicates from a Sorted Linked List
- DFS of Graph
- BFS of graph
- Square Root
- Binary Search
- Multiply two linked lists
- Max distance between same elements
- Max and min element in Binary Tree
- Reverse Using Stack
- Queue Reversal
- Reverse first K of a Queue
- Delete Mid of a Stack
- Floor in a Sorted Array
- Print adjacency list
- Minimum Cost of ropes
- Find Kth Rotation
- Professor and Parties
- Minimize Difference in Task Priorities
- Second Largest
- Check if array is sorted
- Two sum -Pairs with 0 Sum
- Number of 1 Bits
- Max Sum Subarray of size K
- Ceil The Floor
- Minimum steps to minimize n as per given condition
- Find nth root of m
- Move Last Element to Front of a Linked List
- Find the first node of loop in linked list
- Unleashing the Array's Potential
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