|All-time Popular Problems|
|Check if subtree|
|Delete Middle of Linked List|
|Given a linked list of 0s, 1s and 2s, sort it.|
|Count nodes of linked list|
|Delete N nodes after M nodes of a linked list|
|Check for Balanced Tree|
|Remove every k'th node|
|k largest elements|
|0 - 1 Knapsack Problem|
|Subarray with given sum|
Given an integer N. The task is to print "GeeksforGeeks" N times (without quotes). Every time "GeeksforGeeks" will be printed on a new line.
The first line contains a single integer T i.e. the number of test cases. Each test case contains a single integer N representing number of times the string "GeeksforGeeks" will be printed.
Corresponding to each test case, print "GeeksforGeeks" N times (without quotes), every time on a new line.