Skip to content

Tag Archives: 24*7 Innovation Labs

Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. The order of… Read More
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. The order of… Read More
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. The order of… Read More
Round 1:(Hackerrank Test) Q1: Binary tree mirror image check ( https://www.geeksforgeeks.org/check-if-two-trees-are-mirror/ ) Q2: Stack reversal in place // just the function ( https://www.geeksforgeeks.org/reverse-a-stack-using-recursion/) Q3: Kendanes… Read More
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elements… Read More
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elements… Read More
Round 1(Telephonic) Explained about company JD Snake and Ladder game (matrix, array, linked list) Find the row with maximum 1s where every row of sorted… Read More
Round 1 : (Duration:1 hr) Written test consisting of MCQs in aptitude, data structures and analytical thinking. 3 coding questions were also asked of us,… Read More
Telephonic Discussion: 1) Basic Java Questions about Strings. 2) Sorting linked list of 0 and 1 and make separate linked list for both (further modified… Read More
I had an interview with 24*7 innovation labs. Their process is telephonic followed by 3 f2f interviews. Round-1 Telephonic 1) Stack reversal in place 2)… Read More

Start Your Coding Journey Now!