-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathindex.html
94 lines (82 loc) · 2.01 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
<html>
<head>
<title>Data Structures and Algorithms | InterQues</title>
<link rel="stylesheet" href="../assets/css/questions-list-style.css" />
<meta
name="description"
content="Data Structures and Algorithms interview questions"
/>
</head>
<body>
<div>
<a href="../index.html">
<img
src="../assets/hacktoberfest.png"
height="120px"
alt="Hacktoberfest"
/>
</a>
</div>
<div>
<p>
<small>
<a href="../index.html">Home</a>
> Data Structures and Algorithms Questions
</small>
</p>
</div>
<div>
<h3>Data Structures and Algorithms Questions</h3>
<p>
<em>
Below is a compiled list of Data Structures and Algorithms interview
questions that will help you conquer that upcoming interview of yours!
</em>
</p>
</div>
<ol class="questions-list">
<li>
<a href="./answers/q1.html">
<h4>
How do you find the largest and smallest number in an unsorted
integer array?
</h4>
</a>
</li>
<li>
<a href="./answers/q2.html">
<h4>Given two binary trees, check if they are the same or not.</h4>
</a>
</li>
<li>
<a href="./answers/q3.html">
<h4>
Given a BST, convert it into a sorted linked list. Return the head
of LL.
</h4>
</a>
</li>
<li>
<a href="./answers/q4.html">
<h4>
Write a Python program to determine if a number is Prime or not.
</h4>
</a>
</li>
<li>
<a href="./answers/q5.html">
<h4>
How to Reverse a Linked List ?
</h4>
</a>
</li>
<li>
<a href="./answers/q6.html">
<h4>
Find all occurance of an element in an array.
</h4>
</a>
</li>
</ol>
</body>
</html>