Godaddy Interview Questions (4+ Questions)

Learn how to find and split large files into smaller chunks automatically using Linux Bash commands. This guide covers searching for oversized files recursively, splitting them into size-compliant parts, preserving originals, and organizing output essential for handling upload size restrictions, file transfer automation, and cloud migration workflows.

Keep submodules current by pulling the latest commits from their remote repositories and updating parent repository references. Navigate into submodules, pull changes, stage updated references, and commit the upgrade. Essential for maintaining dependency versions, accessing latest features and security patches, coordinating multi-repository updates, and managing vendor library versions in complex projects.

Build an S3 ingestion pipeline with KMS encryption enforcement, EventBridge-driven validation, quarantine handling, SNS alerting, and CloudWatch logging.

Interview Question: SQL Query to Compute neighbor_product in products Table

Objective

In this SQL interview question, your goal is to demonstrate your ability to work with window functions and handle missing dataset values using COALESCE. You are given a table named products and need to compute a new column named neighbor_product. This column should contain the product (multiplicative result) of the prices of the immediate previous and next products based on the ascending order of prices. If there is no previous or next product, treat the missing price as 0.

SQL Query Solution

WITH price_neighbors AS (
  SELECT
    id,
    product_name,
    price,
    LAG(price, 1, 0) OVER (ORDER BY price) AS prev_price,
    LEAD(price, 1, 0) OVER (ORDER BY price) AS next_price
  FROM
    products
)
SELECT
  product_name,
  price,
  (prev_price * next_price) AS neighbor_product
FROM
  price_neighbors
ORDER BY
  price ASC;

Explanation:

1. Step 1: Create a Common Table Expression (CTE) called price_neighbors to calculate the previous and next prices using the LAG and LEAD window functions.

   • LAG(price, 1, 0) OVER (ORDER BY price): Fetches the price of the immediate previous product. If there is no previous product, it defaults to 0.
   • LEAD(price, 1, 0) OVER (ORDER BY price): Fetches the price of the immediate next product. If there is no next product, it defaults to 0.

2. Step 2: In the main SELECT query, calculate the neighbor_product by multiplying prev_price and next_price.

3. Step 3: Retrieve the product_name, price, and computed neighbor_product and order the results by price in ascending order.

Additional Information

• The products table has the following structure:
  • id (integer): A unique identifier for each product.
  • product_name (string): The name of the product.
  • price (integer): The price of the product.
• Constraints:
  • Each product will have a unique price.
  • There will be at least one product in the table.
• Special remarks:
  • Use SQL window functions to access the previous and next prices in the sorted list.
  • Consider using COALESCE to handle cases where the previous or next price is missing.

By following this solution, you demonstrate your proficiency in SQL, particularly in using window functions and handling edge cases, which are crucial skills for data manipulation and analysis.