Program to convert a binary search tree to doubly linked list with in order traversal. The left and right pointers in nodes are to be used as previous and next pointers respectively in converted Circu
Kth Largest Element, is a Heap related problem and in this post we will see how we can solve this challenge in C++ given an array of elements ,find the kth largest element can be done using sliding w
K Sorted Array, is a Heap related problem and in this post we will see how we can solve this challenge in C++ given an array which is k sorted that means all the elements are atmost k distance far fr
Insert Element Heap, is a Heap related problem and in this post we will see how we can solve this challenge in C++ insert an element in heap TC O logn Heap creation for Max heap Please check the m
Heap Sort Inplace, is a Heap related problem and in this post we will see how we can solve this challenge in C++ Inplace heap sort with the given array create a heap then delete one by one element an
Heap Sort, is a Heap related problem and in this post we will see how we can solve this challenge in C++ Heap sort an array with the given array create a heap then delete one by one element and add i
Get MaxElement, is a Heap related problem and in this post we will see how we can solve this challenge in C++ Heap creation for Max heap Please check the main.cpp snippet for the solution. This solut
Delete Element Heap, is a Heap related problem and in this post we will see how we can solve this challenge in C++ delete the top most element from heap Deletion is there for the first element of arr
Build Heap, is a Heap related problem and in this post we will see how we can solve this challenge in C++ Heap creation for Max heap Please check the main.cpp snippet for the solution. This solution
Valid Parentheses, is a LeetCode problem from data structures subdomain. This problem has also been asked in companies like Google,Amazon during the interview. In this post we will see how we can sol
Ternary Expression Parser, is a LeetCode problem from data structures subdomain. This problem has also been asked in companies like Snapchat during the interview. In this post we will see how we can
Simplify Path, is a LeetCode problem from data structures subdomain. In this post we will see how we can solve this challenge in Swift You can find the full details of the problem Simplify Path at Le
Remove K Digits, is a LeetCode problem from data structures subdomain. This problem has also been asked in companies like Snapchat during the interview. In this post we will see how we can solve this
Binary Tree Preorder Traversal, is a LeetCode problem from data structures subdomain. In this post we will see how we can solve this challenge in Swift You can find the full details of the problem Bi
Binary Tree Postorder Traversal, is a LeetCode problem from data structures subdomain. In this post we will see how we can solve this challenge in Swift You can find the full details of the problem B
Min Stack, is a LeetCode problem from data structures subdomain. In this post we will see how we can solve this challenge in Swift You can find the full details of the problem Min Stack at LeetCode S
Max Stack, is a LeetCode problem from data structures subdomain. In this post we will see how we can solve this challenge in Swift You can find the full details of the problem Max Stack at LeetCode S
Longest Valid Parentheses, is a LeetCode problem from data structures subdomain. In this post we will see how we can solve this challenge in Swift You can find the full details of the problem Longest
Binary Tree Inorder Traversal, is a LeetCode problem from data structures subdomain. In this post we will see how we can solve this challenge in Swift You can find the full details of the problem Bin
Exclusive Time of Functions, is a LeetCode problem from data structures subdomain. In this post we will see how we can solve this challenge in Swift You can find the full details of the problem Exclu
Recent comments on data-structures
can you please explain the logic behind the answer
This is a good logic to reduce the processing time. This is much better than the oth