-
geeksforgeeks.org › sql › sql-quiz
SQL Quiz : Practice SQL Questions Online - GeeksforGeeks
Your All-in-One Learning Portal: GeeksforGeeks is a comprehensive educational platform that empowers learners across domains-spanning computer science and programming, school education, upskilling, commerce, software tools, competitive exams, and more.
-
geeksforgeeks.org › aptitude › aptitude-test
Online Aptitude Test: For Jobs, Placements, and More - GeeksforGeeks
Your All-in-One Learning Portal: GeeksforGeeks is a comprehensive educational platform that empowers learners across domains-spanning computer science and programming, school education, upskilling, commerce, software tools, competitive exams, and more.
-
geeksforgeeks.org › javascript › javascript-tutorial
JavaScript Tutorial - GeeksforGeeks
Your All-in-One Learning Portal: GeeksforGeeks is a comprehensive educational platform that empowers learners across domains-spanning computer science and programming, school education, upskilling, commerce, software tools, competitive exams, and more.
-
geeksforgeeks.org › terms-of-service
GeeksforGeeks | Terms Of Services
Platform to practice programming problems. Solve company interview questions and improve your coding intellect
-
geeksforgeeks.org › events
Practice | GeeksforGeeks | A computer science portal for geeks
Platform to practice programming problems. Solve company interview questions and improve your coding intellect
-
geeksforgeeks.org › problem-of-the-day
Problem of the Day | GeeksforGeeks | A computer science portal for geeks
Solve one problem based on Data Structures and Algorithms every day and win exciting prizes.
-
geeksforgeeks.org › problems › key-pair5616 › 1
Two Sum - Pair with Given Sum | Practice | GeeksforGeeks
Given an array arr[] of integers and another integer target. Determine if there exist two distinct indices such that the sum of their elements is equal to the target. Examples: Input: arr[] = [0, -1, 2, -3, 1], target = -2 Output: true Explanation: a
-
geeksforgeeks.org › problems › merge-sort › 1
Merge Sort | Practice | GeeksforGeeks
Given an array arr[], its starting position l and its ending position r. Sort the array using the merge sort algorithm. Examples: Input: arr[] = [4, 1, 3, 9, 7] Output: [1, 3, 4, 7, 9]Explanation: We get the sorted array after using merge sort Input
-
geeksforgeeks.org › problems › c-template › 1
C++ Template | Practice | GeeksforGeeks
Template in C++ is a feature. We write code once and use it for any data type including user defined data types. Given three cases :1st case when two strings are given , print the smallest of the two strings.2nd case when two integers are
-
geeksforgeeks.org › explore
Practice | GeeksforGeeks | A computer science portal for geeks
Platform to practice programming problems. Solve company interview questions and improve your coding intellect