Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 87708b2

Browse files
updating gitignore file
1 parent a1fecd0 commit 87708b2

26 files changed

+33
-1
lines changed

‎.gitignore‎

Lines changed: 10 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -51,4 +51,13 @@ random-code-1.js
5151
random-code-2.js
5252
random-code-3.js
5353
random-code-4.js
54-
performance-1.js
54+
performance-1.js
55+
56+
57+
#ignore file name ending in "-bkp.js" OR "-bkp.ts" OR "-bkp.py" OR "-test.js" OR "-test.ts" OR "-test.py" in its name. So I will have to put "-test.js" at all files that is just for my development-time random testing code .
58+
**/*-bkp.js
59+
**/*-bkp.ts
60+
**/*-bkp.py
61+
**/*-test.js
62+
**/*-test.ts
63+
**/*-test.py

‎BinarySearch/BST-Basics.js‎

100644100755
File mode changed.

‎BinarySearch/README.md‎

100644100755
File mode changed.

‎BinarySearch/binary-search-basic-FUTURE-REFERENCE.js‎

100644100755
File mode changed.

‎BinarySearch/check-if-a-bin_Tree_node-is-BST-FUTURE-REFERENCE.js‎

100644100755
File mode changed.

‎HashTable/README.md‎

100644100755
File mode changed.

‎LinkedList/README.md‎

100644100755
File mode changed.

‎LinkedList/leetcode-remove-nt--list.js‎

100644100755
File mode changed.

‎Queues/README.md‎

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
## Queues
2+
3+
Similar to Stack, Queue is another linear data structure that stores the element in a sequential manner. The only significant difference between Stack and Queue is that instead of using the LIFO method, Queue implements the FIFO method, which is short for First in First Out.
4+
5+
A perfect real-life example of Queue: a line of people waiting at a ticket booth. If a new person comes, they will join the line from the end, not from the start — and the person standing at the front will be the first to get the ticket and hence leave the line.
6+
7+
## Basic operations of Queue
8+
9+
Enqueue() — Inserts element to the end of the queue
10+
11+
Dequeue() — Removes an element from the start of the queue
12+
13+
isEmpty() — Returns true if queue is empty
14+
15+
Top() — Returns the first element of the queue
16+
17+
## Commonly asked Queue interview questions
18+
19+
Implement stack using a queue
20+
21+
Reverse first k elements of a queue
22+
23+
Generate binary numbers from 1 to n using a queue

‎README.md‎

100644100755
File mode changed.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /