Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 11 additions & 0 deletions InterviewExpectations.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
What is a technical interview?

A technical interview is a job interview that is usually conducted by a company in the tech industry. These interviews will test your problem solving skills to see how you might fit in regards to a specific company.

What questions can you expect?

Although there are many types of technical interviews, the most basic and seen interviews are those that ask you to write code. Typically, you would be given 2-4 questions and a certain time limit to answer them. Note that you are expeceted to not finish all the problems, especially if you are given 4 questions.

What programming topics are usually tested?

Most of the companies that you might test for only require an intermediate understanding of a programming language of your choosing. Although there are manydifferent languages, these languages share common traits, and it will be these common traits that will be tested. This includes everything from strings and arrays to recursion and sorting algorithms. Again, the thing that companies are looking for isn't your coding knowledge, it's your ability to think and work your way through challenging obstacles in your path.
15 changes: 14 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,9 @@ Please contribute to this repository to help it make better. Any change like new
* Install JDK8 https://docs.oracle.com/javase/8/docs/technotes/guides/install/install_overview.html
* Install Git https://git-scm.com/book/en/v2/Getting-Started-Installing-Git
* Install either Intellij https://www.jetbrains.com/idea/download/
* If you like eclipse instead of intellij install eclipse https://eclipse.org/downloads/
* If you like eclipse instead of intellij install eclipse https://eclipse.org/downloads/
* Install PyCharm https://www.jetbrains.com/help/pycharm/installation-guide.html
* If you like Visual Studio instead install https://visualstudio.microsoft.com/

<h3> Set up your desktop </h3>
* Pull the git repository. Go to command line and type git clone https://github.com/mission-peace/interview.git
Expand All @@ -25,3 +27,14 @@ Please contribute to this repository to help it make better. Any change like new
* Go to any program and run that program
* Go to any test and run the junit test.
* Run ./gradlew build to create classes, run tests and create jar.

<h2> Tips and Tricks </h2>

<h3> Welcome! </h3>
If you are a beginner to programming, welcome! All this code may seem daunting, but do not panic! Many of the programmers that you typically see online often have years of experience, so it is perfectly okay to get lost! Programming is a skill that needs to be built over time, no one magically becomes a good programmer. With that said, let's get started!

<h3> Starting out! </h3>
Whether you are a brand new programmer or have minimal experience, this GitHub repository is designed to help you get better and improve your skills. Start with learning Python and checking out the Python folder.

<h3> Advanced Programmers! </h3>
If you are an advanced programmer, check out the how to interview text file. This file will tell you what to expect for technical interviews, and how you can prepare for them.
8 changes: 8 additions & 0 deletions python/array/twosum.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:

d = {}
for i, j in enumerate(nums):
r = target - j
if r in d: return [d[r], i]
d[j] = i
15 changes: 15 additions & 0 deletions python/linkedlist/mergeTwoLists.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
class Solution:
def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
cur = dummy = ListNode()
while list1 and list2:
if list1.val < list2.val:
cur.next = list1
list1, cur = list1.next, list1
else:
cur.next = list2
list2, cur = list2.next, list2

if list1 or list2:
cur.next = list1 if list1 else list2

return dummy.next