Tip 1: Focus on building strong fundamentals in Data Structures and Algorithms before moving on to advanced topics.
Tip 2: Practice coding regularly on platforms to improve problem-solving speed and accuracy under time constraints.
Tip 1: Tailor your resume to highlight relevant technical skills, projects, and coursework that align with the role you’re applying for.
Tip 2: Keep the format clean and concise, and quantify achievements wherever possible (e.g., “Improved algorithm efficiency by 40%”).
Ten individuals, A to J, booked train tickets for their journey from Chennai to Mumbai on either March 4, March 14, or March 21. They booked the train tickets from Chennai at different times: 4 AM, 6 AM, 7 AM, 8 AM, 10 AM, 12 PM, 3 PM, 6 PM, 10 PM, and 11 PM.
Note: No two people booked the train tickets at the same time. An equal number of people booked tickets on an even-numbered date.
Question:
How many people booked the train tickets on March 21?
Options:
a) 4
b) 3
c) 6
d) 2
If RAZOR is coded as 1860 and CLEAR is coded as 336, then BECAUSE will be coded as:
a. 56
b. 254
c. 227
d. 28
In a certain code, ACT is coded as 3 and SAM is coded as 3, then BEAN will be coded as:
a. 2
b. 3
c. 5
d. 1
The following question describes the effect of various alphabets representing certain mathematical operators. Select the number that can replace the question mark (?) from the given alternatives.
Options:
a) 7
b) 10
c) 12
d) 20
Two bags, A and B, consist of black and white balls only. The probability of drawing a black ball from bag A and the probability of drawing a white ball from bag B are both 0.25.
All the balls from both bags are emptied into bag C (which was initially empty). The probability of drawing a black ball from bag C is 715\frac{7}{15}157.
Which of the following cannot be the total number of balls in bag C?
a) 120
b) 240
c) 300
d) 360
The technical coding round was scheduled for April 26, 2025, from 8:00 PM to 9:00 PM, which was a late evening slot. The environment was proctored and conducted online, requiring a stable internet connection and webcam access. The duration was 60 minutes with 14 questions:
3 Coding questions, 5 DSA mcqs, 2 OOPS mcqs, 3 Quant mcqs, 1 personal question.
Although there was no live interview during this stage, the test was strictly monitored, and time management played a critical role. The difficulty level was moderate to high, and solving problems efficiently within the given time frame was essential for clearing this round.

Step 1: Read the Input
First, take the number of transaction IDs, N.
Then, read the list of N transaction IDs as integers.
Step 2: Initialize Variables
Create a variable total_sum to store the sum of all transaction IDs.
Set a flag is_valid = True, assuming all adjacent pairs will satisfy the condition.
Step 3: Iterate Through Adjacent Pairs
Loop through the list from index 0 to N-2.
For each pair (i, i+1):
Convert both transaction IDs to sets of digits using set(str(transaction_id)).
Check if there is any intersection between the two sets.
If no common digit is found, set is_valid = False and break the loop.
Step 4: Compute the Sum
Use Python’s built-in sum() function to get the sum of all transaction IDs and store it in total_sum.
Step 5: Print the Output
If is_valid is still True, print "true", otherwise print "false".
Then, print total_sum.

Step 1: Understand the Problem
This is a graph connectivity problem where:
Nodes = Kingdoms (0 to N-1)
Edges = Roads between kingdoms
Some nodes (invaders) must be removed along with all their connections.
After removal, we must find connected components (groups) in the remaining graph.
Step 2: Read Inputs
Parse the inputs:
N: Number of kingdoms (nodes)
E: Number of roads (edges)
Next E lines: Pairs of integers representing bidirectional roads
P: Number of invaders
Last line: List of P invader kingdoms
Step 3: Build the Graph
Use an adjacency list to represent the graph.
While adding edges, skip any edge that involves an invader.
Example: If kingdom 2 is an invader, do not add any edge that includes 2.
Step 4: Perform Graph Traversal
Use DFS or BFS to find all connected components (i.e., groups of allied kingdoms).
Only start DFS from kingdoms that are not invaders and have not already been visited.
Step 5: Store and Sort Output
For each group found, sort it in ascending order.
After collecting all groups, sort the list of groups by the first element in each group.
Step 6: Print the Output
Print each group on a single line, with elements space-separated.
Do not include any extra print statements.

Step 1: Parse the Input
Read N, the number of males and females.
Read the N integers representing male penguins' preferences.
Read the N integers representing female penguins' preferences.
Step 2: Split Penguins by Preference
Split both males and females into two groups each:
Wants Taller: Positive values → wants_taller_m, wants_taller_f
Wants Shorter: Negative values → wants_shorter_m, wants_shorter_f
While storing, use absolute values, as the sign indicates only preference.
Step 3: Match Opposite Preferences
Match:
Male who wants taller (wants_taller_m) ↔ Female who wants shorter (wants_shorter_f) → female is taller than male
Male who wants shorter (wants_shorter_m) ↔ Female who wants taller (wants_taller_f) → female is shorter than male
Reason: Both sides must agree on the preference, and their heights must satisfy the mutual condition.
Step 4: Sort the Lists
Sort each group to allow efficient pairing using the two-pointer technique.
Step 5: Match Using Two Pointers
For each matching group (e.g., wants_taller_m with wants_shorter_f):
Move pointers forward only when the height condition is satisfied.
Count one match and move both pointers when a valid pair is found.
Step 6: Sum the Matches
Add matches from both pairing groups and print the total.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL clause is used to specify the conditions in a query?