raghavddps23/learninggo-

Repository to learn the Go programming language while submitting simple solutions!

learninggo-'s Issues

Add the Selection Sort Algorithm in Go

1. Write the Selection Sort Algorithm in go lang
2. Include certain test cases as well
3. Make sure you include edge cases too.

Please put it into the easy folder.

Search in a 2D Sorted Matrix

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
Put this in the medium folder.

Integers in each row are sorted from left to right.
The first integer of each row is greater than the last integer of the previous row.

Input and Output format
Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,50]], target = 3
Output: true

Write a program in go for the same

Add the Merge Sort Algorithm

1. Write the Merge Sort Algorithm in go lang
2. Include certain test cases as well
3. Make sure you include edge cases too.

Please put it into the medium folder.

Search in a 2D matrix

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
Put this in the medium folder.

Integers in each row are sorted from left to right.
The first integer of each row is greater than the last integer of the previous row.

Input and Output format
Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,50]], target = 3
Output: true

Write a program in go for the same

Add Bubble Sort algorithm in Go

Add Bubble sort algorithm in golang

Add code to read and file and print onto the console in Go

1. Read a file (text file) and print its contents into the terminal
2. Put this in the Easy folder.

Add the Queue Data Structure

Add the Queue Data structure in the Medium Folder.
For guide on how to get started, refer to the Stack Data Structure implemented in the Medium Folder

You need to create 2 files

1. One file implementing all the queue functions - enqueue/dequeue/is Empty/front
2. Another file using the same Queue written in the previous file.

For understanding how a queue works, refer this article on GeeksForGeeks
https://www.geeksforgeeks.org/array-implementation-of-queue-simple/

Spiral traversal of a matrix

Add the solution for this problem in Go in the medium folder.

Example: Given an input like this
4 4
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Output:
1 2 3 4 8 12 16 15 14 13 9 5 6 7 11 10

The first two lines indicating the number of rows and columns and the next line contains the elements row by row, we are supposed to print the spiral order traversal of the matrix.

Concepts required - Variables/If else statements/loops

Improve the Folder structure and improve the documentation

Suggest an approach to organize the programs better and then raise a Pull Request to restructure the repository and improve the documentation for the repository as well.