53: Doubly Linked List-1 (basics)

# Representation:-

-----------------------------------------------------------------------------------------------------------------------------

# Converting array to doubly LL:-

----------------------------------------------------------------------------------------------------------------------------

# Deletions in DLL:-

1. Deleting head-


2. deleting tail-

3. deleting Kth node-⭐⭐

4. Delete given node-
----------------------------------------------------------------------------------------------------------------------------

# Insertions in DLL:-

1. before head-


2. before tail-

3. before Kth node-

4. before given node-
-----------------------------------------------------------------------------------------------------------------------------

Comments

Post a Comment

Popular posts from this blog

30.) DP on subsequences

Image
Subset sum = target✅⭐ Partition equal subset sum✅ Partition array into 2 subsets with min abs [sum(v1)-sum(v2) ]✅ Count subsets with sum k✅⭐ Count partitions with given diff✅ target sum✅ 0/1 knapsack✅⭐ min coins✅---->count min coins to be taken coin change-2--->count n(ways) of taking coins⭐✅ unbounded knapsack✅ rod cutting problem✅ ----------------------------------------------------------------------------------------------------------------------------- 2 ways to generate all subsequences- Power Set, or Recursion subset means subsequence in dsa ----------------------------------------------------------------------------------------------------------------------------- 1. Target Sum- QUES- return true if there exists a subset with sum equal to the target in the array... Soln assuming all array elements are positive  here f(n-1,target) will tell if there's a subsequence till n-1 index with sum = target 1.) RECURSIVE SOLN-        ( time: 2^n    ...
Read more

36. Graphs-2 (grid/traversal problems)

Image
 PROBLEMS ON BFS/ DFS:- no. of provinces          ✅ components rotten oranges            ⭐✅ multi source BFS no. of islands              ✅ BFS/ DFS flood fill                     ✅ BFS/ DFS no. of enclaves           ⭐✅ multi source   BFS/DFS no. of distinct islands ⭐✅ shape storing   BFS/ DFS surrounded regions    ✅ multi source   BFS/DFS 0/1 Matrix                  ⭐⭐✅ multi source BFS word ladder-1 , 2 ---------------------------------------------------------------------------------------------------------------------------- 1. No. of provinces Count total components in a graph time- O(N + V+2E)               space: O(N) --------------------------------------------------------------------------------...
Read more

19. Strings (LB)

Image
Character Array- 1. We use  1d character array  to simulate strings, e.g., char ch[10]; cin>>ch; 2. string ends with '\0' 3. cin with string works only if till space, tab or new line is absent in input... 4. work with character array just like a normal array, here only datatype is changed to char, else wise it is just an array -------------------------------------------- 5. In-Built functions- - int n = strlen(ch)   - strcmp(s1,s2)            // gives 0 if both strings are equal  - strcpy(dest,source)   // copies a string from dest to source -------------------------------------------- ----------------------------------------------------------------------------------------------------------------------------- STRING- It is a C++ STL 1. has dynamic size (can dynamically increase size when needed) 2. null terminator (\0) NOT required 3. Has built-in functions : - return s.size() - return s == "hello" - return s + "wor...
Read more