- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
P
prachibindal2925
STREAK
00/1431
days
Longest streak/Global longest streak
Language Used
C++, Java, Python, C
Coding Score
388
Problem Solved
165
Contest Rating
__
423 points
Contributor
423 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
1 submissions in current year
SCHOOL (1)
BASIC (24)
EASY (66)
MEDIUM (64)
HARD (10)
- Add 1 to a Linked List Number
- Detect Loop in linked list
- Count BST nodes that lie in a given range
- Binary Tree from Inorder and Postorder
- Intersection in Y Shaped Lists
- Diagonal Tree Traversal
- Delete a node from BST
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Binary Heap Operations
- Largest subarray with 0 sum
- Topological sort
- Vertical Tree Traversal
- Serialize and deserialize a binary tree
- Palindrome Linked List
- Rat in a Maze Problem - I
- Closest in BST
- Merge two BST 's
- Find triplets with zero sum
- k-th Smallest in BST
- Root to Leaf Paths
- Construct Tree from Inorder & Preorder
- Children Sum in a Binary Tree
- ZigZag Tree Traversal
- Rearrange an array with O(1) extra space
- Stock buy and sell
- Kadane's Algorithm
- Triplet Sum in Array
- Subarray with 0 sum
- Fractional Knapsack
- Job Sequencing Problem
- Minimum Platforms
- M-Coloring Problem
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Kth Smallest
- Implement Trie
- Shortest Common Supersequence
- Maximize The Cut Segments
- Word Break
- Sort 0s, 1s and 2s
- Form the Largest Number
- Form a palindrome
- k largest elements
- Longest Common Substring
- Smallest distinct window
- Longest Substring with K Uniques
- K-th element of two Arrays
- Minimize the Heights II
- First and Last Occurrences
- Minimum Deletions
- Permutations of a String
- Coin Change (Count Ways)
- Coin Change (Minimum Coins)
- Partition Equal Subset Sum
- Subset Sums
- Permutation with Spaces
- Two numbers with odd occurrences
- Subset Sum Problem
- Bellman-Ford
- Pattern
- Make Parity Same
- Shortest Job first
- Reverse a linked list
- Node at a given index in linked list
- Remove duplicates from an unsorted linked list
- Split a Linked List into two halves
- Inorder Traversal
- Reverse a Doubly Linked List
- Bubble Sort
- Selection Sort
- Insertion Sort
- K distance from root
- Mirror Tree
- Delete without head pointer
- Height of Binary Tree
- Balanced Tree Check
- Middle of a Linked List
- Check If Circular Linked List
- Left View of Binary Tree
- Transform to Sum Tree
- Intersection Sorted Linked Lists
- Find Transition Point
- Remove Duplicates from a Sorted Linked List
- Reverse Level Order Traversal
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Root to leaf path sum
- Lowest Common Ancestor in a BST
- Remove Duplicates Sorted Array
- Minimum Depth of a Binary Tree
- Binary Tree to BST
- Max distance between same elements
- Kth largest element in BST
- Level order traversal
- Max and min element in Binary Tree
- Reverse Using Stack
- Min Heap implementation
- Check K-th Bit
- Digits In Factorial
- GP Term
- Primality Test
- Longest Consecutive 1's
- Exactly 3 Divisors
- Power of 2
- Wave Array
- Equilibrium Point
- Array Leaders
- N meetings in one room
- Intersection of Arrays with Distinct
- Chocolate Distribution Problem
- Count the triplets
- Bitonic Point
- Smallest subarray with sum greater than x
- Two Sum - Pair with Given Sum
- Two sum -Pairs with 0 Sum
- Segregate 0s and 1s
- Palindrome String
- Number of 1 Bits
- Find the Highest number
- Minimum steps to minimize n as per given condition
- Page Faults in LRU
- Pattern 2
- Pattern 3
- Pattern 4
- Geek and Balls
- Geek left with No Food
- Rotate Array
- Count Linked List Nodes
- Power of Four
- Size of Binary Tree
- Postorder Traversal
- Preorder Traversal
- Smallest divisible number
- Minimum element in BST
- Quadratic Equation Roots
- Print 1 To N Without Loop
- Binary Array Sorting
- Reverse a String
- Value equal to index value
- Fighting the darkness
- Rotate Array by One
- Array Subset
- Count Squares
- Middle of Three
- Pattern 5
- Pattern 6
- Pattern 7
- Pattern 8
- Pattern 11
- Pattern 13
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