1590117269

# 50+ Technical Interview Problems Solved in Go

Collection of Technical Interview Questions solved with Go

I have been solving various technical interview problems and coding challenges in Go. The problems vary from simple “Reverse a String” to more involving ones like “Implement the A* Algorithm”

If you have any feedback and/or some suggestions for new problems to solve, I would appreciate it as my goal is to grow this collection and help anyone interested in learning and/or practicing before their interview

• ``````AlgorithmsA Star
``````
• ``````DatastructuresLinked ListsDoubly Linked List
``````
• ``````Singly Linked List
``````
• ``````MapsHash Multi Maps
``````
• ``````LRU Caches
``````
• ``````Trees
``````
• ``````Priority Queues
``````
• ``````Queues
``````
• ``````SetsHash Multi Sets
``````
• ``````Hash Sets
``````
• ``````StacksLinked List Stacks
``````
• ``````Min/Max Stacks
``````
• ``````Slice Stacks
``````
• ``````EvaluationsPostfix
``````
• ``````Repeating Fractions
``````
• ``````ListsDetect Cycle
``````
• ``````Detect Intersection
``````
• ``````Reverse List
``````
• ``````NumbersArmstrong Number
``````
• ``````Base Conversions
``````
• ``````Count Digits
``````
• ``````Excel Column Conversions
``````
• ``````Fibonacci Number
``````
• ``````Leap Years
``````
• ``````Palindromes
``````
• ``````Perfect Number
``````
• ``````Power Function
``````
• ``````Prime Number
``````
• ``````Reverse
``````
• ``````StacksBalanced Parantheses
``````
• ``````SlicesDuplicates
``````
• ``````Group Anagrams
``````
• ``````Min Meeting Rooms
``````
• ``````RotationsCount Rotations
``````
• ``````Minimum in Rotated Array
``````
• ``````StreamsMoving Average
``````
• ``````Running Average
``````
• ``````Running Median
``````
• ``````StringsAdd Binary Strings
``````
• ``````PalindromesPalindrome Sentences
``````
• ``````Palindrome Strings
``````
• ``````ReversesReverse Sentences
``````
• ``````Reverse Strings
``````
• ``````Sort
``````
• ``````Break Words
``````
• ``````TreesBalanced TreesBalanced Binary Trees
``````
• ``````Balanced Trees
``````
• ``````HeightsBinary Tree Heights
``````
• ``````Tree Heights
``````
• ``````Invert TreesInvert Binary Trees
``````
• ``````Invert Trees
``````
• ``````Longest Distinct Paths
``````
• ``````Print By Columns
``````
• ``````Print By Levels
``````

#go #interview-questions #programming #developer

1605176864

## How to do Problem Solving as a Developer

In this video, I will be talking about problem-solving as a developer.

#problem solving skills #problem solving how to #problem solving strategies #problem solving #developer

1620930180

## Ace Your Technical Interviews with These GitHub Repositories

### Leverage these repositories to ace your next technical and coding interviews

Getting past the technical and coding interview is not always an easy task for most people.

Lucky for you, there are some amazing resources to help you go through easily and grab that position.

In this article, we will go through some of the best GitHub repositories to help you smash the coding interview.

These collections of repositories are essential in highlighting the different arears to focus on and different topics and questions to expect.

Front-end Developer Interview Questions

This repository is everything that entails frontend development.

Covered content includes:

• General Questions
• HTML Questions
• CSS Questions
• JS Questions
• Accessibility Questions (external link)
• Testing Questions
• Performance Questions
• Network Questions
• Coding Questions

#coding-interviews #technical-interview-tips #programming-interviews #interview-preparation #interview

1590117269

## 50+ Technical Interview Problems Solved in Go

Collection of Technical Interview Questions solved with Go

I have been solving various technical interview problems and coding challenges in Go. The problems vary from simple “Reverse a String” to more involving ones like “Implement the A* Algorithm”

If you have any feedback and/or some suggestions for new problems to solve, I would appreciate it as my goal is to grow this collection and help anyone interested in learning and/or practicing before their interview

• ``````AlgorithmsA Star
``````
• ``````DatastructuresLinked ListsDoubly Linked List
``````
• ``````Singly Linked List
``````
• ``````MapsHash Multi Maps
``````
• ``````LRU Caches
``````
• ``````Trees
``````
• ``````Priority Queues
``````
• ``````Queues
``````
• ``````SetsHash Multi Sets
``````
• ``````Hash Sets
``````
• ``````StacksLinked List Stacks
``````
• ``````Min/Max Stacks
``````
• ``````Slice Stacks
``````
• ``````EvaluationsPostfix
``````
• ``````Repeating Fractions
``````
• ``````ListsDetect Cycle
``````
• ``````Detect Intersection
``````
• ``````Reverse List
``````
• ``````NumbersArmstrong Number
``````
• ``````Base Conversions
``````
• ``````Count Digits
``````
• ``````Excel Column Conversions
``````
• ``````Fibonacci Number
``````
• ``````Leap Years
``````
• ``````Palindromes
``````
• ``````Perfect Number
``````
• ``````Power Function
``````
• ``````Prime Number
``````
• ``````Reverse
``````
• ``````StacksBalanced Parantheses
``````
• ``````SlicesDuplicates
``````
• ``````Group Anagrams
``````
• ``````Min Meeting Rooms
``````
• ``````RotationsCount Rotations
``````
• ``````Minimum in Rotated Array
``````
• ``````StreamsMoving Average
``````
• ``````Running Average
``````
• ``````Running Median
``````
• ``````StringsAdd Binary Strings
``````
• ``````PalindromesPalindrome Sentences
``````
• ``````Palindrome Strings
``````
• ``````ReversesReverse Sentences
``````
• ``````Reverse Strings
``````
• ``````Sort
``````
• ``````Break Words
``````
• ``````TreesBalanced TreesBalanced Binary Trees
``````
• ``````Balanced Trees
``````
• ``````HeightsBinary Tree Heights
``````
• ``````Tree Heights
``````
• ``````Invert TreesInvert Binary Trees
``````
• ``````Invert Trees
``````
• ``````Longest Distinct Paths
``````
• ``````Print By Columns
``````
• ``````Print By Levels
``````

#go #interview-questions #programming #developer

1603962000

## 7 Steps To Solving Your Technical Interview Problem

If you’re anything like me, technical interviews can be very nerve recking, especially timed ones! You look at the problem, look at the ticking clock, and before you even read the question your palms are sweating and you’ve magically forgotten everything.

Well, I’m here to help calm your nerves and, hopefully, help you get your thoughts in order so that you can pass that technical interview and be that much closer to getting your dream job.

I was fortunate enough to dig into the world famous book ‘Cracking The Coding Interview’ by Gayle Laakmann McDowell. If you are a software engineer or just getting into the tech industry, I highly recommend you get your hands on a copy. The book does a great job of preparing individuals for the technical portion of the interview process. Today I am going to be talking about the seven steps to problem solving during a technical interview, discussed in the book.

## Step 1: Listen

You want to make sure you get a good grasp of the problem description. Be sure to ask any necessary question to clarify any details that may seem not so clear. Do not be afraid to ask questions! I find it helpful to take little notes and jot down specified details that the interviewer may have given so that I can refer back to the notes and be sure that my code takes all details into account.

## Step 2: Example

Before you begin coding, you want to make an example case. Actually, you want to have multiple test cases for examples. But you don’t want to have an example that is too easy, because this may not cover all test cases and could easy slip past a specific detail. So what does a good example consist of? Well, according to ‘Cracking the Coding Interview’, your example should be: ‘Specific… Sufficiently large… Not a special case.’

## Step 3: Brute Force

Next up, you want to find the easiest solution you can think of. This will show the interviewer that you are capable of solving the problem. This will also help you gain clarity on the problem and give you some guidance while writing your optimal solution as well. So before you begin spending the time to write the most optimal solution, try to get the easy solution out first.

#technical-interview #crackingtheinterviews #coding #coding-challenge #problem-solving

1599854400

## What's new in the go 1.15

Go announced Go 1.15 version on 11 Aug 2020. Highlighted updates and features include Substantial improvements to the Go linker, Improved allocation for small objects at high core counts, X.509 CommonName deprecation, GOPROXY supports skipping proxies that return errors, New embedded tzdata package, Several Core Library improvements and more.

As Go promise for maintaining backward compatibility. After upgrading to the latest Go 1.15 version, almost all existing Golang applications or programs continue to compile and run as older Golang version.

#go #golang #go 1.15 #go features #go improvement #go package #go new features