SG Newsletter | Serhat Giydiren | Substack

Undirected Graphs

An excerpt from the book Algorithms (4th Edition) by Robert Sedgewick and Kevin Wayne. And I also added a python implementation. Definitions A graph is…

Nov 12, 2022 •

Serhat Giydiren

New

Indexed Minimum Priority Queue

Data Structure for operations (push, delete-the-minimum, update, delete) with Θ(log N) time complexity

Oct 28, 2022 •

Serhat Giydiren

Book Review: Algorithms

By Robert Sedgewick, Kevin Wayne

Oct 23, 2022 •

Serhat Giydiren

Coding Interview Question: Find the greatest integer smaller than N with the same set of digits as N (C++ Solutions with O(n ^ 2) and O(n…

Google, Meta, Amazon Interview Questions

Oct 20, 2022 •

Serhat Giydiren

Coding Interview Question: Nested List Weight Sum (C++ and Python Solutions)

Google, Meta, Amazon Interview Questions

Oct 15, 2022 •

Serhat Giydiren

Quick Select: Linear runtime complexity to find the median of unsorted arrays

I reviewed some implementations of the median function in widely used statistics packages. They use simple flow like sorting the array and returning the…

Oct 12, 2022 •

Serhat Giydiren

This is SG Newsletter, a newsletter about #tech_interviews, #data_structures, #algorithms, #system_design, and #leadership.

Oct 11, 2022 •

Serhat Giydiren

SG Newsletter

#tech_interviews, #data_structures, #algorithms, #system_design, and #leadership

SG Newsletter

#nojs-banner { position: fixed; bottom: 0; left: 0; padding: 16px 16px 16px 32px; width: 100%; box-sizing: border-box; background: red; color: white; font-family: -apple-system, "Segoe UI", Roboto, Helvetica, Arial, sans-serif, "Apple Color Emoji", "Segoe UI Emoji", "Segoe UI Symbol"; font-size: 13px; line-height: 13px; } #nojs-banner a { color: inherit; text-decoration: underline; } This site requires JavaScript to run correctly. Please turn on JavaScript or unblock scripts