SDE - 1

Tip 1: Make your base strong.

Tip 2: Practice SQL.

Tip 1: Explore new trends and technology 

This problem was fairly very simple 

1. Define a function second_largest that takes a list of integers nums as input.
2. Initialize two variables, max_num and second_max, to store the maximum and second-maximum integers in the list, respectively. Set max_num to negative infinity and second_max to None initially.
3. Iterate through each element num in the list nums.
4. For each num, compare it with max_num:
If num is greater than max_num, update both max_num and second_max. Set second_max to the current value of max_num, and update max_num to num.
If num is less than max_num but greater than second_max, update only second_max.
5. After iterating through all elements in the list, return second_max.
6. If second_max is still None after the loop, it means there is no second-largest integer in the list, so return None.

This problem was of medium difficulty 

1. Define a function max_profit that takes a list of integers nums representing the stock prices as input.
2. Initialize two variables, min_price and max_profit, to keep track of the minimum stock price seen so far and the maximum profit that can be achieved, respectively. Set min_price to the first element of the list and max_profit to 0 initially.
3. Iterate through each element price in the list starting from the second element:
Update min_price to be the minimum of the current price and min_price.
Update max_profit to be the maximum of the difference between the current price and min_price and the current max_profit.
4. After iterating through all elements in the list, return max_profit.

1. Initialize a dictionary dist to keep track of the longest distance from the source vertex to each vertex in the graph. Set the distance of the source vertex to 0 and all other vertices to negative infinity initially.
2. Implement a topological sorting algorithm to sort the vertices of the graph in topological order. This ensures that we process vertices in the correct order to compute their longest distances.
3. Iterate through the vertices in topological order:
a. For each vertex u, iterate through its outgoing edges (u, v) and update the distance of vertex v if the distance of u plus the weight of the edge (u, v) is greater than the current distance of v.
4. After processing all vertices, the longest distance from the source vertex to the target vertex is stored in dist[target]. Return this value.

Tip 1: Study your projects well.

Tip 1: Stay positive and read such answers before hand.