- Courses
- Tutorials
- Practice
- Contests
Data Structure
Java
Python
HTML
Interview Preparation
coder001
starstarstarstar
STREAK
00/1369
days
Longest streak/Global longest streak
Institution
LOVELY PROFESSIONAL UNIVERSITY
Language Used
Java, C++, Python
Coding Score
387
Problem Solved
159
Contest Rating
1957
477 points
Contributor
477 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 (0)
BASIC (28)
EASY (58)
MEDIUM (61)
HARD (12)
- Smaller on Right
- The Conversion To One
- Get the Shadow
- Without Adjacent
- Diameter of a Binary Tree
- Heap Sort
- Connect Nodes of Levels
- Delete a node from BST
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Maximum difference between node and its ancestor
- Two Stacks in an Array
- Binary Heap Operations
- The Celebrity Problem
- Topological sort
- Find the number of islands
- Serialize and deserialize a binary tree
- Gas Station
- Linked List to Binary Tree
- Check if subtree
- Dijkstra Algorithm
- Minimum Spanning Tree
- Minimum Swaps to Sort
- Strongly Connected
- Merge two BST 's
- Merge k Sorted Arrays
- Bridge edge in a graph
- Find Common Nodes in two BSTs
- Foldable Binary Tree
- Count the nodes at distance K from leaf
- Maximum path sum from any node
- Children Sum in a Binary Tree
- Convert Level Order Traversal to BST
- ZigZag Tree Traversal
- Count Number of SubTrees having given Sum
- Vertical Width of a Binary Tree
- Floor in BST
- Ceil in BST
- Pair Sum in BST
- Kadane's Algorithm
- Possible paths between 2 vertices
- Level of Nodes
- Distance of nearest cell having 1
- Postfix Evaluation
- Stock span problem
- Next Greater Element
- Infix to Postfix
- K Sized Subarray Maximum
- Kth largest element
- Kth smallest element
- Kth largest element in a stream
- Nearly sorted
- Largest number
- Find median in a row wise sorted matrix
- X Total Shapes
- Find whether path exist
- Rotten Oranges
- Steps by Knight
- Max Possible Bitwise AND
- Max Average Subsequence
- Nearest Perfect Square
- Toggle The Middle
- K Sum
- XOR Pair
- Average of String
- Inorder Traversal
- Check for BST
- Right View of Binary Tree
- Maximum Width of Tree
- Height of Binary Tree
- Balanced Tree Check
- Queue using two Stacks
- Stack using two queues
- Level Order in spiral form
- DFS of Graph
- Stack using Linked List
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Lowest Common Ancestor in a BST
- Level Order Line by Line
- Third largest element
- Level order traversal
- Reverse first K of a Queue
- Delete Mid of a Stack
- The New Line
- Data Types
- Learn to Comment
- While loop- printTable - Java
- Deque Implementations
- Inorder traversal of a BST
- Factorial Of Number
- Digits In Factorial
- GP Term
- Print adjacency list
- Removing consecutive duplicates
- Removing consecutive duplicates - 2
- Parenthesis Checker
- K largest elements
- Doubly Linked List Conversion
- Single Appearance
- Compress String
- Rotate Deque By K
- Help the Old Man!!!
- Type Conversion
- Return Size
- Compute a/b
- Kth call
- Add - Auto Keyword
- Convert to Hexadecimal
- Global variable
- Be Precise
- Scientific Format
- Type Inference
- Find n-th Term
- Count n-digit Numbers
- Good Array
- Remove Segments
- Implement stack using array
- Queue using Linked List
- Queue Using Array
- Print number pattern
- Search a node in BST
- Minimum element in BST
- Alternates in an Array
- Operations on Stack
- Operations on Queue
- Absolute Value
- Convert Celsius To Fahrenheit
- Insertion in deque
- Deque Traversal
- Deque deletion
- Input Integer
- Print Statement
- Print With Space
- Print With Separator
- Swap The Numbers
- Arithmetic Operators
- Bitwise Operators
- Print Without Space
- Evaluate Formulae
- Print GeeksForGeeks
- Logical Operators
- Print GeeksForGeeks with quotes
- Print Boolean value
- Compare two numbers
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