#Day409 of #500DaysOfDSA Topics and Learnings: #BitwiseOperation Problems Re-revised: 29. #TUF+ : Find Repeating and Missing Number Approach: Used Bit-Manipulation to solve this Complexiy Analysis: TC: O(n) SC: O(1)

#Day408 of #500DaysOfDSA Topics and Learnings: #2Pointers Problems Re-revised: 28. #LeetCode #18 : 4-Sum Approach: Used #2Pointers to solve this Complexity Analysis: TC: O(N^3) SC: O(1)

#Day407 of #500DaysOfDSA Topics and Learnings: #BinarySearch Problems Re-revised: 27. #LeetCode #540 : Single Element in Sorted Array Approach: Used #BinarySearch to solve this Complexiy Analysis: TC: O(logN) SC: O(1)

#Day406 of #500DaysOfDSA Topics and Learnings: #BinarySearch Problems Re-revised: 26. #TUF+ : Find Number of Rotaions in Rotated Sorted Array Approach: Used #BinarySearch to solve this Complexity Analysis: TC: O(logN) SC: O(1)

#Day405 of #500DaysOfDSA Topics and Learnings: #LinkedList Problems Revised: 25. #TUF+ : Deletion of the Head of LL Approach: Pointed Head to next of head Complexiy Analysis: TC: O(1) SC: O(1)

#Day404 of #500DaysOfDSA Topics and Learnings: #LinkedList Problems Re-revised: 24. #LeetCode #237: Delete Node In A LinkedList Approach: Copied value of next node in given node Pointed next of given node to next to next node Complexiy Analysis: TC: O(1) SC: O(1)

#Day403 of #500DaysOfDSA Topics and Learnings: #LinkedList, #SinglyLinkedList, #2Pointers Problems Re-revised: 23. #LeetCode #876: Middle of the Linked List Approach: Used #SlowAndFastPointers to solve this Complexiy Analysis: TC: O(1) SC: O(1)

#Day402 of #500DaysOfDSA Topics and Learnings: #Recursion Problems Re-revised: 22. #LeetCode #38: Count and Say Approach: Used #Recursion to solve this Complexity Analysis: TC: Can't be Determined SC: O(N)

#Day401 of #500DaysOfDSA Topics and Learnings: #DepthFirstSearch Problems Re-revised: 21. #LeetCode #131: Palindrome Partitioning Approach: Used #DFS to solve this Complexity Analysis: TC: O(2^N) SC: O(N)

#Day400 of #500DaysOfDSA Topics and Learnings: #BinaryTree Problems Re-revised: 20. #LeetCode #101 : Symmetric Tree Approach: Used #TreeTraversal to solve this Complexiy Analysis: TC: O(N) SC: O(h)

#Day399 of #500DaysOfDSA Topics and Learnings: #TwoPointers Problems Re-revised: 19. #LeetCode #421 : Maximum XOR of Two Numbers in an Array Approach: Used #TwoPointers to solve this Complexiy Analysis: TC: O(N) SC: O(1)

#Day398 of #500DaysOfDSA Topics and Learnings: #DepthFirstSearch Problems Re-revised: 18. #LeetCode #460 : Critical Connections in a Network Approach: Used #DepthFirstSearch to solve this Complexiy Analysis: TC: O(V + E) SC: O(V)

#Day397 of #500DaysOfDSA Topics and Learnings: #DoublyLinkedList Problems Re-revised: 17. #LeetCode #460 : LFU Cache Approach: Used #DoublyLinkedList to solve this Complexiy Analysis: TC: O(N) SC: O(cap)

#Day396 of #500DaysOfDSA Topics and Learnings: #BDisjointSet Problems Re-revised: 16. #LeetCode #721 : Accounts Merge Approach: Used #DisjointSet to solve this Complexiy Analysis: TC: O(N+E) + O(E*4ɑ) + O(N*(ElogE + E)) (where E = no. of emails) SC: O(N+E)

#Day395 of #500DaysOfDSA Topics and Learnings: #BDisjointSet Problems Re-revised: 15. #LeetCode #1319 : Number of Operations to Make Network Connected Approach: Used #DisjointSet to solve this Complexiy Analysis: TC: O(N+M) SC: O(N)

#Day394 of #500DaysOfDSA Topics and Learnings: #BinaryTree, #BreadthFirstSearch Problems Re-revised: 14. #LeetCode #127 : Word Ladder Approach: Used #BreadthFirstSearch to solve this Complexiy Analysis: TC: O(N) SC: O(N)

#Day393 of #500DaysOfDSA Topics and Learnings: #BinaryTree Problems Re-revised: 13. #LeetCode #222 : Count Complete Tree Nodes Approach: Used Height of Left and Right Subtrees to solve this Complexiy Analysis: TC: O(log N * log N) SC: O(log N)

#Day392 of #500DaysOfDSA Topics and Learnings: #BinaryTree, #LevelOrderTraversal Problems Re-revised: 12. #LeetCode #662 : Maximum Width of Binary Tree Approach: Used Level-Order Traversal to solve this Complexiy Analysis: TC: O(N) SC: O(N)

#Day391 of #500DaysOfDSA Topics and Learnings: #BinaryTree, #LevelOrderTraversal Problems Re-revised: 11. #LeetCode #103 : Binary Tree Zigzag Level Order Traversal Approach: Enhancement of #LevelOrderTraversal Complexiy Analysis: TC: O(N) SC: O(N)

#Day390 of #500DaysOfDSA Topics and Learnings: #GreedyAlgorithm Problems Re-revised: 10. #LeetCode #435 : Non-overlapping Intervals Approach: Used #GreedyAlgorithm to solve this Complexiy Analysis: TC: O(N log N + N) SC: O(1)