DEV Community: Olga Lapovsky

Crack The Coding Interview With Me:DFS

Olga Lapovsky — Tue, 10 Aug 2021 13:05:03 +0000

📚 Theory:

👩‍💻 Code:

🗃 Interview Questions

Crack The Coding Interview With Me: Quick Sort

Olga Lapovsky — Sun, 24 Jan 2021 16:35:09 +0000

📚 Theory:

stackabuse.com: Quicksort in JavaScript

👩‍💻 Code:

🗃 Interview Questions

👩‍💻Local Hack Day: Build Day 1

Olga Lapovsky — Mon, 11 Jan 2021 17:47:05 +0000

Local Hack Day: Build

So far, I've introduced myself to #introduce-yourself and my guild, attended the live session "Set Up a Personal GitHub Page".
I updated my portfolio website on Github pages.
Prtfolio

Here go Day 2!!!

Crack The Coding Interview With Me: Merge Sort

Olga Lapovsky — Sat, 09 Jan 2021 08:57:23 +0000

📚 Theory:

More Sources:

👩‍💻 Code:

🗃 Interview Questions

Crack The Coding Interview With Me: Binary Search

Olga Lapovsky — Mon, 04 Jan 2021 20:01:03 +0000

📚 Theory:

👩‍💻 Code:

▶ Iterative Binary Search

▶ Recursive Binary Search

🗃 Interview Questions

Crack The Coding Interview With Me

Olga Lapovsky — Sun, 03 Jan 2021 17:52:39 +0000

🎃 About me

I'm a recent graduate in Software Engineering from Israel.
Looking for my first Junior dev role to start my high-tech career.
LinkedIn

👩‍💻 Who this blog posts for?

Those who are in the process of finding a job and repeating study materials.

🎯 The Plan

In the following weeks I'll share summary's and code implantation for DSA (Data Structures & Algorithms),Interview Q&A and more relevant subjects for technical interview, I'll share the code in JavaScript.

💾 This list of subjects I'll blog post (will be updated)

Data Structures	Algorithms	Concepts
Linked Lists	Breadth-First Search	Bit manipulation
Trees,Tries & Graphs	Depth-First Search	Memory (Stack Vs. Heap)
Stacks & Queues	Binary Search	Recursion
Heaps	Merge Sort	Dynamic Programming
Vectors / ArrayLists	Quick Sort	Big O Time & Space
Hash Tables

See you in the coming weeks...👋

Bubble Sort in JavaScript

Olga Lapovsky — Tue, 17 Nov 2020 12:38:36 +0000

📼 Explanation of Bubble Sort :

💻 CODE :

function bubbleSort(array) {
  let isSorted = false;
  let arrayLength = array.length - 1;
  let temp;
  while (!isSorted) {
    isSorted = true;
    for (let i = 0; i < arrayLength; i++) {
      if (array[i] > array[i + 1]) {
        temp = array[i + 1];
        array[i + 1] = array[i];
        array[i] = temp;
        isSorted = false;
      }      
    }
    arrayLength--;
  }
}

Time Complexity:

Best: Ω(N)
Average: Θ(N²)
Worst: Ο(N²)

Space Complexity:

Ο(1)