SDE - 1

Step 1: I first understood that the Fibonacci sequence starts with 0 and 1, and each subsequent number is the sum of the previous two.

Step 2: I initialized the first two variables: a = 0 and b = 1, and printed them as the starting values.

Step 3: Using a loop from index 2 to N, I calculated each next term as c = a + b, printed it, and then updated a = b and b = c for the next iteration.

Step 4: I tested the code with multiple inputs like N = 6 and N = 10 to ensure correctness and efficiency.

Step 5: The code worked correctly with O(N) time complexity, and the interviewer was satisfied with the iterative approach.

I began by quickly organizing my thoughts during the preparation time and noted a few key points about electric vehicles, including their environmental benefits, infrastructure challenges, and government initiatives. I initiated the discussion with a brief overview and actively listened to others. I added relevant points, supported them with real-world examples, and ensured that I didn’t interrupt anyone. My focus was on being clear, respectful, and collaborative throughout the discussion.

Step 1: I started by defining a Node class with data and next pointers to represent the linked list nodes.
Step 2: I then wrote a function to convert the array into a singly linked list by creating nodes one by one and linking them in order.
Step 3: After successfully building the list, I wrote a separate function to reverse the linked list using three pointers: prev, curr, and next.
Step 4: I explained the reversing logic clearly — for each node, I changed the next pointer to point to the previous node and moved the pointers forward.
Step 5: Once reversed, I walked through the list from the new head and printed each node’s data to show the final output.
Step 6: The interviewer was satisfied with the clarity of my explanation and how I handled edge cases like an empty list.

Tip 1: Understand and remember the ACID properties (Atomicity, Consistency, Isolation, Durability) — they form the core of transaction concepts.
Tip 2: Practice real-world examples, such as bank transactions or order processing, to better relate to the concepts.
Tip 3: Revise from standard DBMS textbooks like Korth or Navathe to strengthen your theoretical understanding.

Tip 1: Understand the concept of each join using Venn diagrams — they help visualize how data is selected.
Tip 2: Practice writing SQL join queries on dummy data to gain hands-on experience.
Tip 3: Focus on real-world use cases, such as employee–department or student–course relationships, to remember join types more easily.

Tip 1: Understand the role of the JVM in the Java architecture — how it fits between source code and hardware.
Tip 2: Remember the key responsibilities of the JVM, such as memory management, bytecode execution, and garbage collection.
Tip 3: Relate the JVM to operating system concepts like process scheduling and stack memory to provide deeper insights if probed.

Tip 1: Think logically and creatively — puzzles often test presence of mind, not formulas.
Tip 2: Use indirect clues (such as heat or timing) to solve puzzles with limited actions.
Tip 3: Stay calm and break the problem down step by step to avoid overthinking.