Data Structure
Java
Python
HTML
Interview Preparation
- Tutorials
- Courses
- Tracks
pragya_chaurasia
STREAK
00/1550
days
Longest streak/Global longest streak
Language Used
C++, C
Coding Score
431
Problem Solved
173
Contest Rating
__
636 points
Contributor
636 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 (13)
EASY (66)
MEDIUM (82)
HARD (12)
- Reverse a linked list
- Frequency in a Linked List
- Pairwise swap elements of a linked list
- Remove duplicates from an unsorted linked list
- Split a Linked List into two halves
- Inorder Traversal
- Bubble Sort
- Selection Sort
- Insertion Sort
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Two Mirror Trees
- 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
- Find Transition Point
- Queue using two Stacks
- Remove Duplicates from a Sorted Linked List
- Level Order in spiral form
- Reverse Level Order Traversal
- DFS of Graph
- Stack using Linked List
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Nodes without a Sibling
- Binary Search
- Minimum Depth of a Binary Tree
- Odd even level difference
- Minimum distance in an Array
- Array Duplicates
- Minimum element in BST
- Full Binary Tree
- Symmetric Tree
- Maximum Node Level
- Queue Reversal
- Remove Half Nodes
- Height of Spiral Tree
- Sum of Left Leaf Nodes
- Equilibrium Point
- Array Leaders
- Anagram
- String Rotated by 2 Places
- Reverse Words
- Parenthesis Checker
- Missing in Array
- Roman Number to Integer
- Cousins in Tree
- Missing And Repeating
- Sort Array II
- Remove Duplicates
- Twice Counter
- Second Largest
- Two Sum - Pair with Given Sum
- Number of occurrence
- Longest Common Prefix of Strings
- Number of 1 Bits
- Palindrome
- Assign Mice Holes
- Pair cube count
- Trailing zeroes in factorial
- Rotate a Linked List
- Sort a linked list of 0s, 1s and 2s
- Rearrange a linked list
- Detect Loop in linked list
- Count BST nodes that lie in a given range
- Check for BST
- Merge Sort
- Quick Sort
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Heap Sort
- Merge two sorted linked lists
- Sum Tree
- Connect Nodes of Levels
- Flattening a Linked List
- Stack using Queue
- Delete a node from BST
- Directed Graph Cycle
- LCA in Binary Tree
- Lowest Common Ancestor in a BST
- The Celebrity Problem
- Topological sort
- Vertical Tree Traversal
- Get Min from Stack
- Gas Station
- Linked List to Binary Tree
- Remove loop in Linked List
- Implement Atoi
- Palindrome Linked List
- Strongly Connected
- Top View of Binary Tree
- k-th Smallest in BST
- Peak element
- Ancestors in Binary Tree
- Binary Tree to CDLL
- Vertical sum
- Isomorphic Trees
- Diagonal sum in binary tree
- Find length of Loop
- Sum of nodes on the longest path
- ZigZag Tree Traversal
- Pairwise swap of nodes in Linked List
- Wave Array
- Stock buy and sell
- Kadane's Algorithm
- Majority Element
- Indexes of Subarray Sum
- Stock span problem
- Next Greater Element
- K Sized Subarray Maximum
- Kth smallest element
- Stickler Thief
- Egg Dropping Puzzle
- Minimum number of jumps
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Equal Sum Partition
- Shortest Common Supersequence
- Longest Substring Without Repeating Characters
- Maximize The Cut Segments
- Overlapping Intervals
- Sort 0s, 1s and 2s
- Pascal Triangle
- Maximum Index
- Form a palindrome
- Nuts and Bolts Problem
- Longest Common Substring
- Minimum Deletions
- Valid Substring
- Minimum Swaps for Bracket Balancing
- Permutations of a String
- Minimum number of deletions and insertions
- Max Sum Increasing Subsequence
- Coin Change (Count Ways)
- Longest Repeating Subsequence
- Stream First Non-repeating
- Segregate even and odd nodes in a Linked List
- Recursively Remove Adjacent Duplicates