SDE - 1

Step 1: Start with the given array and the target sum.
Step 2: Initialize two pointers, left and right, pointing to the first and last elements of the array, respectively.
Step 3: Sort the array in non-decreasing order. You can choose an appropriate sorting algorithm such as merge sort or quicksort.
Step 4: While the left pointer is less than the right pointer, do the following steps:

Calculate the sum of the elements at the left and right pointers.
If the sum is equal to the target sum, return true as a pair with the given sum exists.
If the sum is less than the target sum, increment the left pointer to move towards larger elements.
If the sum is greater than the target sum, decrement the right pointer to move towards smaller elements.
Step 5: If no pair is found after exhausting all possible combinations, return false as no pair with the given sum exists in the array.

Create a dummy node and set its next pointer to the head of the given linked list. This dummy node will serve as the new head of the modified linked list.

Initialize a pointer prev to the dummy node.
Traverse the linked list by pairs (every two adjacent nodes).

Initialize two pointers curr and next to track the current pair of nodes.
Set curr to the next node of prev and next to the next node of curr.
Swap the pair of nodes (curr and next).

Set the next pointer of prev to next to link the previous pair with the current pair.
Set the next pointer of curr to the next node of next to complete the swap.
Set the next pointer of next to curr to maintain the correct order of the nodes.
Move prev to the next pair of nodes.

Set prev to curr to move it to the current pair's end.
Repeat steps 2-4 until either curr or next becomes None (reached the end of the list or there's no next pair).

Return the modified head of the linked list, which is the next node of the dummy node.

Step 1: I created a structure for the doubly linked list node with attributes like "key," "value," "prev," and "next" pointers.

Step 2: Then, I initialized a hash table (dictionary) to store the cache entries.

Step 3: When a new key-value pair is accessed, I first checked if the key is present in the hash table.

Step 4: If the key exists, I updated the value and moved the corresponding node to the front of the linked list to mark it as the most recently used.

Step 5: If the key doesn't exist, I created a new node, added it to the front of the linked list, and added the key-value pair to the hash table.

Step 6: If the cache size exceeded the specified capacity, I removed the least recently used node from the end of the linked list and also removed its entry from the hash table.

Step 7: To get a value from the cache, I checked if the key was present in the hash table. If so, I returned the corresponding value and moved the node to the front of the linked list.

Step 8: I handled the edge cases, such as when the cache is empty or when the capacity is set to zero.

Step 1: Identify the necessary tables and columns:

Tables: Customers, Orders
Columns: Customers.customer_id, Customers.customer_name, Orders.order_id, Orders.order_date
Step 2: Retrieve the orders placed in the last month:

Use the same steps as in the previous question to get the orders placed in the last month.
Step 3: Join the Customers and Orders tables:

Use the INNER JOIN keyword to combine the two tables based on the common column, which is Customers.customer_id and Orders.customer_id.
Include the join condition in the ON clause: Customers.customer_id = Orders.customer_id.
Step 4: Select the desired columns:

Choose the columns you want to retrieve from both tables, such as Customers.customer_id, Customers.customer_name, Orders.order_id, Orders.order_date.
Step 5: Apply any additional filters or sorting if required:

If you need to apply further conditions, use the WHERE clause.
If you want to sort the results, use the ORDER BY clause.
Step 6: Execute the SQL query and retrieve the results.

Tip 1:Pay close attention to the puzzle's instructions and any given constraints. Make sure you fully understand what is expected of you before diving into the problem. 
Tip 2: Break the puzzle into smaller components or sub-problems. This will help you tackle it step by step and prevent feeling overwhelmed. Identify any patterns or recurring elements that can guide your approach.
Tip 3:Take a moment to plan your strategy before jumping into solving the puzzle. Consider different techniques or algorithms that might be applicable, and decide on the best approach based on the given problem.

Tip 1: Study what company do and what are their core values and how they align with your goals
Tip 2: Show how your previous experience makes you a perfect candidate for this role
Tip 3: Be confindent and maintain a decent happy tone.

Tip 1: Give them honest answers which are related to your ambitions
Tip 2: don't add things like money and lifestyle
Tip 3: Try to align your values with software engineer