Skip to content

Commit

Permalink
Python, JavaScript interview practise.
Browse files Browse the repository at this point in the history
  • Loading branch information
Tafara-N committed Sep 2, 2024
1 parent 759609f commit b99859b
Showing 1 changed file with 46 additions and 26 deletions.
72 changes: 46 additions & 26 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -163,18 +163,7 @@ By studying these concepts and utilizing the resources provided, you will be equ

# Additional Resources
- [Mock Technical Interview](https://www.youtube.com/watch?v=h4i4kjwncoU)

# Requirements

## General
- Allowed editors: `vi`, `vim`, `emacs`
- All your files will be interpreted/compiled on Ubuntu 20.04 LTS using `python3` (version `3.4.3`)
- All your files should end with a new line
- The first line of all your files should be exactly `#!/usr/bin/python3`
- A `README.md` file, at the root of the folder of the project, is mandatory
- Your code should be documented
- Your code should use the `PEP 8` style (version 1.7.x)
- All your files must be executable
___

4. # Log Parsing

Expand Down Expand Up @@ -425,20 +414,6 @@ By thoroughly understanding these concepts and utilizing the provided resources,
- [Mock Technical Interview](https://www.youtube.com/watch?v=9BSSIsJ-fWg)
___

## Requirements

## Python

### General
- Allowed editors: `vi`, `vim`, `emacs`
- All your files will be interpreted/compiled on Ubuntu 20.04 LTS using `python3` (version `3.4.3`)
- All your files should end with a new line
- The first line of all your files should be exactly `#!/usr/bin/python3`
- A `README.md` file, at the root of the folder of the project, is mandatory
- Your code should be documented
- Your code should use the `PEP 8` style (version 1.7.x)
- All your files must be executable

10. # Island Perimeter

For the “0. Island Perimeter” project, you will need to apply your knowledge of algorithms, data structures (specifically matrices or 2D lists), and iterative or conditional logic to solve a geometric problem within a grid context. The goal is to calculate the perimeter of a single island in a grid, where the grid is represented by a 2D array of integers. Understanding how to navigate and analyze 2D arrays and apply logical operations to determine the conditions for perimeter calculation is crucial for this task.
Expand Down Expand Up @@ -490,6 +465,51 @@ By understanding these concepts and utilizing the provided resources, you will b

# Additional Resources
- [Mock Technical Interviews](https://www.youtube.com/watch?v=fFgEM6CMQc4)
___

11. # Prime Game

For this project, you will need to leverage your understanding of prime numbers, game theory, and algorithm optimization to solve a competitive game scenario. The challenge involves determining the winner of a game based on the strategic removal of prime numbers and their multiples from a set of consecutive integers.

# Concepts Needed:

1. **Prime Numbers:**
- Understanding what prime numbers are.
- Efficient algorithms for identifying prime numbers within a range.

2. **Sieve of Eratosthenes:**
- An efficient algorithm for finding all prime numbers up to any given limit, which can be particularly useful for this task.

3. **Game Theory:**
- Basic principles of competitive games where players take turns and the concept of optimal play.
- Understanding win conditions and strategies that lead to a win or loss.

4. **Dynamic Programming/Memoization:**
- Using previous results to make future calculations faster, potentially necessary for optimizing the solution for multiple rounds of the game.

5. **Python Programming:**
- Loops and conditional statements for implementing game logic and algorithms.
- Arrays and lists for storing the integers and tracking removed numbers.

# Resources:

- **Prime Numbers and Sieve of Eratosthenes:**
- [Khan Academy: Prime Numbers](https://www.khanacademy.org/math/cc-fourth-grade-math/imp-factors-multiples-and-patterns/imp-prime-and-composite-numbers/v/prime-numbers): Introduction to prime numbers.
- [Sieve of Eratosthenes in Python](https://www.geeksforgeeks.org/sieve-of-eratosthenes/): A step-by-step guide to implementing the sieve algorithm in Python.

- **Game Theory Basics:**
- [Game Theory Introduction](https://www.investopedia.com/terms/g/gametheory.asp): A simple explanation of game theory and strategic decision-making.

- **Dynamic Programming:**
- [What Is Dynamic Programming With Python Examples](https://skerritt.blog/dynamic-programming/): An introduction to dynamic programming with Python examples.

- **Python Official Documentation:**
- [Python Lists](https://docs.python.org/3/tutorial/introduction.html#lists): Managing lists in Python, useful for tracking the game state.

By grasping these concepts and making use of the recommended resources, you will be well-equipped to approach the problem with a solid understanding of both the mathematical and programming challenges involved. The key to success in this project lies in applying efficient algorithms to manage the game’s state and making optimal decisions based on the game’s rules.

# Additional Resources
- [Mock Technical Interview]()

# Requirements

Expand Down

0 comments on commit b99859b

Please sign in to comment.