- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
D
dkhoradiya3
STREAK
00/1426
days
Longest streak/Global longest streak
Language Used
Java
Coding Score
448
Problem Solved
161
Contest Rating
__
0 submissions in current year
SCHOOL (0)
BASIC (18)
EASY (58)
MEDIUM (78)
HARD (7)
- Rotate a Linked List
- Sort a linked list of 0s, 1s and 2s
- Add Number Linked Lists
- Add 1 to a Linked List Number
- Detect Loop in linked list
- Merge Sort
- Quick Sort
- Flattening a Linked List
- Binary Heap Operations
- The Celebrity Problem
- Largest subarray with 0 sum
- Merge K sorted linked lists
- Implement Atoi
- Palindrome Linked List
- Merge k Sorted Arrays
- Sort a stack
- Linked List that is Sorted Alternatingly
- Power Of Numbers
- Possible Words From Phone Digits
- Kadane's Algorithm
- Majority Element
- Count Inversions
- Union of 2 Sorted Arrays
- Merge Without Extra Space
- Longest Consecutive Subsequence
- Stock span problem
- Next Greater Element
- Infix to Postfix
- K Sized Subarray Maximum
- Allocate Minimum Pages
- Kth Smallest
- Rotten Oranges
- Generate Parentheses
- Sort 0s, 1s and 2s
- Single Among Doubles
- Search in Rotated Sorted Array
- Max Score from Subarray Mins
- Maximum Product Subarray
- Row with max 1s
- Longest Subarray with Sum K
- Length of the longest substring
- Power Set
- Subsets with XOR value
- Subset Sums
- Next Permutation
- Kth Largest in a Stream
- Spiral Matrix
- Subarrays with sum K
- Remove K Digits
- Design Twitter
- Overlapping Intervals
- Reverse a Stack
- Pattern
- Find length of the longest subarray containing atmost two distinct integers
- Longest Repeating Character Replacement
- Maximum Consecutive Ones
- Count Subarray with k odds
- Count Substring
- Binary subarray with sum
- Maximum point you can obtain from cards
- Combination Sum III
- Aggressive Cows
- Subset II
- Combination Sum II
- Check if there exists a subsequence with sum K
- Next Greater Element 2
- Number of greater elements to the right
- Prefix to Infix Conversion
- Prefix to Postfix Conversion
- Generate all binary strings
- Delete all occurrences of a given key in a doubly linked list
- Postfix to Prefix Conversion
- Postfix to Infix Conversion
- Task Scheduler
- Hands of Straights
- Lemonade Change
- Replace elements by its rank in the array
- Convert Min Heap to Max Heap
- Reverse a linked list
- Delete in a Doubly Linked List
- Reverse a Doubly Linked List
- Bubble Sort
- Insertion Sort
- Middle of a Linked List
- Delete Middle of Linked List
- Stack using two queues
- Square Root
- Remove Duplicates Sorted Array
- Delete in a Singly Linked List
- Intersection of Two Linked Lists
- Array Leaders
- Floor in a Sorted Array
- Rotate by 90 degree
- Anagram
- Strings Rotations of Each Other
- Isomorphic Strings
- Reverse Words
- K largest elements
- Minimum Cost of ropes
- Union of Arrays with Duplicates
- Roman Number to Integer
- Missing And Repeating
- Find Kth Rotation
- Second Largest
- Number of occurrence
- Does array represent Heap
- Longest Common Prefix of Strings
- Palindrome String
- Reverse Bits
- Ceil The Floor
- Factorials Less than or Equal to n
- Good Numbers
- Make Zeroes
- Find pairs with given sum in doubly linked list
- Pattern 2
- Pattern 3
- Pattern 4
- Pattern 14
- Pattern 15
- Pattern 16
- Pattern 17
- Pattern 18
- Pattern 19
- Pattern 20
- Pattern 21
- Print N to 1 without loop
- Print GFG n times
- Pattern 12
- Pattern 22
- Largest odd number in string
- Outermost Parentheses
- Search in Linked List
- Remove duplicates from a sorted doubly linked list
- Array to Linked List
- Introduction to Doubly Linked List
- Implementation of Priority Queue using Binary Heap
- Count Linked List Nodes
- Implement stack using array
- Doubly linked list Insertion at given position
- Peak element
- Linked List Insertion At End
- Print 1 To N Without Loop
- Immediate Smaller Element
- Largest Element in Array
- LCM And GCD
- Sum of first n terms
- Pattern 1
- Pattern 5
- Pattern 6
- Pattern 7
- Pattern 8
- Pattern 10
- 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