- Bitwise Manipulation
- Leetcode Problems
- Basics of Recursion
- Recursion
- Arrays
- 01.Arrays
- 02.Removing Elements
- 03.MinMax
- 04.ReverseArray
- 05.SingleNumber
- 06.TwoSum
- 07.Sort Colors
- 08.Problem
- 09.Longest String
- 01.Object1
- 02.frequencyOfChar
- 03.String Interpolation
- 04.Looping on Object 1
- 05.Looping on Object 2
- 06.Unique strings
- 01.Map function
- 02.Filter function
- 03.Sort function
- 04.Reduce function
- 05.Callbacks
- 06.Problems with Callback
-
01.Basic Arrays
- 02.Objects
- 03.Higher Order Function
- 01.Class And Objects
- 02.'new' keyword and Constructor
- 03.Function Constructor
- 04.Private Variable
- 01.Create and Add Linked List At Start
- 02.ImplementDisplay in LL
- 03.Add Tail
- 04.Remove at Head
- 05.Remove at Tail
- 06.Add at Index
- 07.Remove at Index
- 08.Doubly Linked List
- 09. LL: Middle of the linked list
- 10. Problem 1 using Iteration
- 11. Problem 1 using Recursion
- 12. Problem 1 using Data Reversal Recursive
- 13. Creating LL in a modern way
- 14. Creating LL in a modern way 2
- 15. Creating LL in a modern way 3
- 16. Swap pairs of linked list
- 17. Reverse node in K groups
- 18. Cyclic detection in Linked list
- 19. Middle of the linked list
- 20. Detect and Remove loop in Linked list
- 21. Remove duplicates from sorted list
- 01. Creating a stack
- 02. Remove elements from top
- 03. Peek in stack
- 04. Creating stack using linked list
- 05. Two Stacks
- 06. Reverse String
- 07. Valid Parentheses
- 08. Insert an element at its bottom
- 09. Reverse stack using recursion
- 10. Sort a stack
- 11. Redundant Brackets
- 12. Celebrity Problem
- 01. Creating queue
- 02. Peek method in queue
- 03. Reverse a queue
- 04. Creating Queue using linked list for O(1) time complexity
- 05. Creating Queue using stacks
- 06. Priority Queue
- 07. Circular Queue
- 08. Doubly Ended Queue (DEQue)
- 09. First negative in every window of size k
- 01. Creating a hashmap