Inga X – Page 3 – An education platform for people passionate about software engineering to learn problem solving techniques and useful algorithms and data structures

By David Inga In Algorithms

Radix Sort

Quick Facts Non-comparitive sorting algorithm.Running time is $latex O(d*(n+b))$, where $latex d$ is the number of $latex digits$, and $latex…

Read More

Data Structures

Hash Sets

Data Structures

Hash Tables

Data Structures

Queues

Data Structures

Arrays

Data Structures

Linked Lists

Data Structures

Stacks

Algorithms

Big-O Notation

Swift

Swift – Key Language Features

Algorithms

Top-Down Algorithms

Algorithms

Bottom-up Algorithms

Programming Problems

Daily Coding Problem #61: Asked by Google

Programming Problems

Daily Coding Problem #6: Asked by Google

Programming Problems

Daily Coding Problem #5: Asked by Jane Street

Interviews

How To Solve a Hard Programming Interview Question

Programming Problems

Daily Coding Problem #4: Asked by Stripe

Programming Problems

Daily Coding Problem #3: Asked by Google

Programming Problems

Daily Coding Problem #2: Asked by Uber

Interviews

What does Familiarity with a Programming Language in Job Requirements Mean?

Swift

5 Reasons Why You Should Learn Swift

Swift

String Indexing in Swift 4

« Previous 1 2 3 4 Next »