ProjectWithSourceCodes

🚀 Advanced Coding Interview Questions with Answers (Part 4)
1️⃣6️⃣ Find the Shortest Path Using Dijkstra's Algorithm
👉 Dijkstra's Algorithm finds the shortest path from a source node to other nodes in a graph with non-negative edge weights.

import heapq

def dijkstra(graph, start):
    distances = {node: float("inf") for node in graph}
    distances[start] = 0

    heap = [(0, start)]

    while heap:
        distance, node = heapq.heappop(heap)

        if distance > distances[node]:
            continue

        for neighbor, weight in graph[node]:
            new_distance = distance + weight

            if new_distance < distances[neighbor]:
                distances[neighbor] = new_distance
                heapq.heappush(heap, (new_distance, neighbor))

    return distances

⏱️ Time Complexity: O((V + E) log V)
1️⃣7️⃣ Implement a Trie
👉 A Trie is a tree-based data structure commonly used for prefix searching and autocomplete.

class TrieNode:
    def __init__(self):
        self.children = {}
        self.is_end = False


class Trie:
    def __init__(self):
        self.root = TrieNode()

    def insert(self, word):
        node = self.root

        for char in word:
            if char not in node.children:
                node.children[char] = TrieNode()

            node = node.children[char]

        node.is_end = True

    def search(self, word):
        node = self.root

        for char in word:
            if char not in node.children:
                return False
            node = node.children[char]

        return node.is_end

⏱️ Time Complexity: O(L) per operation
L = length of the word
1️⃣8️⃣ Find Connected Components Using Union-Find
👉 Union-Find, also called Disjoint Set Union (DSU), efficiently manages groups of connected elements.

class DSU:
    def __init__(self, n):
        self.parent = list(range(n))

    def find(self, x):
        if self.parent[x] != x:
            self.parent[x] = self.find(self.parent[x])
        return self.parent[x]

    def union(self, a, b):
        root_a = self.find(a)
        root_b = self.find(b)

        if root_a != root_b:
            self.parent[root_b] = root_a

💡 It is commonly used in graph connectivity and Kruskal's algorithm.
⏱️ Amortized Time: Nearly O(1) per operation with path compression and union by rank/size.
1️⃣9️⃣ Rotate a Matrix 90 Degrees Clockwise
👉 Rotate an n × n matrix 90 degrees clockwise in place.

def rotate(matrix):
    n = len(matrix)

    for i in range(n):
        for j in range(i + 1, n):
            matrix[i][j], matrix[j][i] = (
                matrix[j][i],
                matrix[i][j]
            )

    for row in matrix:
        row.reverse()

    return matrix

matrix = [
    [1, 2, 3],
    [4, 5, 6],
    [7, 8, 9]
]

print(rotate(matrix))

📌 Output:

[[7, 4, 1],
 [8, 5, 2],
 [9, 6, 3]]

⏱️ Time Complexity: O(n²)
💾 Space Complexity: O(1)
2️⃣0️⃣ Solve the 0/1 Knapsack Problem
👉 Given items with weights and values, find the maximum value that can be placed in a bag with limited capacity.

def knapsack(weights, values, capacity):
    dp = [0] * (capacity + 1)

    for i in range(len(weights)):
        for w in range(capacity, weights[i] - 1, -1):
            dp[w] = max(
                dp[w],
                dp[w - weights[i]] + values[i]
            )

    return dp[capacity]

print(knapsack([1, 3, 4], [15, 50, 60], 4))

📌 Output:

⏱️ Time Complexity: O(n × capacity)
💾 Space Complexity: O(capacity)
💬 Save this for your advanced coding interview preparation!
🔥 Next: Generative AI – Part 9
#Coding #DSA #Python #AdvancedCoding #Algorithms #DynamicProgramming #Graphs #InterviewQuestions

22 views04:36

ProjectWithSourceCodes

🚀 Generative AI Interview Questions with Answers (Part 9)
4️⃣1️⃣ What are Query, Key, and Value (Q, K, V) in Attention?
👉 In the attention mechanism, each token is transformed into three vectors:
🔹 Query (Q) → What information am I looking for?
🔹 Key (K) → What information do I contain?
🔹 Value (V) → What information should I provide?
A simplified attention calculation is:

Attention(Q, K, V)
= softmax(QKᵀ / √dₖ)V

💡 Q, K, and V help the model determine which tokens should receive more attention.
4️⃣2️⃣ What are Logits in an LLM?
👉 Logits are the raw numerical scores produced by a model before they are converted into probabilities.
📌 Simplified flow:

Input
 ↓
LLM
 ↓
Logits
 ↓
Softmax
 ↓
Probabilities
 ↓
Next Token

💡 Higher relative logits generally correspond to higher probabilities after softmax.
4️⃣3️⃣ What is Softmax in AI?
👉 Softmax converts a set of numerical scores into a probability distribution.
For example:

Logits
 ↓
Softmax
 ↓
Token A → 0.70
Token B → 0.20
Token C → 0.10

📌 The probabilities sum to approximately 1.
💡 Softmax is commonly used for converting model scores into probabilities over possible classes or tokens.
4️⃣4️⃣ What is Greedy Decoding?
👉 Greedy decoding selects the highest-probability token at each generation step.
Example:

Token probabilities

A → 0.70
B → 0.20
C → 0.10

Selected → A

📌 It is simple and deterministic for a fixed model/input, but it may not always produce the most desirable overall sequence.
4️⃣5️⃣ What is Sampling in Generative AI?
👉 Sampling selects the next token probabilistically from a distribution rather than always choosing the highest-probability token.
Common decoding controls include:
🔹 Temperature
🔹 Top-P
🔹 Top-K
📌 Sampling can produce more varied outputs than greedy decoding.
💡 The exact behavior depends on the model and decoding settings.
💬 Save this for your Generative AI interview preparation!
🔥 Next: Java Interview Questions – Part 3
#GenerativeAI #GenAI #LLM #Transformer #Attention #Softmax #AIInterview #InterviewQuestions #MachineLearning

26 views04:36

ProjectWithSourceCodes

☕️ Java Interview Questions with Answers (Part 3)
1️⃣1️⃣ What is Method Overloading in Java?
👉 Method Overloading means having multiple methods with the same name but different parameter lists in the same class.

class Calculator {
    int add(int a, int b) {
        return a + b;
    }

    double add(double a, double b) {
        return a + b;
    }
}

💡 Overloading is resolved at compile time.
1️⃣2️⃣ What is Method Overriding in Java?
👉 Method Overriding occurs when a subclass provides its own implementation of an inherited method.

class Animal {
    void sound() {
        System.out.println("Animal sound");
    }
}

class Dog extends Animal {
    @Override
    void sound() {
        System.out.println("Bark");
    }
}

💡 Overriding is associated with runtime polymorphism.
1️⃣3️⃣ What is the this Keyword in Java?
👉 this refers to the current object.
It is commonly used to:
🔹 Access current object's fields
🔹 Call current class methods
🔹 Invoke another constructor
Example:

class Student {
    String name;

    Student(String name) {
        this.name = name;
    }
}

1️⃣4️⃣ What is the super Keyword in Java?
👉 super refers to the immediate parent class.
It can be used to:
🔹 Access parent fields
🔹 Call parent methods
🔹 Call the parent constructor
Example:

class Animal {
    String name = "Animal";
}

class Dog extends Animal {
    String name = "Dog";

    void display() {
        System.out.println(super.name);
    }
}

📌 Output:

Animal

1️⃣5️⃣ What is the static Keyword in Java?
👉 static indicates that a member belongs to the class rather than a particular object.
Example:

class Counter {
    static int count = 0;

    Counter() {
        count++;
    }
}

public class Main {
    public static void main(String[] args) {
        new Counter();
        new Counter();

        System.out.println(Counter.count);
    }
}

📌 Output:

💡 A static field is shared among instances of the class.
💬 Save this for your Java interview preparation!
🔥 Next: Python Interview Questions – Part 2
#Java #JavaInterview #JavaProgramming #OOP #CodingInterview #Programming #InterviewQuestions #Developer #SoftwareEngineer

35 views04:37

ProjectWithSourceCodes