This series aims to take your programming to the next level. The series focuses on aspiring programmers who aim to be better at coding.

Hackerearth Inc.

This collection begins with the explanation of Euclid's Algorithm. Thereby the next lesson talks about Number Theory and discusses prime numbers. Also the need and implementation of a powerful algorithm, the Modular Exponentiation are also being discussed. In the next lesson, problems are discussed that requires one to compute a huge value. For reference please follow this link:  https://www.hackerearth.com/notes/number-theory-1 

Programming

English

Diving Into Number Theory

Number Theory

Competitive Programming

Basics

Personal and Skill Development

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

In this video, we learn about the Euclid's Algorithm. For a formal proof of the idea, visit https://www.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm
Link for reference: https://www.hackerearth.com/notes/number-theory-1/"

Number Theory (I) : Euclid's Algorithm

We continue with Number Theory and discuss prime numbers. We also discuss the need and implementation of a powerful algorithm, the Modular Exponentiation. 
Link for reference: https://www.hackerearth.com/notes/number-theory-1/"

Number Theory (I) : Primes And Exponentiation

In this video, we solve a problem that requires us to compute a huge value, but we have our modulo operator to the rescue!
Link for reference: https://www.hackerearth.com/notes/number-theory-1

Problem 08: Computing Huge Values

hlo guys!! myself arpitakaushal I live in ayoudhya .

Arpita Kaushal

In this course, the educator is discussing array in c programming for Programming aspirants

(Hindi) Array in C Programming Language

The collection provides a basic introduction to Stacks and Queues. The first lesson talks about the Stack data structure and why and how it is used. Thereby Queue data structure and its domain of application are discussed. The last two lessons help in solving an elementary problem using the Stack Data Structure and Queue Data Structure. Also, follow the links provided in the lessons for better understanding. 

Studying The Basic Data Structures - Stacks & Queues

 A student at NIT Durgapur pursuing B.Tech currently in my final year. Interested in Data Structures, Algorithms and Web Development.


Sarfraz Baig

This course deals with the Abstract Data Type Queue and its implementation. In these series of lessons, we will try to do an in-depth analysis of queue and its implementations. The course also deals with solving competitive programming questions based on queue along with some typical questions asked in an interview.

Introduction To Queues

Quant Researcher at Algorithm Trading/Computer Science NSIT/Competitive Coding

Shaksham Garg

The course is about linked list data structure. The prerequisites for the course are: Pointers; Dynamic Memory Allocation. 
The course first gives an introduction to linked list then discusses about operation that can be performed on linked list.

Data Structure and Algorithms - Linked List

The course is about Stacks and Queues. Stacks and Queues are widely used in competitive programming and are of significant importance in solving many real life problems like expression conversion. Recursion in any programming language is internally implemented by using stacks only. Similarly Queues have their own importance like solving of first come first serve scheduling algorithms.

Data Structures and Algorithms - Stacks and Queues

Computer science background. Passionate about solving real life problems through algorithms. Intern at GeeksforGeeks. Freelancer.

Dhiman Mayank

This course will discuss algorithms and data structures with important interview questions.

Lessons

3 lessons • 25m

Invalid Date

NaN

Number Theory (I) : Euclid's Algorithm

Invalid Date

NaN

Number Theory (I) : Primes And Exponentiation

Invalid Date

NaN

Problem 08: Computing Huge Values