DEV Community: Codes With Pankaj

In-Depth Tutorial: Multitable Queries (Joins) with Codes With Pankaj

Codes With Pankaj — Mon, 10 Feb 2025 01:01:16 +0000

1. Introduction to Joins

Joins combine data from multiple tables using a common column. They are essential for querying relational databases.

Example Tables:

-- Parent Table: Departments
CREATE TABLE Departments (
    DeptID INT PRIMARY KEY,
    DeptName VARCHAR(50)
);

-- Child Table: Employees
CREATE TABLE Employees (
    EmpID INT PRIMARY KEY,
    EmpName VARCHAR(50),
    DeptID INT,
    FOREIGN KEY (DeptID) REFERENCES Departments(DeptID)
);

2. Two-Table Query Example (Equi-Join)

Goal: List employees with their department names.

Equi-Join uses = to match columns.

Step 1: Use `WHERE` Clause (Old Syntax)

SELECT Employees.EmpName, Departments.DeptName
FROM Employees, Departments
WHERE Employees.DeptID = Departments.DeptID;

Step 2: Use `INNER JOIN` (ANSI SQL)

SELECT E.EmpName, D.DeptName
FROM Employees E
INNER JOIN Departments D ON E.DeptID = D.DeptID;

3. Parent/Child Queries

Parent-child relationships use foreign keys.

Example:

-- Find departments with no employees (Parent without Children)
SELECT D.DeptName
FROM Departments D
LEFT JOIN Employees E ON D.DeptID = E.DeptID
WHERE E.EmpID IS NULL;

4. Alternative Join Syntax

Use JOIN with USING for same column names:

SELECT EmpName, DeptName
FROM Employees
JOIN Departments USING (DeptID);

5. Joins with Row Selection

Filter results after joining:

SELECT E.EmpName, D.DeptName
FROM Employees E
INNER JOIN Departments D ON E.DeptID = D.DeptID
WHERE D.DeptName = 'Sales';

6. Multiple Matching Columns

Join on multiple columns:

-- Example: Orders and Products (ProductID + SupplierID)
SELECT *
FROM Orders O
JOIN Products P ON O.ProductID = P.ProductID AND O.SupplierID = P.SupplierID;

7. Natural Joins

Automatically joins on same-named columns:

SELECT EmpName, DeptName
FROM Employees
NATURAL JOIN Departments; -- Works if both have DeptID

8. Three or More Tables

Add a third table (Projects):

SELECT E.EmpName, D.DeptName, P.ProjectName
FROM Employees E
JOIN Departments D ON E.DeptID = D.DeptID
JOIN Projects P ON E.EmpID = P.EmpID;

9. Non-Equi-Joins

Use operators like >, <, or BETWEEN:

-- Find employees with salaries in a specific grade range
SELECT E.EmpName, S.Grade
FROM Employees E
JOIN SalaryGrades S ON E.Salary BETWEEN S.MinSalary AND S.MaxSalary;

10. SQL Considerations

Qualified Names: Employees.DeptID avoids ambiguity.
Self-Joins: Use aliases to join a table to itself.

  SELECT A.EmpName AS Employee, B.EmpName AS Manager
  FROM Employees A
  JOIN Employees B ON A.ManagerID = B.EmpID;

Performance: Index foreign keys and avoid SELECT *.

11. Outer Joins

Left Outer Join

Returns all rows from the left table:

SELECT E.EmpName, D.DeptName
FROM Employees E
LEFT JOIN Departments D ON E.DeptID = D.DeptID;

Right Outer Join

Returns all rows from the right table.

Full Outer Join

Combines left and right joins (not supported in MySQL).

12. SQL Standard Joins

CROSS JOIN: Cartesian product.

  SELECT * FROM Employees CROSS JOIN Departments;

INNER JOIN: Standard equi-join.
OUTER JOIN: Includes unmatched rows.

13. Common Mistakes

Forgetting the join condition (creates a Cartesian product).
Using NATURAL JOIN with mismatched column names.

14. Summary

Equi-Joins use = to match columns.
Outer Joins include unmatched rows.
Self-Joins require table aliases.

Practice all examples at www.codeswithpankaj.com!

Author: Pankaj Chouhan

Website: Codes With Pankaj

100 Java interview questions and answers.

Codes With Pankaj — Wed, 24 Jul 2024 16:39:01 +0000

🚀 Preparing for your next Java interview? Check out my comprehensive guide with the top 100 Java interview questions and answers. Master your interview and ace your next opportunity! 🔥💻

👉 Explore the guide

Finding the Median of Two Sorted Arrays in Java

Codes With Pankaj — Mon, 22 Jul 2024 07:37:40 +0000

JAVA Tutorial
Java File

Introduction

The problem of finding the median of two sorted arrays is a classic coding interview question. The challenge is to find the median efficiently, with a time complexity of O(log(min(m, n))), where m and n are the sizes of the two arrays. In this article, we’ll walk through a Java solution that employs binary search to achieve this efficiency.

Problem Statement

Given two sorted arrays nums1 and nums2, find the median of the two sorted arrays. The overall runtime complexity should be O(log(min(m, n))), where m and n are the sizes of the two arrays.

Approach

To solve this problem, we use a binary search approach on the smaller of the two arrays. The goal is to partition both arrays such that the left half contains all elements less than or equal to the elements in the right half. Here’s a step-by-step explanation:

Ensure nums1 is the Smaller Array: For easier binary search, make sure nums1 is the smaller array.
Perform Binary Search: Use binary search on nums1 to find the correct partition.
Partitioning: Partition both arrays such that the left side contains lower elements, and the right side contains higher elements.
Calculate Median: Based on the partitions, calculate the median.

Solution

Here’s a detailed Java implementation of the solution:

public class MedianOfTwoSortedArrays {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        // Ensure nums1 is the smaller array
        if (nums1.length > nums2.length) {
            int[] temp = nums1;
            nums1 = nums2;
            nums2 = temp;
        }

        int x = nums1.length;
        int y = nums2.length;
        int low = 0, high = x;

        while (low <= high) {
            int partitionX = (low + high) / 2;
            int partitionY = (x + y + 1) / 2 - partitionX;

            // Edge cases
            int maxX = (partitionX == 0) ? Integer.MIN_VALUE : nums1[partitionX - 1];
            int minX = (partitionX == x) ? Integer.MAX_VALUE : nums1[partitionX];
            int maxY = (partitionY == 0) ? Integer.MIN_VALUE : nums2[partitionY - 1];
            int minY = (partitionY == y) ? Integer.MAX_VALUE : nums2[partitionY];

            if (maxX <= minY && maxY <= minX) {
                // Correct partition
                if ((x + y) % 2 == 0) {
                    return (Math.max(maxX, maxY) + Math.min(minX, minY)) / 2.0;
                } else {
                    return Math.max(maxX, maxY);
                }
            } else if (maxX > minY) {
                high = partitionX - 1;
            } else {
                low = partitionX + 1;
            }
        }

        throw new IllegalArgumentException("Input arrays are not sorted");
    }

    public static void main(String[] args) {
        MedianOfTwoSortedArrays solution = new MedianOfTwoSortedArrays();

        int[] nums1 = {1, 3};
        int[] nums2 = {2};
        System.out.println("Median: " + solution.findMedianSortedArrays(nums1, nums2)); // Output: 2.0

        int[] nums1_2 = {1, 2};
        int[] nums2_2 = {3, 4};
        System.out.println("Median: " + solution.findMedianSortedArrays(nums1_2, nums2_2)); // Output: 2.5
    }
}

Explanation

Initialization: Ensure nums1 is the smaller array.
Binary Search: Perform binary search on nums1 to find the correct partition.
Partitioning and Median Calculation: Calculate the maximum of the left elements and the minimum of the right elements to find the median.

Conclusion

This binary search approach provides an efficient solution to finding the median of two sorted arrays. By leveraging binary search on the smaller array, the solution achieves a time complexity of O(log(min(m, n))), making it suitable for large input arrays.

Largest Rectangle in Histogram

Codes With Pankaj — Mon, 22 Jul 2024 07:34:53 +0000

Problem Overview

The task is to find the largest rectangle area that can be formed in a histogram. Each bar in the histogram has a width of 1, and the height of each bar is given by an array of non-negative integers.

For example, given the heights array [2, 1, 5, 6, 2, 3], the largest rectangle area in the histogram is 10.

Solution Approach

The problem can be efficiently solved using a stack-based approach. This approach involves maintaining a stack to keep track of indices of the histogram bars, allowing us to calculate the maximum rectangle area in linear time. Here's a detailed breakdown of the algorithm:

1. Initialize Variables

len: The length of the heights array.
stack: An empty stack used to store indices of the histogram bars.
max: A variable to keep track of the maximum rectangle area found so far.
h: The height of the bar which is being popped from the stack.
w: The width of the rectangle formed with height h.

2. Iterate Through Heights Array

We iterate through the heights array from left to right and also add a final virtual bar with height 0 at the end of the array to ensure that all bars are processed.

Steps in the iteration:

Push Current Bar's Index: For each bar, push its index onto the stack. However, before doing that, we need to ensure that the current bar is taller than the bar at the index stored at the top of the stack. If it is not, we pop bars from the stack to calculate the area of rectangles that can be formed using the bar at the popped index as the smallest bar (i.e., the height of the rectangle).
Pop from Stack and Calculate Area:
- Pop the top index from the stack. This index represents the height of the smallest bar in the rectangle.
- Calculate the width of the rectangle. If the stack is empty after popping, it means that the popped bar was the smallest so far, and its width extends from the beginning of the array to the current index. Otherwise, the width is determined by the distance between the current index and the index now at the top of the stack, minus one.
- Compute the area of the rectangle using the height and width and update the max variable if this area is larger.

3. Handle Remaining Bars in the Stack

After iterating through all bars, there might still be some bars left in the stack. These bars would have heights that were not processed because there was no shorter bar to the right. We need to process these remaining bars similarly by popping them from the stack and calculating the area.

Detailed Explanation of the Code

Here's the JavaScript code with comments explaining each part:

/**
 * @param {number[]} heights
 * @return {number}
 */
var largestRectangleArea = function(heights) {
  var len = heights.length;
  var stack = [];
  var max = 0;
  var h = 0;
  var w = 0;

  // Iterate through the heights array
  for (var i = 0; i <= len; i++) {
    // Ensure the loop processes the virtual bar with height 0 at the end
    while (stack.length && (i === len || heights[i] <= heights[stack[stack.length - 1]])) {
      // Pop the top index from the stack
      h = heights[stack.pop()];
      // Calculate the width of the rectangle
      w = stack.length === 0 ? i : i - stack[stack.length - 1] - 1;
      // Update the maximum area found so far
      max = Math.max(max, h * w);
    }
    // Push the current index onto the stack
    stack.push(i);
  }

  return max;
};

Complexity Analysis

Time Complexity: O(n), where n is the number of bars in the histogram. Each bar is pushed and popped from the stack at most once.
Space Complexity: O(n) for the stack used to keep track of indices.

Creating a Product Card with Cart Items

Codes With Pankaj — Sun, 07 Jul 2024 09:52:21 +0000

Welcome to codeswithpankaj.com! In this tutorial, we will create an interactive product card with cart items using HTML and CSS. This card will have a hover effect that flips the card to reveal more details.

Step 1: HTML Structure

First, we will set up the basic HTML structure for our product card. Create an HTML file and add the following code:

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Product Card with Cart Items</title>
    <link rel="stylesheet" href="styles.css">
</head>
<body>
    <div class="card">
        <div class="card-inner">
            <div class="card-front">
                <img src="shoe.png" alt="Nike Air">
                <h3>Nike Air (Women)<br>Size 7</h3>
                <p>Price £199.99</p>
                <button>Add to basket</button>
            </div>
            <div class="card-back">
                <img src="shoe.png" alt="Nike Air">
                <h3>Details about the product</h3>
                <p>More info about Nike Air</p>
                <button>View More</button>
            </div>
        </div>
    </div>
</body>
</html>

Step 2: CSS Styling

Next, we will style our product card to add the flipping effect. Create a CSS file named styles.css and add the following code:

body {
    display: flex;
    justify-content: center;
    align-items: center;
    height: 100vh;
    background-color: #000;
    color: #fff;
    font-family: Arial, sans-serif;
}

.card {
    perspective: 1000px;
}

.card-inner {
    position: relative;
    width: 300px;
    height: 400px;
    text-align: center;
    transition: transform 0.6s;
    transform-style: preserve-3d;
}

.card:hover .card-inner {
    transform: rotateY(180deg);
}

.card-front, .card-back {
    position: absolute;
    width: 100%;
    height: 100%;
    backface-visibility: hidden;
    border-radius: 16px;
}

.card-front {
    background: linear-gradient(45deg, #00c6ff, #0072ff);
}

.card-back {
    background: linear-gradient(45deg, #ff416c, #ff4b2b);
    transform: rotateY(180deg);
}

.card img {
    width: 100px;
    margin-top: 20px;
}

h3, p {
    margin: 10px 0;
}

button {
    margin-top: 20px;
    padding: 10px 20px;
    border: none;
    border-radius: 20px;
    background: #fff;
    color: #000;
    cursor: pointer;
    transition: background 0.3s;
}

button:hover {
    background: #ddd;
}

Step 3: Adding Multiple Cards

To add multiple cards, simply duplicate the card div in the HTML file and update the details accordingly. Here's an example with three cards:

<div class="card-container">
    <div class="card">
        <div class="card-inner">
            <div class="card-front">
                <img src="shoe.png" alt="Nike Air">
                <h3>Nike Air (Women)<br>Size 7</h3>
                <p>Price £199.99</p>
                <button>Add to basket</button>
            </div>
            <div class="card-back">
                <img src="shoe.png" alt="Nike Air">
                <h3>Details about the product</h3>
                <p>More info about Nike Air</p>
                <button>View More</button>
            </div>
        </div>
    </div>
    <div class="card">
        <div class="card-inner">
            <div class="card-front">
                <img src="shoe.png" alt="Nike Air">
                <h3>Nike Air (Men)<br>Size 10</h3>
                <p>Price £99.99</p>
                <button>Add to basket</button>
            </div>
            <div class="card-back">
                <img src="shoe.png" alt="Nike Air">
                <h3>Details about the product</h3>
                <p>More info about Nike Air</p>
                <button>View More</button>
            </div>
        </div>
    </div>
    <div class="card">
        <div class="card-inner">
            <div class="card-front">
                <img src="shoe.png" alt="Nike Air">
                <h3>Nike Air (Women)<br>Size 8</h3>
                <p>Price £399.99</p>
                <button>Add to basket</button>
            </div>
            <div class="card-back">
                <img src="shoe.png" alt="Nike Air">
                <h3>Details about the product</h3>
                <p>More info about Nike Air</p>
                <button>View More</button>
            </div>
        </div>
    </div>
</div>

And update the CSS to center the cards:

.card-container {
    display: flex;
    gap: 20px;
}

Conclusion

You've now created a stylish product card with a flip effect that shows additional information on hover. This tutorial covered the basics of HTML and CSS to achieve this effect. Feel free to customize the design and functionality to fit your needs. Happy coding!

For more tutorials and coding tips, visit codeswithpankaj.com

How to Create a "Show Password" Toggle

Codes With Pankaj — Sun, 07 Jul 2024 09:38:33 +0000

Welcome to codeswithpankaj.com! In this tutorial, we will create a simple "Show Password" toggle functionality using HTML, CSS, and JavaScript. This feature allows users to toggle the visibility of their password while typing, enhancing user experience in web forms.

Step 1: Create the HTML Structure

First, create the basic HTML structure for your form. This includes an input field for the password and a checkbox to toggle the visibility.

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Show Password Toggle</title>
</head>
<body>
    <form>
        <label for="password">Password:</label>
        <input type="password" id="password" name="password">
        <label for="togglePassword">Show Password</label>
        <input type="checkbox" id="togglePassword">
    </form>

    <script src="script.js"></script>
</body>
</html>

Step 2: Add the JavaScript

Next, add the JavaScript code to handle the toggle functionality. This script listens for changes to the checkbox and toggles the type of the password input field accordingly.

document.getElementById("togglePassword").addEventListener("change", function() {
    var passwordInput = document.getElementById("password");
    if (this.checked) {
        passwordInput.type = "text";
    } else {
        passwordInput.type = "password";
    }
});

Save this JavaScript code in a file named script.js.

Step 3: Style the Form (Optional)

You can add some basic CSS to style the form and make it look better. This step is optional but recommended for a better user experience.

<style>
    form {
        max-width: 300px;
        margin: 0 auto;
        padding: 20px;
        border: 1px solid #ccc;
        border-radius: 5px;
    }

    label {
        display: block;
        margin-bottom: 10px;
    }

    input[type="password"], input[type="text"] {
        width: 100%;
        padding: 8px;
        margin-bottom: 10px;
        border: 1px solid #ccc;
        border-radius: 5px;
    }
</style>

Final Code

Combine the HTML and CSS into a single file for simplicity, and include the JavaScript as an external file.

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Show Password Toggle</title>
    <style>
        form {
            max-width: 300px;
            margin: 0 auto;
            padding: 20px;
            border: 1px solid #ccc;
            border-radius: 5px;
        }

        label {
            display: block;
            margin-bottom: 10px;
        }

        input[type="password"], input[type="text"] {
            width: 100%;
            padding: 8px;
            margin-bottom: 10px;
            border: 1px solid #ccc;
            border-radius: 5px;
        }
    </style>
</head>
<body>
    <form>
        <label for="password">Password:</label>
        <input type="password" id="password" name="password">
        <label for="togglePassword">Show Password</label>
        <input type="checkbox" id="togglePassword">
    </form>

    <script src="script.js"></script>
</body>
</html>

Save this file as index.html and the JavaScript code as script.js. Open index.html in your web browser to see the "Show Password" toggle in action.

For more tutorials, visit codeswithpankaj.com

Python game: Rock, Paper, Scissors

Codes With Pankaj — Wed, 21 Feb 2024 17:39:09 +0000

We're going to dive headfirst into creating your very first Python game: Rock, Paper, Scissors.

Let's Get Started:

Open your Python IDLE and create a new file named rps.py. Now, let's start coding:

from random import randint

# Create a list of play options
t = ["Rock", "Paper", "Scissors"]

# Assign a random play to the computer
computer = t[randint(0,2)]

# Set player to False
player = False

# Game Loop
while player == False:
    # Set player to True
    player = input("Rock, Paper, Scissors?")

    # Check for a tie
    if player == computer:
        print("It's a tie!")

    # Check for player winning scenarios
    elif player == "Rock":
        if computer == "Paper":
            print("You lose!", computer, "covers", player)
        else:
            print("You win!", player, "smashes", computer)

    elif player == "Paper":
        if computer == "Scissors":
            print("You lose!", computer, "cut", player)
        else:
            print("You win!", player, "covers", computer)

    elif player == "Scissors":
        if computer == "Rock":
            print("You lose...", computer, "smashes", player)
        else:
            print("You win!", player, "cut", computer)

    # Handle invalid inputs
    else:
        print("That's not a valid play. Check your spelling!")

    # Reset player status to continue the loop
    player = False
    computer = t[randint(0,2)]

Understanding the Code:

Let's dissect what's happening in our code:

We import randint from the random module to generate random integers, which we'll use to determine the computer's play.
We create a list, t, containing the play options: "Rock", "Paper", and "Scissors".
The computer's play is randomly selected from the list.
We set the initial state of the player to False to indicate that they haven't made a play yet.
The game loop (while loop) runs until the player makes a valid play.
Inside the loop, we prompt the player for their choice using the input() function.
Based on the player's input, we compare it with the computer's play to determine the outcome of the game.
We handle different scenarios such as a tie, player wins, or invalid inputs.
Finally, we reset the player status to False to continue the loop and generate a new play for the computer.

Python code to create a butterfly pattern using asterisks

Codes With Pankaj — Sat, 10 Feb 2024 05:15:00 +0000

# Butterfly Pattern in Python
# Website: @codeswithpankaj

def butterfly_pattern(n):
    for i in range(n):
        for j in range(i + 1):
            print("*", end=" ")
        spaces = 2 * (n - i - 1)
        for j in range(spaces):
            print(" ", end=" ")
        for j in range(i + 1):
            print("*", end=" ")
        print()
    for i in range(n - 1, 0, -1):
        for j in range(i):
            print("*", end=" ")
        spaces = 2 * (n - i)
        for j in range(spaces):
            print(" ", end=" ")
        for j in range(i):
            print("*", end=" ")
        print()
# Example usage with n=5
butterfly_pattern(5)
Output
* * * * *         * * * * *
* * * *             * * * *
* * *                 * * *
* *                     * *
*                         *
*                         *
* *                     * *
* * *                 * * *
* * * *             * * * *
* * * * *         * * * * *

Question: Implement a Binary Search Algorithm

Codes With Pankaj — Sat, 27 Jan 2024 03:16:11 +0000

Question: Implement a Binary Search Algorithm

Problem Description:
Write a Java function to perform a binary search on a sorted array and return the index of a given target element. If the target is not present, return -1.

Solution:

public class BinarySearch {
    // Function to perform binary search on a sorted array
    static int binarySearch(int[] arr, int target) {
        int left = 0;
        int right = arr.length - 1;

        while (left <= right) {
            int mid = left + (right - left) / 2;

            if (arr[mid] == target) {
                return mid; // Target found, return the index
            } else if (arr[mid] < target) {
                left = mid + 1; // Target is in the right half
            } else {
                right = mid - 1; // Target is in the left half
            }
        }

        return -1; // Target not found
    }

    public static void main(String[] args) {
        int[] sortedArray = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
        int target1 = 5;
        int target2 = 11;

        System.out.println("Sorted Array: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]");
        System.out.println("Searching for target " + target1 + ": Index " + binarySearch(sortedArray, target1));
        System.out.println("Searching for target " + target2 + ": Index " + binarySearch(sortedArray, target2));
    }
}

Explanation:
The binarySearch function performs a binary search on the sorted array. It maintains two pointers, left and right, and calculates the middle index (mid). It compares the element at the middle index with the target and narrows down the search space accordingly. This process continues until the target is found or the search space is empty.

This question assesses the candidate's understanding of binary search, a fundamental algorithm used for efficiently searching sorted data sets.

Question: Validate Parentheses in a String

Codes With Pankaj — Sat, 27 Jan 2024 03:14:32 +0000

Question: Validate Parentheses in a String

Problem Description:
Write a Java function to determine whether the parentheses in a given string are balanced. The string can contain parentheses ('(', ')'), curly braces ('{', '}'), and square brackets ('[', ']').

Solution:

import java.util.Stack;

public class BalancedParentheses {
    // Function to check if parentheses are balanced
    static boolean areParenthesesBalanced(String expression) {
        Stack<Character> stack = new Stack<>();

        for (char ch : expression.toCharArray()) {
            if (ch == '(' || ch == '{' || ch == '[') {
                stack.push(ch);
            } else if (ch == ')' || ch == '}' || ch == ']') {
                if (stack.isEmpty() || !isMatchingPair(stack.pop(), ch)) {
                    return false;
                }
            }
        }

        // Stack should be empty if parentheses are balanced
        return stack.isEmpty();
    }

    // Helper function to check if two parentheses form a matching pair
    static boolean isMatchingPair(char opening, char closing) {
        return (opening == '(' && closing == ')') ||
               (opening == '{' && closing == '}') ||
               (opening == '[' && closing == ']');
    }

    public static void main(String[] args) {
        String expression1 = "{[()]}";
        String expression2 = "([)]";

        System.out.println("Expression 1: " + expression1);
        System.out.println("Are parentheses balanced? " + areParenthesesBalanced(expression1));

        System.out.println("\nExpression 2: " + expression2);
        System.out.println("Are parentheses balanced? " + areParenthesesBalanced(expression2));
    }
}

Explanation:
The areParenthesesBalanced function uses a stack to keep track of opening parentheses, curly braces, and square brackets encountered in the string. When a closing parenthesis is encountered, it checks if it matches the last opening parenthesis on the stack using the isMatchingPair function. If there is a mismatch or the stack is not empty after processing the entire string, the parentheses are not balanced.

This question assesses the candidate's understanding of stacks and their ability to use them to solve real-world problems, such as validating expressions.

Question: Find the Common Elements in Two Arrays

Codes With Pankaj — Sat, 27 Jan 2024 03:08:14 +0000

Question: Find the Common Elements in Two Arrays

Problem Description:
Given two arrays of integers, write a Java function to find and print the common elements present in both arrays.

Solution:

import java.util.HashSet;

public class CommonElementsInArrays {
    // Function to find common elements in two arrays
    static void findCommonElements(int[] arr1, int[] arr2) {
        HashSet<Integer> set = new HashSet<>();
        for (int num : arr1) {
            set.add(num);
        }

        System.out.print("Common elements: ");
        for (int num : arr2) {
            if (set.contains(num)) {
                System.out.print(num + " ");
            }
        }
    }

    public static void main(String[] args) {
        int[] arr1 = {1, 2, 4, 5, 6};
        int[] arr2 = {2, 3, 5, 7};

        System.out.println("Array 1: [1, 2, 4, 5, 6]");
        System.out.println("Array 2: [2, 3, 5, 7]");

        findCommonElements(arr1, arr2);
    }
}

Explanation:
This solution uses a HashSet to store unique elements from the first array (arr1). Then, it iterates through the second array (arr2) and checks if each element is present in the HashSet. If it is, the element is a common element, and it is printed.

This question assesses the candidate's knowledge of data structures (HashSet in this case) and their ability to efficiently solve problems involving arrays and sets.

Question: Implement a Stack using Linked List

Codes With Pankaj — Sat, 27 Jan 2024 03:05:04 +0000

Problem Description:
Implement a stack data structure using a linked list. The stack should support the standard stack operations: push, pop, and isEmpty.

Solution:

class Node {
    int data;
    Node next;

    Node(int data) {
        this.data = data;
        this.next = null;
    }
}

public class StackUsingLinkedList {
    private Node top; // top of the stack

    // Constructor to initialize an empty stack
    public StackUsingLinkedList() {
        this.top = null;
    }

    // Function to check if the stack is empty
    public boolean isEmpty() {
        return top == null;
    }

    // Function to push an element onto the stack
    public void push(int data) {
        Node newNode = new Node(data);
        newNode.next = top;
        top = newNode;
        System.out.println(data + " pushed to the stack");
    }

    // Function to pop an element from the stack
    public int pop() {
        if (isEmpty()) {
            System.out.println("Stack is empty");
            return -1;
        }
        int popped = top.data;
        top = top.next;
        return popped;
    }

    // Function to peek at the top element of the stack
    public int peek() {
        if (isEmpty()) {
            System.out.println("Stack is empty");
            return -1;
        }
        return top.data;
    }

    public static void main(String[] args) {
        StackUsingLinkedList stack = new StackUsingLinkedList();

        System.out.println("Is the stack empty? " + stack.isEmpty());

        stack.push(10);
        stack.push(20);
        stack.push(30);

        System.out.println("Top element is " + stack.peek());

        System.out.println(stack.pop() + " popped from the stack");

        System.out.println("Is the stack empty? " + stack.isEmpty());
    }
}

Explanation:
This code demonstrates the implementation of a stack using a linked list. The Node class is used to represent each element in the stack, and the StackUsingLinkedList class contains methods for push, pop, isEmpty, and peek operations. The main method demonstrates the usage of the stack.

This question assesses the candidate's understanding of data structures, particularly linked lists and how they can be used to implement common operations like stack operations.

DEV Community: Codes With Pankaj

In-Depth Tutorial: Multitable Queries (Joins) with Codes With Pankaj

1. Introduction to Joins

2. Two-Table Query Example (Equi-Join)

Step 1: Use WHERE Clause (Old Syntax)

Step 2: Use INNER JOIN (ANSI SQL)

3. Parent/Child Queries

4. Alternative Join Syntax

5. Joins with Row Selection

6. Multiple Matching Columns

7. Natural Joins

8. Three or More Tables

9. Non-Equi-Joins

10. SQL Considerations

11. Outer Joins

Left Outer Join

Right Outer Join

Full Outer Join

12. SQL Standard Joins

13. Common Mistakes

14. Summary

100 Java interview questions and answers.

Finding the Median of Two Sorted Arrays in Java

Introduction

Problem Statement

Approach

Solution

Explanation

Conclusion

Largest Rectangle in Histogram

Problem Overview

Solution Approach

1. Initialize Variables

2. Iterate Through Heights Array

3. Handle Remaining Bars in the Stack

Detailed Explanation of the Code

Complexity Analysis

Creating a Product Card with Cart Items

Step 1: HTML Structure

Step 2: CSS Styling

Step 3: Adding Multiple Cards

Conclusion

How to Create a "Show Password" Toggle

Step 1: Create the HTML Structure

Step 2: Add the JavaScript

Step 3: Style the Form (Optional)

Final Code

Python game: Rock, Paper, Scissors

We're going to dive headfirst into creating your very first Python game: Rock, Paper, Scissors.

Let's Get Started:

Understanding the Code:

Python code to create a butterfly pattern using asterisks

Question: Implement a Binary Search Algorithm

Question: Implement a Binary Search Algorithm

Question: Validate Parentheses in a String

Question: Validate Parentheses in a String

Question: Find the Common Elements in Two Arrays

Question: Implement a Stack using Linked List

Step 1: Use `WHERE` Clause (Old Syntax)

Step 2: Use `INNER JOIN` (ANSI SQL)