Tip 1 : Be consistent in your preparation. Daily practice at least 2-3 Data structures and algorithms questions.
Tip 2 : Have patience.
Tip 3 : Stay motivated.
Tip 1 : Properly display skills set and project.
Tip 2 : Be honest with skills mentioned on resume.
Technical round with focussed on DSA.



We cannot use the element at a given index twice.
Try to do this problem in O(N) time complexity.



The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Can you solve this problem in O(N) time and O(1) space complexity?
public ListNode reverseList(ListNode head) {
/* iterative solution */
ListNode newHead = null;
while (head != null) {
ListNode next = head.next;
head.next = newHead;
newHead = head;
head = next;
}
return newHead;
}
public ListNode reverseList(ListNode head) {
/* recursive solution */
return reverseListInt(head, null);
}
private ListNode reverseListInt(ListNode head, ListNode newHead) {
if (head == null)
return newHead;
ListNode next = head.next;
head.next = newHead;
return reverseListInt(next, head);
}
Technical round with focussed on DSA and Java.


N = 4
A = [ 1, 4, 3, 2 ]
Explanation :
The even numbers are : 4, 2.
The odd numbers are : 1, 3.
The final array ‘A’ is : [ 4, 2, 1, 3 ].
System Design
Given a system design question for booking a movie ticket more like bookmyshow.
What should be the architecture, how to handle concurrency.
What DB should be used.
Tip 1 : Understand questions and scenarios.
Tip 2 : Have proper communication with interviewer.
Tip 3 : Draw diagrams and discuss with interviewer.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?