Question d’entretien chez TechnoNext
Problem solving: Subarray Sum Equals K, Graph diameter, Linked list reverse, Kadane's Algorithm. => I was required to articulate my problem-solving logic before implementing the solution on paper.
Problem solving: Subarray Sum Equals K, Graph diameter, Linked list reverse, Kadane's Algorithm. => I was required to articulate my problem-solving logic before implementing the solution on paper.