Source of Preparation: GeeksForGeeks, Leetcode, HackerRank, Takeuforward youtube channel.

[BONUS]:

Swiggy Interview Rounds

Swiggy conducted its virtual hiring process for our campus during the second week of October.

There were a total of 3 rounds in the Swiggy on campus drive.

Round 1: Online Coding Test

This round was conducted on Hacker Rank. There was a SQL problem, and 3 coding problems.

Problem List:

Problem Statement 1: Find out the city names and country names for which the number of customers is greater than the average customer per city.

The given tables were: Country, City, Customer

Problem Statement 2: Given a string s, a substring is defined as a non-empty string that can be obtained by the following means:

Remove 0 or more characters from the left side of s.
Remove 0 or more characters from the right side of s.
Remove 0 or more characters from the left side of s and Remove 0 or more characters from the right side of s.

We need to find the number of distinct substrings.

Examples:

Input Format: str = “ababa”

Result: 9

Explanation: Total number of distinct substring are 9, which are,
"a", "b", "ab", "ba", "aba", "bab", "abab", "baba" and "ababa"

Input Format: str = “abcde”

Result: 15

Explanation: Total number of distinct substring are 15, which are,
"a", "b", "c", "d", "e", "ab", "bc", "cd", "de", "abc", "bcd", 
"cde", "abcd", "bcde", and "abcde"

Problem Statement 3: Given a weighted undirected graph with N nodes and M edges. The stress level of a path between two nodes is defined as the weight of the edge with the maximum value present in the path. Given a source node “source” and destination node “destination”. Find the path with minimum stress level. If no such path exists, return -1.

Examples:

Input Format: N = 5, M = 6, 
graph_from = {1, 1, 1, 2, 4, 5}, 
graph_to = {2, 4, 5, 3, 3, 3}, 
graph_weight = {10, 3, 4, 5, 2, 6}, 
source = 1, destination = 3

Where graph_from, graph_to, graph_weight represents the description of a