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

By David Inga In Programming Problems

Find the Largest Value in a BST that is Smaller than the Target Value

Pramp Largest Smaller BST Key Problem Given a root of a Binary Search Tree (BST) and a number num, implement an efficient function findLargestSmallerKey that…

Read More

Algorithms

Reverse a Linked List

Algorithms

Return the nth Fibonacci Number (Iterative)

Algorithms

Breadth First Search (BFS)

Algorithms

Depth First Search (DFS)

Data Structures

Simple Hash Table in Swift

Data Structures

Graph with Adjacency List

Data Structures

Graph with Adjacency Matrix

Data Structures

Graph with Objects and Pointers

Algorithms

Binary Search

Algorithms

HeapSort

Algorithms

MergeSort

Algorithms

QuickSort

Algorithms

Radix Sort

Programming Problems

Daily Coding Problem #104: Asked By Google

Programming Problems

Shift Zeros In Array In Place

Data Structures

Graphs

Algorithms

Insertion Sort

Data Structures

Heaps

Data Structures

Binary Tree Descriptors

Data Structures

Binary Trees

« Previous 1 2 3 4 Next »