Skip to content

JinLeeGG/Python_CodingTest

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

109 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Python_CodingTest

This is my personal notes and preparation space for future coding interviews, including class notes and coding practice.

Overview

This repository is a collection of Python coding problems, solutions, Jupyter Notebooks (.ipynb), and class notes (PDFs and PNGs) to help me prepare for coding interviews and document my learning from classes. It’s organized by days and topics, focusing on key data structures and algorithms.

Repository Structure

  • (Day1) Level test, Stack

    • basic level test problems, stack exercises, and related notes
  • (Day2) Stack, Queue, Deque, NonLinear Structure

    • notes covering stacks, queues, deques, and nonlinear structures basics (tree, graph)
  • (Day3) Basic Data Structure, List(array)

    • notes on basic data structures, lists(arrays)
  • (Day4) Tree, binary tree

    • notes on tree, traversal of binary Tree, binary search tree, Skewed binary tree
  • (Day5) DFS, BFS

    • Notes on DFS, BFS
  • (Day6) Greed, Dijkstra's algorithm

    • Notes on Greedy algorithms: Kruskal, Prim
    • Notes on Dijkstra's algorithms
    • touch of Bellman–Ford algorithm
  • (Day7) BackTracking(Subset)

    • Notes on Backtracking (subset) problems
  • (Day8) BackTracking(Subset), Sorting algorithm

    • Notes on Backtracking (subset) problems
    • Notes on Sorting Algorithm
  • (Day9) Heap (Need to Review)

    • Notes on Heap, heap example problems
  • (Day10) Coding Problem Solving Practice - Financial Companies

    • Problem solving, notes
  • (Day11) Hash, HashMap, HashTable, Hash function

    • Notes on Hash, HashTable, Hash Functions, example problems
  • (Day12) Breadth First Search (BFS)

    • Notes on BFS, example problems
  • (Day13) DFS/BFS, Dijkstra's algorithm

    • DFS/BFS, Dijkstra's algorithm problems solve
  • (Day14) Minimum Spanning Tree Problems

    • MST Problems solving using different algorithms
  • (Day15) Greed Algorithm Problem Pattern and Solving

    • Greed Algorithm Problem solving
  • (Day16) Kakao, Samsung Coding Test Problems Solving

    • Korea Big Tech Coding Problem Solving

Prerequisites

  • Python 3.x
  • Jupyter Notebook (e.g., via Anaconda, pip install notebook or Google Colab)
  • A PDF viewer (for notes in PDF format)
  • An image viewer (for PNG files)

Usage

  • Jupyter Notebooks (.ipynb): Open these in Jupyter Notebook or google colab to run code interactively, view outputs, and explore solutions.
  • PDF Notes: Contain class notes, diagrams, or explanations related to the topics.
  • PNG Files: Screenshots or images supplementing the notes or problems.

About

This is my notes and prep place for coding interviews in the future

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors