Skip to content

Tag Archives: Accolite

 Round 1 (Coding round): I don’t exactly remember the question but it was the intermediate-level question (P. S:  Lookout for their coding environment it’s hard… Read More
Round 1 (Coding round): Graph DFS based question to find out a beautiful path in the graph where the beautiful path is a path having… Read More
Accolite Digital came to our college to hire 6 months intern+FTE on 1 September 2021 There were 5 rounds in total and it was a… Read More
Round 1-Coding Round: This round had one coding question that is expected to be solved in an hour. It was conducted on Accolite’s own coding… Read More
Round 1(Coding Round): This round had one coding question that is expected to be solved in an hour. It was conducted on Accolite’s own coding… Read More
Efficient approach: If we are allowed to buy and sell only once, then we can use following algorithm. Maximum difference between two elements. Here we… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Examples: Input: 1->2->3->4->5->6->7->8->NULL and k =… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Examples: Input: 1->2->3->4->5->6->7->8->NULL and k =… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Examples: Input: 1->2->3->4->5->6->7->8->NULL and k =… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Examples: Input: 1->2->3->4->5->6->7->8->NULL and k =… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More

Start Your Coding Journey Now!