- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
V
vivekchaudharyy
STREAK
10/1426
days
Longest streak/Global longest streak
Language Used
C++, Java
Coding Score
1401
Problem Solved
426
Contest Rating
__
153 points
Contributor
153 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
0 submissions in current year
SCHOOL (0)
BASIC (18)
EASY (145)
MEDIUM (230)
HARD (33)
- Count Linked List Nodes
- Implement stack using array
- Queue Using Array
- Doubly linked list Insertion at given position
- Search a node in BST
- Peak element
- Minimum element in BST
- Identical Linked Lists
- Alternates in an Array
- Array Search
- Sum of numbers in string
- Reverse a String
- Value equal to index value
- Max Min
- Small Sum
- Naughty Geek
- Friend of x
- Time Travel
- Reverse a linked list
- Pairwise swap elements of a linked list
- Linked list of strings forms a palindrome
- Remove duplicates from an unsorted linked list
- Delete in a Doubly Linked List
- Reverse a Doubly Linked List
- Check for BST
- Right View of Binary Tree
- Mirror Tree
- Delete without head pointer
- 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
- Delete Middle of Linked List
- Decimal Equivalent of Binary Linked List
- Intersection Sorted Linked Lists
- Find Transition Point
- Remove Duplicates from a Sorted Linked List
- Stack using two queues
- Reverse Level Order Traversal
- DFS of Graph
- BFS of graph
- Identical Trees
- Root to leaf path sum
- Square Root
- Nodes without a Sibling
- Lowest Common Ancestor in a BST
- Binary Search
- BST Keys in a Range
- Binary Tree to BST
- Remove every k'th node
- Multiply two linked lists
- You and your books
- Max distance between same elements
- Kth largest element in BST
- Array Duplicates
- Special Stack
- Level order traversal
- Index of an Extra Element
- Sum of leaf nodes in BST
- More than n/k Occurrences
- Reverse Using Stack
- Count Pairs whose sum is equal to X
- Median of BST
- Queue Reversal
- Reverse first K of a Queue
- Brothers From Different Roots
- Delete Mid of a Stack
- Precise Format - Java
- Swap the array elements
- Predict the Column
- First Set Bit
- Roof Top
- Print adjacency list
- Reverse Words
- Panagram Checking
- Parenthesis Checker
- K largest elements
- Minimum Cost of ropes
- N meetings in one room
- Reach a given score
- Count ways to N'th Stair
- Check Equal Arrays
- Missing in Array
- Intersection of Arrays with Distinct
- Max Value Permutation
- Missing And Repeating
- Count the elements
- Find the closest number
- String Duplicates Removal
- Min sum formed by digits
- Move all negative elements to end
- Count pairs Sum in matrices
- Find Pair Given Difference
- Alternate Positive Negative
- Remaining String
- Remove Duplicates
- Second Largest
- Convert array into Zig-Zag fashion
- Number of occurrence
- K-Pangrams
- Does array represent Heap
- Check if array is sorted
- Find missing in second array
- Two sum -Pairs with 0 Sum
- Segregate 0s and 1s
- Play With OR
- At Least K Occurrences
- Merge two binary Max heaps
- Palindrome String
- Total count
- Odd Even Problem
- Binary representation of next number
- Is Binary Number Multiple of 3
- Padovan Sequence
- Extract the Number from the String
- Divisibility by 8
- Number of 1 Bits
- Find the Highest number
- Armstrong Numbers
- Nth Fibonacci Number
- Maximum Sum Problem
- Party of Couples
- Count numbers containing 4
- Reach the Nth point
- Recamans sequence
- Compare two fractions
- Recursive sequence
- Juggler Sequence
- Summed Matrix
- Row with Minimum 1s
- Coverage of all Zeros in a Binary Matrix
- Inorder Traversal and BST
- Array to BST
- Count all possible paths from top left to bottom right
- Queue using stack
- Insert an Element at the Bottom of a Stack
- Print N to 1 without loop
- Print GFG n times
- Fibonacci series up to Nth term
- Stock Buy and Sell – Max one Transaction Allowed
- Divisor Game
- Find the first node of loop in linked list
- Reverse both parts
- Calculate The Work Done
- Magic and toy shop
- What Mean do you Mean?
- Maximum Money
- Strong Students in School
- Complete the Staircase
- String Matching
- Silver and Gold
- Weird Island
- Same characters
- Find Bots on Geeklandster
- Build Adjacency List
- Strong Students in School
- Is it a Leap Year
- Minimum Distance
- Count Indices
- Array Game
- Chocolate Distribution
- Reverse alternate nodes in Link List
- Rotate a Linked List
- Sort a linked list of 0s, 1s and 2s
- Add Number Linked Lists
- Rearrange a linked list
- Add 1 to a Linked List Number
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- Insert in Sorted Circular Linked List
- Count BST nodes that lie in a given range
- Merge Sort
- Quick Sort
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Heap Sort
- Merge two sorted linked lists
- Add all greater values to every node in a BST
- Sum Tree
- Flattening a Linked List
- Diagonal Tree Traversal
- Tree Boundary Traversal
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Two Stacks in an Array
- The Celebrity Problem
- Topological sort
- Vertical Tree Traversal
- Merge K sorted linked lists
- Find the number of islands
- Get Min from Stack
- Gas Station
- Wildcard Pattern Matching
- Linked List to Binary Tree
- Is Binary Tree Heap
- Remove loop in Linked List
- Dijkstra Algorithm
- Minimum Spanning Tree
- Largest BST
- Sorted subsequence of size 3
- Palindrome Linked List
- Strongly Connected
- Print matrix in diagonal pattern
- Rat in a Maze Problem - I
- Bipartite Graph
- Closest in BST
- Pots of Gold Game
- Merge two BST 's
- Merge k Sorted Arrays
- Find triplets with zero sum
- Sort a stack
- Top View of Binary Tree
- k-th Smallest in BST
- Merge Sort for Linked List
- Pair Sum in BST
- Populate Inorder Successor for all nodes
- Linked List that is Sorted Alternatingly
- Construct Tree from Inorder & Preorder
- Predecessor and Successor
- Deletion and Reverse in Circular Linked List
- Normal BST to Balanced BST
- Sum of nodes on the longest path
- Kth Ancestor in a Tree
- ZigZag Tree Traversal
- Maximum sum of Non-adjacent nodes
- Mother Vertex
- Smallest Positive Missing
- Maximum occured integer
- Possible Words From Phone Digits
- Stock buy and sell
- Rotate Array
- Kadane's Algorithm
- Majority Element
- Count Inversions
- Two Repeated Elements
- Union of 2 Sorted Arrays
- Triplet Sum in Array
- Merge Without Extra Space
- Possible paths between 2 vertices
- Level of Nodes
- Distance of nearest cell having 1
- Unit Area of largest region of 1's
- Sort Elements by Decreasing Frequency
- Postfix Evaluation
- Next Greater Element
- K Sized Subarray Maximum
- Nearly sorted
- Combination Sum
- Unique Subsets
- M-Coloring Problem
- Detect Cycle using DSU
- Ways to write n as sum
- Stickler Thief
- Ways to Reach the n'th Stair
- Sum of all substrings of a number
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Number of Unique Paths
- Preorder to BST
- X Total Shapes
- Find whether path exist
- Kth Smallest
- Implement Trie
- Shortest Common Supersequence
- Rotten Oranges
- Closest Three Sum
- Stock Buy and Sell – Multiple Transaction Allowed
- Word Search
- Prerequisite Tasks
- 4 Sum - All Quadruples
- Sort 0s, 1s and 2s
- Paths to reach origin
- Pascal Triangle
- Sum of Middle elements of two sorted arrays
- Single Among Doubles
- Search in Rotated Sorted Array
- Sum of bit differences
- Row with max 1s
- Form a palindrome
- Nuts and Bolts Problem
- Max Sum without Adjacents
- Shuffle integers
- k largest elements
- Longest Common Substring
- Longest Palindrome in a String
- K-th element of two Arrays
- Triplets with Smaller Sum
- Rod Cutting
- Longest Palindromic Subsequence
- Largest Sum Subarray of Size at least K
- First negative in every window of size k
- Minimum sum
- Not a subset sum
- Minimize the Heights II
- First and Last Occurrences
- Valid Substring
- Permutations of a String
- Unique Number II
- Modified Game of Nim
- Minimum number of deletions and insertions
- Maximize dot product
- Coin Change (Count Ways)
- Sequence of Sequence
- Mobile numeric keypad
- Coin Change (Minimum Coins)
- Perfect Sum Problem
- Power Set
- Count ways to N'th Stair(Order does not matter)
- Minimum Cost To Make Two Strings Identical
- Knapsack with Duplicate Items
- nCr
- Maximum path sum in matrix
- Minimum steps to destination
- Partition Equal Subset Sum
- Subset Sums
- Unique partitions
- Smaller on Left
- Stream First Non-repeating
- Segregate even and odd nodes in a Linked List
- Number of Rectangles in a Circle
- Kth Largest in a Stream
- Replace O's with X's
- Floyd Warshall
- Negative weight cycle
- Flood fill Algorithm
- Shortest Source to Destination Path
- Help Classmates
- Jump Game
- Triplets with sum with given range
- Subset Sum Problem
- Longest Palindromic Substring
- Form a palindrome
- All Palindromic Partitions
- Bellman-Ford
- Number of Provinces
- Find duplicate rows in a binary matrix
- BST to greater sum tree
- Paths from root with a specified sum
- Remove all occurences of duplicates in a linked list
- Subsets
- Flatten binary tree to linked list
- IPL 2021 - Match Day 2
- Unique Number III
- All Unique Permutations of an array
- Course Schedule
- Clone an Undirected Graph
- Find Kth permutation
- Reverse a Stack
- K-th Largest Sum Contiguous Subarray
- Interleave the First Half of the Queue with Second Half
- Smallest sum contiguous subarray
- Stack Permutations
- Expression contains redundant bracket or not
- Graph is Tree or Not
- Number of Distinct Islands
- Shortest Distance in a Binary Maze
- Minimum Multiplications to reach End
- Number Of Enclaves
- Eventual Safe States
- City With the Smallest Number of Neighbors at a Threshold Distance
- Number Of Islands
- Number of Ways to Arrive at Destination
- Path With Minimum Effort
- Cheapest Flights Within K Stops
- Connecting the graph
- Shortest Path in Undirected Graph
- Maximum Stone Removal
- Shortest path in Directed Acyclic Graph
- Majority Element II
- Minimal Cost
- Stock Buy and Sell – with Cooldown
- Combination Sum III
- Combination Sum II
- Shortest Path in Weighted undirected graph
- Buy Stock with Transaction Fee
- Partitions with Given Difference
- Flattening a Linked List
- Next Greater Element in Circular Array
- Geeks And The String
- Max Sum without Adjacents
- Unique Paths in a Grid
- Number of Good Components
- Modify Linked List-1
- Find Kth permutation
- Total pairs
- Collecting Coins
- Flatten BST to sorted list
- Last Fairy Standing
- Linked List Group Reverse
- Clone List with Next and Random
- Max rectangle
- Distinct occurrences
- Alien Dictionary
- Smallest range in K lists
- Merge Sort on Doubly Linked List
- String Permutations
- Trapping Rain Water
- Smallest window containing all characters of another string
- Histogram Max Rectangular Area
- Find median in a stream
- Solve the Sudoku
- Strongly connected component (Tarjans's Algo)
- Minimum Cost Path
- Word Ladder I
- Median of 2 Sorted Arrays of Different Sizes
- Burning Tree
- Edit Distance
- Minimum sum partition
- Stock Buy and Sell – Max K Transactions Allowed
- Longest valid Parentheses
- N-Queen Problem
- Phone directory
- Word Ladder II
- Distribute candies in a binary tree
- Articulation Point - I
- Stock Buy and Sell – Max 2 Transactions Allowed
- Maximum Connected group
- Account Merge
- Chocolates Pickup
- Making A Large Island
- Stable Array
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