diff --git a/Progress/app b/Progress/app new file mode 100644 index 00000000..4396cc67 --- /dev/null +++ b/Progress/app @@ -0,0 +1,102 @@ +from logging import debug +from types import MethodType +from flask import Flask, render_template, request +from flask_mysqldb import MySQL +import json +import time + +app = Flask(__name__) + +app.config['MYSQL_HOST'] = 'localhost' +app.config['MYSQL_USER'] = 'root' +app.config['MYSQL_PASSWORD'] = '4321' +app.config['MYSQL_DB'] = 'codingprofilesfeedback' + +mysql = MySQL(app) + + +@app.route("/chart/", methods=['GET','POST']) +def index(userid): + #if MethodType == 'GET' or MethodType == 'POST': + uid = userid + cursor = mysql.connection.cursor(); + cursor.execute("SELECT `Accepted`,`WrongAnswer`,`TimeLimitExceed`,`CompilationError`,`RunTimeError` FROM usersubmissions WHERE userId LIKE %s",[uid]) + data = cursor.fetchall() + values = list(data) + + cursor = mysql.connection.cursor(); + cursor.execute('SELECT b.ContestTimeStamp FROM usercontestdetails as a inner join contestdetails as b on a.contestId=b.contestId where a.userid LIKE %s and a.platform="codeforces"',[uid]); + lab = cursor.fetchall() + cursor2 = mysql.connection.cursor(); + cursor2.execute('SELECT a.contestRating FROM usercontestdetails as a inner join contestdetails as b on a.contestId=b.contestId where a.userid LIKE %s and a.platform="codeforces"',[uid]) + val = cursor2.fetchall() + #------------- + labels = ["Accepted","WrongAnswer","TimeLimitExceed","CompilationError","RunTimeError"] + + cursor = mysql.connection.cursor(); + cursor.execute("SELECT * FROM leaderboardtable WHERE userId LIKE %s",[uid]) + leader = cursor.fetchall() + tags=['Binary Search','Binary Tree','Matrices','Arrays','Probabilities','Implementation','Math','Backtracking','Number Theory','Divide and Conquer','Brute Force','Dynamic Programming','Graphs','Trees','Depth First Search','Breadth First Search','Bit Manipulation','Strings','Data Structures','Games','Greedy','Hashing','Sorting','Two Pointers','Others'] + cursor = mysql.connection.cursor() + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.binarySearch=true",[uid]) + bs = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.binaryTree=true",[uid]) + bt = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.matrices=true",[uid]) + mat = cursor.fetchall(); + + + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.arrays=true",[uid]) + arr = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.probabilities=true",[uid]) + prob = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.implementation=true",[uid]) + implementation = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.math=true",[uid]) + math = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.backtracking=true",[uid]) + backtracking = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.numberTheory=true",[uid]) + number = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.divideAndConquer=true",[uid]) + dandc = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.bruteforce=true",[uid]) + brute = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.dp=true",[uid]) + dp = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.graphs=true",[uid]) + graph = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.trees=true",[uid]) + trees = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.dfs=true",[uid]) + dfs = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.bfs=true",[uid]) + bfs = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.bitManipulation=true",[uid]) + bit = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.strings=true",[uid]) + strings = cursor.fetchall(); + + + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.dataStructures=true",[uid]) + ds = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.games=true",[uid]) + games = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.greedy=true",[uid]) + greedy = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.hashing=true",[uid]) + hashing = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.sorting=true",[uid]) + sorting = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.twopointers=true",[uid]) + tp = cursor.fetchall(); + cursor.execute("SELECT a.problemName,a.problemId,a.problemLink FROM problemdetails as a inner join userproblemdetails as b ON a.problemId=b.problemId WHERE b.userId LIKE %s and b.verdict='ACCEPTED' and b.Others=true",[uid]) + others = cursor.fetchall(); + + + return render_template("chart.html", labels = labels, values = values, val=val, lab = lab, leader=leader, uid=uid,tags=tags, bs=bs, bt=bt, mat=mat,arr=arr,prob=prob,implementation=implementation,math=math,backtracking=backtracking,number=number,dandc=dandc,brute=brute,dp=dp,graph=graph,trees=trees,dfs=dfs,bfs=bfs,bit=bit,strings=strings,ds=ds,games=games,greedy=greedy,hashing=hashing,sorting=sorting,tp=tp,others=others) + + + +if __name__ == "__main__": + app.run(debug=True) diff --git a/Progress/templates/chart b/Progress/templates/chart new file mode 100644 index 00000000..9cfa560e --- /dev/null +++ b/Progress/templates/chart @@ -0,0 +1,453 @@ + + {{uid}} Performance + + + + + + + + + + + + +

Welcome {{uid}}

+
+
+
+

Submissions

+ +
+
+ + + + + + + + + + + + + + + + + + + +
CodechefCodeforcesInterviewBitSPOJLeetcode
{{leader[0][1]}}{{leader[0][2]}}{{leader[0][3]}}{{leader[0][4]}}{{leader[0][5]}}
+
+
+
+
+

Rating History

+ +
+
+ +
+
+

Problem Solved

+ + + {% if bs|length > 0 %} + + + + + + + {% endif %} + {% if bt|length > 0 %} + + + + + + {% endif %} + + {% if mat|length > 0 %} + + + + + + {% endif %} + {% if arr|length > 0 %} + + + + + + {% endif %} + {% if prob|length > 0 %} + + + + + {% endif %} + + + + + + + + + {% if backtracking|length > 0 %} + + + + + + {% endif %} + {% if number|length > 0 %} + + + + + {% endif %} + + {% if dandc|length > 0 %} + + + + + {% endif %} + + {% if brute|length > 0 %} + + + + + {% endif %} + + + {% if dp|length > 0 %} + + + + + {% endif %} + {% if graph|length > 0 %} + + + + + {% endif %} + {% if trees|length > 0 %} + + + + + {% endif %} + {% if dfs|length > 0 %} + + + + + {% endif %} + {% if bfs|length > 0 %} + + + + + {% endif %} + {% if bit|length > 0 %} + + + + + {% endif %} + {% if strings|length > 0 %} + + + + + {% endif %} + {% if ds|length > 0 %} + + + + + {% endif %} + {% if games|length > 0 %} + + + + + {% endif %} + {% if greedy|length > 0 %} + + + + + {% endif %} + {% if hashing|length > 0 %} + + + + + {% endif %} + {% if sorting|length > 0 %} + + + + + {% endif %} + {% if tp|length > 0 %} + + + + + {% endif %} + {% if others|length > 0 %} + + + + + {% endif %} + + +
{{tags[0]}} + {% for id in bs %} + {{id[0]}} | + {% endfor %} +
{{tags[1]}} + {% for id in bt %} + {{id[0]}} | + {% endfor %} +
{{tags[2]}} + {% for id in mat %} + {{id[0]}} | + {% endfor %} +
{{tags[3]}} + {% for id in arr %} + {{id[0]}} | + {% endfor %} +
{{tags[4]}} + {% for id in prob %} + {{id[0]}} | + {% endfor %} +
{{tags[5]}} + {% for id in implementation %} + {{id[0]}} | + {% endfor %} +
{{tags[6]}} + {% for id in math %} + {{id[0]}} | + {% endfor %} +
{{tags[7]}} + {% for id in backtracking %} + {{id[0]}} | + {% endfor %} +
{{tags[8]}} + {% for id in number %} + {{id[0]}} | + {% endfor %} +
{{tags[9]}} + {% for id in dandc %} + {{id[0]}} | + {% endfor %} +
{{tags[10]}} + {% for id in brute %} + {{id[0]}} | + {% endfor %} +
{{tags[11]}} + {% for id in dp %} + {{id[0]}} | + {% endfor %} +
{{tags[12]}} + {% for id in graph %} + {{id[0]}} | + {% endfor %} +
{{tags[13]}} + {% for id in trees %} + {{id[0]}} | + {% endfor %} +
{{tags[14]}} + {% for id in dfs %} + {{id[0]}} | + {% endfor %} +
{{tags[15]}} + {% for id in bfs %} + {{id[0]}} | + {% endfor %} +
{{tags[16]}} + {% for id in bit %} + {{id[0]}} | + {% endfor %} +
{{tags[17]}} + {% for id in strings %} + {{id[0]}} | + {% endfor %} +
{{tags[18]}} + {% for id in ds %} + {{id[0]}} | + {% endfor %} +
{{tags[19]}} + {% for id in games %} + {{id[0]}} | + {% endfor %} +
{{tags[20]}} + {% for id in greedy %} + {{id[0]}} | + {% endfor %} +
{{tags[21]}} + {% for id in hashing %} + {{id[0]}} | + {% endfor %} +
{{tags[22]}} + {% for id in sorting %} + {{id[0]}} | + {% endfor %} +
{{tags[23]}} + {% for id in tp %} + {{id[0]}} | + {% endfor %} +
{{tags[24]}} + {% for id in others %} + {{id[0]}} | + {% endfor %} +
+
+
+
+
+ +
+ + + + + + + + diff --git a/dsa-tracker/app.py b/dsa-tracker/app.py new file mode 100644 index 00000000..3403b3db --- /dev/null +++ b/dsa-tracker/app.py @@ -0,0 +1,36 @@ +from logging import debug +from types import MethodType +from flask import Flask, render_template, request +from flask_mysqldb import MySQL +import json +import time + +app = Flask(__name__) + +app.config['MYSQL_HOST'] = 'localhost' +app.config['MYSQL_USER'] = 'root' +app.config['MYSQL_PASSWORD'] = '4321' +app.config['MYSQL_DB'] = 'codingprofilesfeedback' + +mysql = MySQL(app) + + +@app.route('/',methods=['GET','POST']) +def main(): + tagline = [["Array","Harder than they seem","https://www.booleanworld.com/wp-content/uploads/2019/11/c-arrays-cover.png"],["Matrix","Tables and Logs","https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcSruFwK2aAnh9R9n1F5cRe9lDV6bKPt4tdk-w&usqp=CAU"],["String","THIS IS A STRING","https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcSCNMa1dqdHVDAlEV0nkMtx5jc5BXlmXmdF0w&usqp=CAU"],["Searching & Sorting","Best to Organize","https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcSmYKzfnH9ntGQZXt6iQu_yhiLTHygjeelqkg&usqp=CAU"],["LinkedList","Reverse it","data:image/jpeg;base64,/9j/4AAQSkZJRgABAQAAAQABAAD/2wCEAAoHCBYVFRUWFhUYGBgZGhwYGBgYGhkYGhwZGhgZHBocGBkcIS4lHB4rHxgcJjgmKy8xNTU1GiQ7QDs0Py40NTEBDAwMEA8QHhISHjQkJSs0NDQ0MTQ0MTQ0NDE0MTQ0NDQ0NDQ0NDQ0NDQ0MTQ0NDQ0NDQ0NDQ0NDQ0NDQ0ND80P//AABEIAJsBRQMBIgACEQEDEQH/xAAbAAABBQEBAAAAAAAAAAAAAAAFAAECAwQGB//EAEgQAAEDAQQFCAYGCAQHAAAAAAEAAhEDBBIhMQVBUWFxBiIygZGhscETQlJystEHM4KS4fAUIyRTc5OiwjRjo/EVQ0RUYoPS/8QAGgEAAgMBAQAAAAAAAAAAAAAAAQQAAgMFBv/EACcRAAICAgIBBQEBAAMBAAAAAAABAgMEERIxIQUTMkFRIhQjYYEG/9oADAMBAAIRAxEAPwDrWW4uALaTy05GGif6lL9Id+6f2s/+lZYB+rZwjsJHktEK7M9oyfpL9VF/W5nzTttLz/yHffZ81rhMyqwuLQ5pcIJaCJAO0ZhTZDP6ar+57ajUvS1f3Q/mN+Sz6H00y0urNY149E+44uAguHswVut1pFKnUqESGMc+NZugmJ6kNhK/S1f3Q++35JvS1f3Q/mD5LjrJ9J1FxF+z1WMcbofg5vXHlK7tjgQCDIOIO0HJR+AaMvpav7kfzG/JL0tT9z/qN+S2kKJQDsx/pb24uovA1lpa6BtgYkcFg01YrNa2XHPZfiWPDm3gTlhMkbRvWPlzbn06LGMcWmo66SCQboBJiOoda84YA7e4HX6sT4wqSnxHsbD92PLej1LQTHiyNY+WvY17DtDmFwEbsj1rxa01Huc4ve5x1uJJOeOJ3r1vkJa3VKNVr3Fxa+JOJhzRAJ3RC8m0ky7VqNiIqPaJyJD3CSt63vyKzhwm4mVo6k4GOWA1beBTAYxPdnPmVLVHdrHArXyVPWfo2q37I5pM3Xvb1OAI8V59aqd172ey9zexxC7H6KKsstLc4cxw62kT3LmdPMu2m0DZUf3mfNUXyIu9A5JOktCxu0Oee/3R4ovGKEaH6bvcHxIwlrOzqY/wGKzWTo/ad8RWpwWaxjmfad8RWRv9lpSCdMFAjpk6ShBkgEiYQ6panP6JLWzGEBx7cghKSS8loxcnpBJJCmF4iHng4l3UQiVJ95oO3Vs3KsZKXRadUo9k0gkE4ViiJJJilKDLjykrqNme/Jp4nALbR0b7RPAYd6zlbGJm5JA0J6geCOZEg4uluUZdqK/pNGm4NBbeMCBznYnWetZ9MA32cHeLAsXe9+DN2PfgwFzvZH3j8k6y22qRdwGM+SSnuyBzken6N+rb9r43K19qY1wY57WvdiGlwBI2gE4qmwDmEbHvH9bvmuG+lLQBcwWumOcyG1I9jU7qJ710kcPR0dn5QOFufZazGsBaHUHSYftk7d24qrTfJUuf+k2V5oWkYyOg/c8ea8wqi3Oo0a4c6rTpullQc51Nwza49IDccF7Jya0mbTZ6dYsLC4c4EEYjAkTqMSrdFujmvotcTTtQfhV9MS9pzBI/3XT8pD+yWn+C/wCByx2fQDqdufaWPDWVGRUZBJc+IvAzAyRbSdi9NRqUi4tD2lhcACQCIJxVW/IPs8r0DyPtVss1Brq1NlmvOqNbBL+cSHZDPPWvVgG0qecMYzM+y0a+xVaG0c2zUKdFri4MbdBIAJ3wEC+kWlaH2R7LOwuvEekunnBmcNb60nA7kG9snbOPocpLcy/pAOvWV9W4aTjIu5C6M27JGteq2asHsY9uT2tcJ2OEie1eT+mrW+lZrDQsz6NFl30j3zqzJJAEZmMcwu4tPKazWZgpsLqpYGshgJAuiBeflq3o8XLwg6KPpDoTQZUw5j44XwQD2wvPWOdcuEN6QdeuAuBJkhrwRgdYM5o5p7T77VdaQ0MBkNbJAdqLyQJw1QECDTHRnnZggTswSlj1LR6HDokq/P8A4dt9HNpLvTMPqhhbgBgLw1cc964PljZ7lttLRreXR72Pmu45F6RosuMcbj3F4cXHmuJgt52qLsRnih/LPkpabRbHvo0y5jmMN4kMZMEHnHXACZpkcnLg42va0efEQM+rzSaRljx1rv7D9GVY41a7GbQxpeY2AyAuksHICx0oc8OqEa3uut+62At3JCraOY+iqqfTVh6ppg4ZYO/FYeV1K7a6+9wd2tC9QZabNRFxhYwZXWAf2heffSDTi1z7VNh73BUi/wCgRe2cqQnhIpSti5u0OOe/3R4ouUK0N03+6PEoqlbPkdTG+Ags9jHMH2j/AFFaFnsZ5jev4isxguhJJJAIkxCdKFCFVoi4+TAunEZ9SEMcL7iGNbfdzAPV2Dbl2o1UZII2ghBahuh144xrwN5viDCzs6NaUlLZY/a47DjtBgwiFkHNEZSSO0rAzEZSTOOWsHxW2xvnmnPMcM/FZ1PTGchbjtGpMnhMmBEk1NWHMdwPgnYE9Xou4HwVX0H6C1qtLmMZdaHOeQ0SYAJGZVBsFWoCalQkZ3GcwYZgnMpaQfDbOf8AMZPZiUSD4M6skhLwLMx/orGM5jAGuu4xjMjWcfxVelumz3X/ABNWu0c1rsMCW9RvDuKx6VHPZ7r/AImqqe2VAmlPV6/JJLSZ6PX5JK4dHqViyf8AxHd5nzV9Wi17XMeJa4FrgdYIgoe+rRbeJtAZJkgVGgTr8AstTS1lGdr/ANX5LrnHKuSPJg2L0o9IXte4lrI5rWgw2ZxLogHgulDYwGS5s6dsQ/6k/wAx58Ejp6w/9yTxfUU02TTOlSXLO5SaP/euPD0hUTyl0ePWcfs1ENMPE6xIFcmeU+jz7X8t6R5TaO3n/wBblNMHFmnlpb3MpNYwwajiCR7IbJHXgO1cBQwvDeSBtBzgdSNcpdMWSsxjaAIqB7YJZdaQcHAnggAD3eplrvQTwwmFtQrIzUktoeiqZ0OEnqX0WVaDi682BqIxE9e3eqnsEAFhaARjEjDHMJqVdwxvGMemJH3m+a0MtRibsja0hw+a1tji3NtvTNaJZmMkkuUSqqWXSQRt1Ywu35DaYvXqDnyA2+yXAwJALBuEgwuDpscYPNmLxN32sduKZzDAdLJcQBhiJ2Y/mVyV/E3ryjr5Favr/paZ7fCxaS0aytdvBwLci0wd4K8hOkqrMG1ns1QKjx1EEzKJ6G0zbX1GU2V3lzpADyC2QJg3gVsrNnEngOKbTR6bZrKxgAY0YZHM9Z1rg/pLoRVov9qm5v3XT5rpNHP0gHtFZlG56zm9KN0HyQr6TKU06D4yqFvU5hPiFrBvYm48ZaPOnKKcpJkIQ0N03+6PEoqQhOhum/3W+JRcpSz5HUxvghlRY+g3gfEq8qiydBnBUGC4pkkkAjpEpJPIEk6kSFdWqGCT1DWeCw2iq58YBokTJkxwGRUX1Lzi/E6mDdtHEq9lmkS/E7NX4rSrHne9LopbkVY65Sfn8M91ojHHr18E7WtxiZzGBkcCni6AGt1kYZa1JrnHERHWtJ4VVOnNlK/Ubr9qqCZay1kQHtPvCPBamPDhIMobLiSIEeBzCvpvgh2QODvDxWd8Yw1KL2maY8pT3Ga019G8BJ45ruB8FJO7ou4HwKwfRprwa7Z0LMf8xnwojQEEt7OCG2+fR2cjO+yON1E2C828M8xx2HwSExWRGueY4bC3sviCsOlhz6fuO+JqIWkAsBG1ve9uCH6V+sZ7h+IKkQJHP6YGLOB8kldpNklvDz/BJaBB2l7IKVapTzDHkCc4zE9RWKUa5Wn9sr+8Pgagq7aOUuh5SlMkoWHTymSUAh5SlMkoEcOiDsIPYj7mzBBI1gj84oAidjr/AKrEiWgiOGScxbFGMkxe6uU5RcS2zDm9Z8Sq69mDi0yWwcYwJHFWUWw1o3K1eeuluxtHvMepKiKl+IwWi7TLTziJxEnBvmrKjWNa17BkQ5pbieorFWqXyTqOA3BdFpLk++mym+ixzqT2sfzAX3XFsuaW4wJxneunjOMampLyeYzrXPISjLS3o6Cx2rR9sbTFYBlVoxmad50c7njB0xtWTSlWy2C0MNGgHvAvEuqPIZOAu54kTiuVuPBaCJwyLHDtG1ZX0SLwuka4gjhEgbEm5t/Q1/minvltfh6foflhStD207j2PdOxzZAJ6Q+Sh9IFO9ZJ9mox3bIPiua5B6Ke6u2tdhjL0uIiXObhG3PUuu5aU5sdbcGu7HBbVt9s5mRCMJ6ieRuTAKVRRThiENDdN/ut8Si6EaG6b/db4lF0pZ8jrY3wRhtT6oJuNBbqMSd84hDqekH3QG3YAiSDj2o7Uy7Vzz6N10Y4gEYbQJhYy39DEUm9M3WG3Ekh7uBiMsxxWt9rYM3idgknuQgnEDLoiS06pJx1KYc6HkXdkg6h1daryZr7a/Qi3SDDkT913yWetWLyABzdTcp3u3KFnYLoc50YxGEYHh+ZWsOYyAMScYGJK6NGHySlJ6RzL82MG4wTbI0qEGSZPcPx3qVasG4azkPzlxSDHuz5g7XR4DvWRtnbLsASHHE4k6xiV06LKovhWcfIrun/AMlgnOMiNetXUzgN2CYKDGuiZg7MCErn4krkuI96Vnwx2+XQq4M83OMtsJmuwcN7o6indTOBmTI3YbglREtx1ku7SSFlHBk6eMu10bT9SgsjnDp+Asx4c0EZEJ3ZHgfArHYH5s2YjgSZHUVsdkeHkubKPHaZ0uSkto1Wt0UbOdj6RRWhgdz8R734jwQysP1NDCYdTJwnADErdSrsILL7Y9XECMcuIXPmLSLbUIG5zm9Rvju81g0p9Yz+GfiW81LzAJxDmz1OGPXmsGlfrB/D/vKpHsCA2kRzhw8ykrbU3nauiPFySuEycrx+2Wj3m/AxBUZ5W/4y0e+PgYgq7i6OUuhJyme8ASVie6cT1DUoE1urD84eKiK862/eWZtMA44nYpkkeyO9HRNmkP3dmITtMrKQcxB4YfgpU3TkceyTsdvU0TZoccETpWYMA5odrJOc7id6HUec5o2uHdj5I0E7j48bYvZjLJdM00R9Nta77pPeFF9UkENa4nIYEDrJVwKeVR+j172mx5//AEFzhx0gI3IcF7VyYdNksx/y2dwheN2qjddhk7EbjrHmvXuR7r1js/uR2EhK31OD4sTdnuLkGUxG5OEilwKb/SJQrlNSv2W0N203dwnyRQqu007zHt9prh2ghRdk29nhTlBWVBBjZh2YKsppdGoQ0L0n8G+JRdCdCjF/2R4osUrZ2dXG+CI1DgeB8FGiea3gPBPV6LuB8EqfRHAeCzRsO5Z32Nhk3GgnMjm+CvKZR6CZ22JgxBeOD3DzV1OiGzAxOZzJ4kqwJQrqyWtbM/bhvlryMsdobDp1Ow6x+HgtkKNWmHAtOvu3haUW+3NSM8ilWQcTCApSqWvOUEkYHiOKcud7Let3yC7f+upLyzg/4LnvSJVTzTwULM7MRDRg3GSIwxSeXRk3qM5Y5a1KzWV73lrJLjj7OEicdmuQkb85RsTXQ9R6dup8vD+i+y0yarA0gEkgzMYgnGATm0HJdHT0O92VSj993gWyhGi2Opy/0Lnw5zQ5pGBBIJDTnx8EUGmGTD2PZ77D4ri5F7nNuK8D8dxgop9Baz6Iqsa1oLH3QBg5wmOIhM+xP9ai48Gh47pWWzWqk8i48E7GuLT2AgrJbdIVWvc0VqgaA2BfOsScc0m/LKeTb+iU2uBuNa6dYLD2YSsWlB+sHuD4isr7U8iHVnkb6j/CVjdTZMlwne8/NTgWWzRUogmS0JLNNHWW9v4pI6LGbld/i6/vD4GIIjXK3/F1/eHwNQOo6AT2cV3V0cpdGau+86PVbnvKQGZ7FAYD87J8SrYxA2BHRBg06s9ZRKvoSvTYHvpODDjeMGPeEyBvRDkJo8Vape4S1nPg5XiYbPDE9S9IewOBBEhwIIORnMK8YbQvO7jLR4u5sYj/AHUKjPWHXvHzCJaVswp1qjBk15AnZmO4hYGZEcVXXnRsntbCGigHOL9gjrP4eKKSsei6RawTmecfLuhXWiqGNLjwA2nUF2aEoVrZz7W5zK7Ra2seJJwBJgTnktFN94TEbMj4INJOJxJxPH5IhoqzvLahYJYwNc5uJIBJBc0eIWMMtObT6Lyx3GOzVWpB7S09XEZLstAVrllpFtoLWQYBYyQ85tBgkwZHUuPaQcjPBROla1EBlNzmkvNQOEGOZcc0SNcz2qZcIyjyRWmT3xPX7C8upsc484sBcThjGMjUqLVpihT6dZjeLhPYF47arXaKvTfVfPtF0HqyVY0c8AEMOPBch1sdUUeoWnlrY2TD3PP/AIMd4kAILa/pEGVOzzve+P6Wg+K4YWOocbjuxM6yPGbHdisqkW0iFapec52AvOLoGQkkwO1VhXmyP9h3YUjZXjG47sKvosa9CjnP+z5oqUN0VTc1z7zSMGnHrRJKWfI6uP8ABEKp5ruB8EmDAcAo1+i7gfBWgZLMYIEpoVkJiFA6GCScBJQAyhVqBok/77hvUyYEnADMoc55e68cvVG7ad57kxj0O2WhbKyFTHf2VsYSOcTiSYBiJJMGM04ot9kdePirEl3YY1cV0edszLpve2RNFvsjsRXk879bdPqsIHC80j5dSGgojoAfrx7jh/U35pP1CiHstpaGMTInz03vYS0KZY4HW95G8Xz8kQuzIPV5ZrDods08M/SPI++5bmmRhgRluIzB/OteUl4Z2DOabL7CGND5cDAAwunuyWDSH1r+DPhROpBfTOuXD+koZbvrX8GfCogo520Wdr7TdeJbck6tQW1uiqIMFgxyJJz2ZrMXftTtzPIIvALfNaSbWtARl/4bS1MHf806t9IRgcPPekqbf6WB/K137ZaPfHwNQxlnvMqO2NIHHd1Jq9Wpaajnky95lxHNaMAMYyyR1lla1lwZXS3jIiV34xOS3o44nD87B8le3pdXmqXMguacwY7DHzVk5Hq/PWpoiO2+jt/NrN1gtPVzh2Yd67ULybQmlXWaqHgSDg5sxIOqds5Lprfy1FwtpMcHH1nxDd8DMrSMkkK2VyctoAcpKgfaaxGV+OwAeIQdmR4n5KdSocTmTPEknNPSol0gZASfl1mUILlNaGH/ADDyHmCBG7yUWWA1oeXlrQTdETO13bh1Kqpec4MbmcJ45nsBRqkwNaGgQAAAn756iooVqht8mD2aDbre7qACIWCyCiXFj3guADudEgcANqslOCkkkhptsGWqzejN5vQOYzuk6xuJzVfpbrg4Ec0gHgcCD29yJWroPkSLpnsKBuaCMWOwF04gTxxTKvioOMmZrHnKW4LZ0ZcmlZrC8uY2c4g8RgVel1r6NGmnpkpSBUUlCDykSmSKANmMvF9/2fAqV8bQr3NGwKNwbB2BYSp5PY9Xl8I8dGes8XXY6lbzvZPcrCBsHYnlBUL7JLNl9Iqh3sntCYh3s94VyUo+xEr/ALJlMO9nvCjJ9h3d81oVFsr3G4dJ2DeOs9SKoi3pAebNLbMVorXyW4hrelvds4BQTMaAIUiV16KY1xOVkXytltiVT6hxDBeOsjIcd60WegX4ukM7C75BVMgF0AAXnYDcY8ldWKUuKM+DUdsanlkRxjHsRPk9PpzsuEdYc0lDnOgd0bzgPFGdEsuPY3Yx8naZZJSXqU+NLihnDjuezZoaWsHsue/qN92vf4reRdM6j0vIrDov6sAyWuL+o3z2D5LdSMy05jXtGo/nevJS7O4RrMh7I13pG+6hdu+tfwb8KJgkPYDqvEHdHjJQ23/WP4M+FFBXYCYP2p3uDwCJDm8Cez8EMDL1qeNdwQdhgInTfIgjHIj86itJ/RByOBSUCbuEEjVw3pKhBmNDRAAA2AR4JwUxTr0pxzndPWMtf6QCWnpRqO/dvQym6ZB1rtYkLFaND0nzzbpzlhjHhkqSj+BTOaGwp4OU9uPei9XQZ9V4Pv4HtCpboKp7bAOt3kq8WX2DgIxzOr8EUo07gDZLXHFxzB6sjhh1qVTQ4YGuLy4hwwgAeatFQS5zsAMMchtx7OxKXWyhJKPhnVwKK7IOU1s0aMZL3OmYaBkBifwARZY9H0rrSSILzeI2agOwLVKdhKUopy8s5uQoKxqHRJNKZSVzAptjZY8bWnwQVoF10PjWMRrAwXQILXptZUIMAPEt7cR3pPLi2k0db0u2MZOL+zVolwhwGQIO3MT4hEEL0S6b3BvmiK2of8oVzElcyUpAqMpLYTJymJUUxKBCUppTSlKhB0yUpAoEFKUpiUwciEkhdapfeXahzW+Z6/JbLYTcfHsn89iH0nYQBEGExjxTltmFzaXgd7gBJ/PzWizWUmHPHus1De7ad2pVaOZfc5zsS3ojYTr7ETlXuue+KK1Vr5MUoPRMtB249uKK1ZLXAZkEDjGCEF4F3GAMCCQDlGPWhjySbbDcm0kjVZGS+dTR3nLsAKJMqFjw9sSARBmCDE8MkL0dWbfLQ4EOEjGcW+cFEyl8jVjaZtSnWkbG2qmekwsJzu4t7h3wtjHlwDmOa+NeRg6sEICa6JnI+0CQe0Ll2YSfxY7HI8+Q6XEvZzSIvTPAawShekPrHcG+Cela6jfWDxsfgfvN8ws9ptRc9xLHjBuQvDAaiElLGnF+UMRuiwOcLS8gwQwZ5EQJHYtz6rSA5rhI1bRradivD9YpunaGY9pSc46mP7Gj+5F1zf0HnH9Imu3akpC/7DvvN+aSnsT/AAHuR/StIBSTFd85Y4SSSUIJOnCTiBicNcqB1sxaScQGwMiXdgPzCqsNO+cRg3Fw2uOIHAZ9iotDy93Rw1CYMA+ZRHR7YYDiSZJnPOI6gEkkrLt/h2OUqMXXWzTKeU0pJ0478jpJgU6gBwh2lvUMYh3XkiCotVlD7smLpkYSMoxCzsjyi0b481CakwdZq/o3m+IBGrGMSRPai7HAiQZCGVNGuDYaZnpCIw3Y/JZWU6jJLGPG4YjrBS9blX/LQ9kV13bnBh0pKNNxIBIgkYjOCpEpvZy2tCSKZIlQAkwSlNKBByUpSlMoQRSSTKBHIkRtQIGGjnnUMQDrjMhHZQqs2L7MMJidhF4LC+yUI7i9HQ9Pprtk4zWx7E8Nfm4h4uyZzGLY1DWiZKF1Xc2Rng4dWI8ETVMa2U03It6jjRpkuK0mSCG2hkPdDQSYd3R5IgCslvwuuHunry7/ABWl/Lg9GOC4q5cjIXuBwbBBvDHDfq/Mowx8gHUce1CHlwIMDOM9qIWI8xu6R2GEtizbbTH/AFWmMUpRNMpApkpTxxCwFTa5VNKeVCFt5K8opIaRNk5SUQUkSbKE0pFJXAIFOohOoQdZrZRc8ACLusEkTsx8loUmoSW1ovF8GmgY3RzoiGgnXOI4YIkxgaA0ZDBTTOVIUqD2jW7KnakmNKdMnC0FxQnSCShBJBJJQjEUxTlMUWFCKYJ0yqAiSkkmQIOUySSgRJJJgoQYpBJyShB1it1MXwSAbzY62n5HuW0LHpLJvveRWGQtwY5gy1cjEykLgECZuz9qEYlAKFQy3H1x4o+VjiLw2Oeqvckv+hpUa1O8xw2jA7Dq706FW62va6A6MNg+Sbn8WcuHiSaJPe6GmBmNZwzW6xnmDfJ7TKHU3SBx/uKI2XoM90eCSxopTZ1/UZuVUWy4FTaVBO1PHELAnUQpKEJAp5UE6gCxJRSRJs//2Q=="],["Binary Trees","Invert it","data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAASsAAACpCAMAAABEdevhAAABlVBMVEX/////yqD/vo8AAAAAAP/b29unp6f5+fnHx8fOzs66urqtra3x8fGqqqq2trbW1tbAwMDr6+vl5eXq6v/ExMQ2NjbZ2dn09PT39/8fH//6+v//7Orh4eGfn5/S0tL/KCmbm5uDg4ONjY3/6vQmJiZpaWnj4///AAD/9/vKpox8fHz/9Oro6P/c3P/Bwf/Ozv//wt9PT09xcXH/7d0yMv+rq/+0tP9FRf+lpf//zeX/5vLt4NU9PT1eXl7/gQAbGxv/qWL/lC+Cgv94eP+Kiv9PT///ksj/1emf0J/Qsp6TPQDj0MKgVgD/tHgfHx//2r7/kCNvb//U1P//oFH/486ZmP//b2//U1P/1tZfX///eACcnP//stj/n88AkwDt+e19xH3R6tG23rbS6tIrqCtEr0T/c7r/hcKo1qhovGjAlHGhWhqweEqqay7Cl3Tcw6+2glqPMgD/mUD/u4T/QUH/uLb/mJf/gYH/2Nn/sLD/ZF//jY3YACb/NzeYophYWP+1xbW7p7GLzYvng83qye9Zt1n/a7blKuzgAAAVuklEQVR4nO1diV/buLYWJF4SO45tAmFx0iQQCqRACFvZCt1YSill6Q6lpDAtLdBe2s60M+++ubf38f7uK+/yFhviLMzk+7VEtiVZ+XzO0dGR5ADQQAMNNNBAAw000MDfDv0f+uP6UW6mdi2pf3ycWTkGYAZyRKzSYKWfq3WD6hgnYOYY9H/+3A9O+k9mTo/7a92gOsbHk4c58BGAhzMfwMzp6kqt21PPOAEfoEiJuvgBrDa4KgkoUiefNB2c+djQQWfkpP+ibQcz8UZH6AWrq7VuwdXBSkP3PKPBlXc0uPKOBlfe0eDKOxpceUeDK6+gT/tPTxteqDecPnjwudZtuCrIPXjQECuvOHUUq9zMzAwhRgKr2Zw6BkfiCdIhInr6+fQDDUD8pLpNqlMkcZEnLoSH7K6eigK1enx8DFaOj1cgdR+q3Lw6AoFH1SSWiFuv958cn+ROcrnj3AlY7V/9nPv8t9VGIoXykyEsGURfIncM4scz/WCmf+Vzf//fthfAjewkLBk+rMysEh9XV47Bw0+f+2eO46t/V66iSeOxQJpzrPb3n8ZnPqx8ArlP/Stg1TCf+LcCLv0V0uk0JZ+wCpaCODj+/DBXlUbVJ+iY9BHrIcOzGSlJ8g5ZP38CVmP2lwGHAyJNl8yCyyoXG4H/Z6Ukb1FCGbmHl25H7gpIY9scGIlAScGAAImzJY0MFEQ5IudTmYCsjnTYvrL+ywcimtcuXbRqwLID8PvP4Vm2wIJWju1ptaAnEAgUIFc9DKUYeZq1r+zh5S36rZf1L1hYIBAF2HymUOBG+BFAt2EWsIFAhpZ1UAFv67yDT5f31ptfvqx/wcLm+AAvzNJQ/UZm7c0Qk5XEhZ3VzsTsbfvJpZ2q3NnawlbdCxa0V6F5OpstpEAs4JBH9hQIfdyM22abufzImQBNzVegB4UyQxOAh5KSsqcAyp5J5aL2KvjhUxnNgFxdJaQdLTNl6B+JiG2m+MNyBOOKceUILjyA0EgMMLZRrJXTcu7xl+CKZyJkHEQ0tUsmAEFGGMGUrZ/4WJZtvvpcYRQekkWqDQ9jNC2wuOxiEaEI1Ybm/HByPFNObOGKc4VFqCRiguhkLJZEDBcRpSJaBBD0P3hwXI5gXWGuiKRJbuwhyp1M58o/ygsbX1WuCBKnMK+ZBQaPQTX9VOac9NXkisUZp5CLAzgGD5cb27t6XNFhnLnUt47DgmXtELhiXPEMzpYhHnEokGZPwjvqmaskhVMRnNI6MoHCybJj5EQIMXTQ7kfgTezHQxbUL1dCQpEALCHaJvi1kiXzXwBRXOpAuYTyGPhEtGR+BXXLFYvE6sIME/H0bbwjSlEMox+SjHNWDfXKVcgQpwp71JKLQKDQo2TMvUSdckVTxuOI/3N5pkkxD11knXJFKQMXTLFZtBcduRAYaShExOPqU3CcUNRQn1wRMjVt8609j2S2qFLZLwM5aIgHWlsfyZaRcQ1t1SdXmDzOm4cMpXqkZPKCfrobONk+JdJAjUtzDhOKOuqTq5ikIG3SlwhIhsT9m1wMUdnHSgxAGVYmf1xFtz65kodusVbxb0D6VrSHfuoiCMlyCnWwJ6DYwivKlSxXApQrng5IdqRScgV1kFImyq4oV4q9mi3Q2cCAlKyQvUrB2rF5+cwVtVdKPwiZai30SHJVoX6QgZ4CNyJJ8VXtB0FEb7hk2uO+c8WY15BcVf/K4rfjFffbqdKLlkTUKVcgabAerOdwsXfwhqFA0kPfUa9chVJonCHhsJiqHGApRHbJlMMSJBR1ylUsBISUMkkTTfFAsJ9zLwNRFnApJXyBJTDQ5v446pMrUvoS0UiEoiJy5IpO+btEJSrJEUbhFBOR91m4k1WXXJE2EVAC9/PNQ5iNyrmSVY9cxewjexEPE6ceEbW1Tm0uNqsOuSKdgqAxvyx81KEiF7Lqjys7BVQQ9ccjdabEXt5U1B1XJaiCPnzKhzuUIqQkWfXAFYGRMVIJFjsqoJI1oVh4PhQjMe9do0Bq2UvLjnrVrv7acxWnqCRH8yFKHLy6UAUhzRqGIyGe5qKMh4GJCIYSsycpKu5uwCWy7OuvOVdJdRoCxHEh5GFuKxziEtpXYDwMTQRt5yVBJe2cBSOiMV6rn6DQ+iWuckBdjKws5dp2b4FPYNF4J+W0ytgACh31Jl0neJJohxDLuNfPoK0IIfWLXOVuA7C2Lh0uyGQ9hv+JBfdqy4ZgDA170SnCSGjIZebeFLGIuY7CTQWQvgbhqnmrGTSD3MLWGri9trW9fmth1K3esmEOGrkHkSyL/F2KmC+7iq5pgytyLHF16/btW+vra2Br9IzYWidugcfb61u525XfUBFSnnJc3azsuOtPg7J/i0qlcBo94QB1f2qkkBYMJ5zAyQYNT6WUenlN9HW5aj5bWNg+g0QByBXIneXO3JpdPtSHTAXUOIJrPEEJ9fZkIgPzhKGSUtmzsyweELzcgZXnowOpxEirsZEyV49FrtYXwChkbatpHXJF5M6Ix5WXK7Xdsxl105GrZ64U6eHUmcPSReTs4owQoMJe7qBs7AlAQZ+V7bomtyJXxBf4uQ2gYOWaCeJL0y3wBeSaQdNZpe2VMgUBsFYQ4NGmloDylFtH5uazcpIt1SHI9TFz+hmXZaMyuUQAVppKG+u3+Ffra1tf3NrrF1Su0q3pQEpOeuWqhxXIedkb88KVOLXMycbRO1eZjLF+C1e57cr3fuaGzYfJiDxJ510HoRyOUO5F5Oy8qFIjCS93UHUQ2rmA/CwMOqhCIalyZmoQbGwaTiiTdKKxUhrm1bY/GimMtMaRSkpnzwTSI4pJdLlDWLHtc9n5AtpIYODqTPSnoP6dVYqs8TEwHLyBnpFHzLy0HlQy1CHXVcJKnx4lyahMQ+mlWYIyaoriStfvtL9eheIiJEkSM9wQqFzlmpvA+q0m0dVqHt1q+jIqnfEZg8EWyNew4ZwPvqiLc3lxX9R0HDH4ogDcXm9eG30MR4HE4/Xc1pem2+Bsu8nvjdCdvdZzpu2jXtbqm7ZROmxA1cAZxS7kukaXMxq0pF6/PHaGbudt0SOVFBD+uz16a2Frwa3Wy+HGOHqUQb9qOOxh5RBriI62uRq4EOrXhzyMnaMou23IzWSuHoPRMwNXOeiI+tsfvhhSEu3BIf0sGdVXSxORKJjLuEgWkZkDmD5jH/YwBRrVR3QM6WV+2al+WQebzs62iS0pdXt9IQe2xDO+uln3JrVk75iWFEN7dCSM0XEaY8RIXHZurqSpjmbnsqJfRkVhESHsbR6MoKg2MTsTob1NxjvUX61Y33i7zUklChpPsmFW7tWyWarU1yfIyJzkrRNtsTCb9BYVFbNH4R2SsrSEvKwQJNpYa/21iYvKVt4mYJzmCqWD6Jloutybhy67RLAqXLXcNZ3YEE/YxdZpafWYM4QB4FmYHOFFDe2gcZWrXNy4c/KJ+dTYhOM0RKFUCCvty7YcT2pohcZV08J2LjeaA+uQs9F1X133TbNYwc6w03Eaom3AuSahxLWL4HJqqHH15ax5/eXW+lnTQtP22frjSr84pcTkVsb5qfsjVuCSaqhxtd4MttfA6K21hYUvW2uP/dPIYdVdb4vgkQhOSSpGhm4EOx0K0FmnqIlfYgVUNeQpsUleF5WYuXoMcmCtycdYQ29QDi3wKeUNE2QiLkkV4nGZ4GjeM77ttpTUMJ6IyeqTTHja2Kvb9lsL63AEuHC2tQaTt3xz2icnpA90jYuyw3TCsYyDefdRrIC4Eg4ZvrBerD3iM8iyJL3Az8fhjaxpxp4n4uJuO7kFvi5G5gwjSbL2a2uVaJV5ebqiZHeMkb/qImU8rPma7XHFJpljQkr8bFiMaFkgZAZSBMUxYp+Xikd83lyiImyWbff1ARfn6gLexKDCRVwZDwe0skrDbg5ZysAxIQ2iNEZQbIwHGbotzgkxQdRiDPCsf8ZdagEnzktiAenJVWCPydOvX7/ZnLXN297b9bQLfiaVbkbnqtT8chpPEiDFM5lYAWTiKS6cJgsAj5AFotBG+eX3ya/U5AMjYixe6nccXhyJ4MJcPevquw5+/e0beP78165v8PPbj9++d13/9TkAXVb0Pb3+W5c2zaRzJagC0m7TG5KJLJfgqChI8CmRqyRIcXDEnAYDCd/2T8h74vjWHg7MjniaZL0MV9+fXwffnl/r+uPrtx9Pu752/f7H82vg+vcu0HfNiP+R/l6/fq1LFW+dK22GoCVoUUMohHgIF7nK0KJcMSGRK5oeAHGu4NfCbXmvJT+bwbG5gYpx9ezp975nT689/+M5+OPZ02fff+8CX8F1a8Z7f0rZr/3Qpy/1F14KmsAPjpn993Q6kwI4x6QzCWjbE5Jc0W3p1EB8IOUhBOwNslngW7GRDFOoGFfQAP14Cp4+/+Mb+PVX0AUgV/8E16wZb4rRva4fYlLZMAsCHE3LohXS7ZV1qEMo4oe6UzwWS/npYMl7LfkeMBuIF6Suh/Z/r6VorLv++fXZd9FCPX32tQvao9/Bj2s2Bl+Duuyn9dEjuc8xTmj2Oo0MEQiRsL/DebkfHAGRLEhLvLnXXyH/quWO4dA8wIsbgup3rTGbysPie9Zsr+XYK8MhZ1pPZlo7NzYOqg7TUkoQdvd5K8PV8IbpRMwQ9jBvnWy3m7ioNIwrkt3XJ1dtbiKGhlPCmQqNWy4EPoMIezTjYbV4JbjatIzyoK8UUheNCykBWF4EN9jhfzNKQ2CklkigEyEvYeUKcNUbHDSdwSWdY3GKYSJy7IoxO+DOkb/KQJB6lyQeYRgqIumfe1i5AlyNmT1xXFM5fRhoIau65l2wmd12nd2pAFdmQ63vCAHIb7iFL/8+xvJhR5X77I7vXJltleF3tmLIcM5is54MgyrBnipXNfSbq3GT3YkbfpIM5cpCln3krwJwospNsnzmyvx9aaPHFzM4y2ayxp1nK/yEM1UuZPnMVUsvdNKjoai6I9JAFY2lSB712FWykBIVAnKHUlTpaigWMHuBfusgEY6QAifEcLEfxlCqkni4jeNDFGWyWXIJTCphF/nzASwewziBlIbfpalSJItUChhfvOwrVy82BW11F5fgMCQiRGivhiUYZDjB8JhWgk9wndbIX/ngE6qA0DjGu+43DJG0NrVKG96V6ydX914Y1mZGEKmKo6/tQB+t4T0uEaHFceb+0sDQ+A/rIVgYRiMOJNI+P7l6ghnDCUjYI2W4oA9UeWMJPO47VXFj78K6DkXjxtW6rD7q91UHHdeSsybLrdmBlLUGnx2HC27NtL4iVy/gG1ctT0BSNkksAyGpnDakkR8VBs/LsqZuWkrKD41gMsoJSKq/kT95G4R0P3nQILith1clXd2ypG/O9I2rsZtqcD9QSKfTsnlSzkRlSjKz6fSALGGKnMsPPd6TpUb0l3zCmvyDLMG0OCsyaxO+tkLb1RVQOyO7/ThlYeiu1opHuhArZ5R5nIwuzorEydcz4tLirHwGctVi2LJTJuQ7SFyNxNQ7lIJ2uUc1VFpP5KO9UhWrpzAwkDLcWPmAcjWg0IVFkRIjLIjGQh42mV4Ccn10IJstBGSuPO0fBAhXzvsHL4VNMbagTjj0UDE2hLZU4yrLhhXlN3NFpeeRzYAtHb51hypXyVC0tTyucgtf1nx4s0BvsFdvF6qDyhl1E19KuxDiketpcaNeK4Oc8S/y54MOqpNhay9fLpTfoA7Z21aMoGjbB2ikpequwLTuCCotUn4GNlCIjAQotI6bqmAN2o167nQoMz+D4hzIcKlVXPJiEQ6x7S5rhzSxs9j23MuXPqzhU6J7isEmWZaVn4XS/6m6hulxBYVE5Yc6CSoT4qRk0hh6GHxhF6cZvwPah8AwaBkcfDExAe5uDN0YHGrpfTUMu5hXpvyYNEghRJpki8i5RD+1lRbqT6boey3XFkoX9QA9Duro95mXAmmOl9kzTGmpm/Cb3w0Gg2MdFgQ7bm6ClkkwfPdGcPz+0J2NoYngvYn7my+GX90bGjPVeOG9luYCum+aK1usxu9ryaRxKRmrCQlhbID+yhbT1ke9hLTbt328I9jbYsXgq8mN9vtg807vBhi+MzEOJl6BibG798fvb2yMmULYvHHiz21rpmXYhfn4MnRDdI9BvzqJ3FRAHycaAPw3OsmKDlTBuDR1/cpmzmKwBbSMtU+CIZGr8VfjN8HEEzCxATo7729ah0gx9MtG/7fkl5ELoGQJ7ksjvaPFYFlZ/T4UuZvv0++pz1BEkdtP7RhKeLvlxNifk0NgY3Ly3o2OF5PtvWN3h16Bzo0/J4cHJ19Ye1BS7/nY8MFPt9rfHvxLNxkx338TBAGPsxwBCE7cpriziLBFMBQm/p5uCAkJLe0u7uglLCu5O52CWZ0tYjfZIqWANsUvfdiNvGk8zIt3YHEeHL4+2C/5Bd6/fr1HU4xUIIb7Odm0Ye2v6VA4HJZ+lTO/uDvdh1xpY//NoLMT3VO7i3lDCSM6g36FSePiHUhRso9eHxy9LZHz5wHkSvwdSLWAb7h3X3yc4vNsb+9Uk53iQ++EyaX8zrSSVDLsLHWqSfFs325+Skx2Gs5qyc7eoO+LQo7eHJTOUDw82PP7piKGgtDy3g8GO6GFD74Skx3tYvIJAC+CwfbuzbH/wORGEHZpg8HgXdC9+B/o4beISXAnGOzd+b+OP19AxoPBTdAeDMLkk2BwGLR3BP+EVh0m/V8/8x78fFMyw8H+fkW4csfSDnq0s7i45HixWiBel9LB4mHVGmLBzpSe7s7vTOX1w77FPmv+KqAkHQeliKw0druRg/w0crCzZM5bJRwWHS/VUqygMO0iB3mEnuldS94qYe+14yUXh6LSmEKsEspVjTRQhKN5r61YAYOuIVyhhqzqcDLvNRYraMN1VpZ045W3y1otFO0tFuE6AGqgTtCXz3f3iTI0Pd0tfixNu5WoJN4a3MziuUkVizVVwelf8vl304tialrq+HZk3evT/lQVy+/FvyJhewTYO9gj1EMpQfwsKher3jARkp/e/f+Lv3Qv5aH3sLj4y9LUu3dLu7vv+vLv3r2rdnNErojzo0Pi5/lh8f3rc0jRm4PDI7B8CK36+flBce/w6AgcnVdmSOiCd6Ixh3KVzy/tdO8u7YL8FPQhliBb+XxevlpNiFy9Py+evyfeQ04kB+FoHxzsHYC9w7eQsuKbN8WD/de1GRFKciVzBeUKjnAgV3kwtbi01AedhsVacLX8Zr+4d1DcV7l6Cw7fHgLioLgMuTpaLu4Tb3/WRK5Ee7WoyNX0bvcvU79MQXnqg3+XasLV+fLy/kHx5/7r4tE5kKIz0L4fgMP3b37uHbw/KBYP4cU3+4c1GRV2i/3gNOju7hM/lvJLfd3d4tkp8XO62tZ9r1gsEnvL8P/P/X0g9XpQ3/YBsQyt+v4yTL+FqeJyrV3SBhpooIEGGmjgr47/Asv7V380O0zKAAAAAElFTkSuQmCC"],["Binary Search Tree","Im sorted, maybe not","https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcTuxHUd9tr8e34lAVqoRTqNd6I8DGyOWzIMLQ&usqp=CAU"],["Greedy","Not too greedy","https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcTIWYHDBUbI1QYC4zRID8f_nLr5XGbdQ4fKRQ&usqp=CAU"],["Stacks & Queues","PUSH and POP thats it","https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcSjvdnyeEiPh4-qyeb6IWP7tihuic1sLsm-vg&usqp=CAU"],["Graph","Easier than they seem","https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcTW1hZhGH_Dm2IJJVhL8Bs4t_xdnlCivpkM9w&usqp=CAU"],["Dynamic Programming","Everyone hates it","https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcRn1NuBgwrX3_6eI-83di7dqJepE9Vx1GMCNQ&usqp=CAU"],["Bit Manipulation","1 and 0","https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcQlkRBlCwjKA0q-0ynCm46333Ryo0iDP02Rew&usqp=CAU"]]; + return render_template('index.html',tagline=tagline) + + +@app.route('/problems/',methods=['GET','POST']) +def arrays(category): + cursor = mysql.connection.cursor(); + + statement = f'SELECT * FROM dsa where topic LIKE "{category}"' + cursor.execute(statement) + data = cursor.fetchall() + return render_template('problem.html',data=data,category=category) + + + +if __name__ == '__main__': + app.run(debug=True) diff --git a/dsa-tracker/problem_database.csv b/dsa-tracker/problem_database.csv new file mode 100644 index 00000000..40371970 --- /dev/null +++ b/dsa-tracker/problem_database.csv @@ -0,0 +1,428 @@ +topic,name,url, +Array,Reverse the array,https://practice.geeksforgeeks.org/problems/reverse-a-string/1, +Array,Find the maximum and minimum element in an array,https://www.geeksforgeeks.org/maximum-and-minimum-in-an-array/, +Array,"Find the ""Kth"" max and min element of an array ",https://practice.geeksforgeeks.org/problems/kth-smallest-element/0, +Array,"Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo",https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s4231/1, +Array,Move all the negative elements to one side of the array ,https://www.geeksforgeeks.org/move-negative-numbers-beginning-positive-end-constant-extra-space/, +Array,Find the Union and Intersection of the two sorted arrays.,https://practice.geeksforgeeks.org/problems/union-of-two-arrays/0, +Array,Write a program to cyclically rotate an array by one.,https://practice.geeksforgeeks.org/problems/cyclically-rotate-an-array-by-one/0, +Array,find Largest sum contiguous Subarray [V. IMP],https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0, +Array,Minimise the maximum difference between heights [V.IMP],https://practice.geeksforgeeks.org/problems/minimize-the-heights3351/1, +Array,Minimum no. of Jumps to reach end of an array,https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps/0, +Array,find duplicate in an array of N+1 Integers,https://leetcode.com/problems/find-the-duplicate-number/, +Array,Merge 2 sorted arrays without using Extra space.,https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays5135/1, +Array,Kadane's Algo [V.V.V.V.V IMP],https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0, +Array,Merge Intervals,https://leetcode.com/problems/merge-intervals/, +Array,Next Permutation,https://leetcode.com/problems/next-permutation/, +Array,Count Inversion,https://practice.geeksforgeeks.org/problems/inversion-of-array/0, +Array,Best time to buy and Sell stock,https://leetcode.com/problems/best-time-to-buy-and-sell-stock/, +Array,find all pairs on integer array whose sum is equal to given number,https://practice.geeksforgeeks.org/problems/count-pairs-with-given-sum5022/1, +Array,find common elements In 3 sorted arrays,https://practice.geeksforgeeks.org/problems/common-elements1132/1, +Array,Rearrange the array in alternating positive and negative items with O(1) extra space,https://www.geeksforgeeks.org/rearrange-array-alternating-positive-negative-items-o1-extra-space/, +Array,Find if there is any subarray with sum equal to 0,https://practice.geeksforgeeks.org/problems/subarray-with-0-sum/0, +Array,Find factorial of a large number,https://practice.geeksforgeeks.org/problems/factorials-of-large-numbers/0, +Array,find maximum product subarray ,https://practice.geeksforgeeks.org/problems/maximum-product-subarray3604/1, +Array,Find longest coinsecutive subsequence,https://practice.geeksforgeeks.org/problems/longest-consecutive-subsequence/0, +Array,"Given an array of size n and a number k, fin all elements that appear more than "" n/k "" times.",https://www.geeksforgeeks.org/given-an-array-of-of-size-n-finds-all-the-elements-that-appear-more-than-nk-times/, +Array,Maximum profit by buying and selling a share atmost twice,https://www.geeksforgeeks.org/maximum-profit-by-buying-and-selling-a-share-at-most-twice/, +Array,Find whether an array is a subset of another array,https://practice.geeksforgeeks.org/problems/array-subset-of-another-array/0, +Array,Find the triplet that sum to a given value,https://practice.geeksforgeeks.org/problems/triplet-sum-in-array/0, +Array,Trapping Rain water problem,https://practice.geeksforgeeks.org/problems/trapping-rain-water/0, +Array,Chocolate Distribution problem,https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0, +Array,Smallest Subarray with sum greater than a given value,https://practice.geeksforgeeks.org/problems/smallest-subarray-with-sum-greater-than-x/0, +Array,Three way partitioning of an array around a given value,https://practice.geeksforgeeks.org/problems/three-way-partitioning/1, +Array,Minimum swaps required bring elements less equal K together,https://practice.geeksforgeeks.org/problems/minimum-swaps-required-to-bring-all-elements-less-than-or-equal-to-k-together/0, +Array,Minimum no. of operations required to make an array palindrome,https://practice.geeksforgeeks.org/problems/palindromic-array/0, +Array,Median of 2 sorted arrays of equal size,https://practice.geeksforgeeks.org/problems/find-the-median0527/1, +Array,Median of 2 sorted arrays of different size,https://www.geeksforgeeks.org/median-of-two-sorted-arrays-of-different-sizes/, +Matrix,Spiral traversal on a Matrix,https://practice.geeksforgeeks.org/problems/spirally-traversing-a-matrix/0, +Matrix,Search an element in a matriix,https://leetcode.com/problems/search-a-2d-matrix/, +Matrix,Find median in a row wise sorted matrix,https://practice.geeksforgeeks.org/problems/median-in-a-row-wise-sorted-matrix1527/1, +Matrix,Find row with maximum no. of 1's,https://practice.geeksforgeeks.org/problems/row-with-max-1s0023/1, +Matrix,Print elements in sorted order using row-column wise sorted matrix,https://practice.geeksforgeeks.org/problems/sorted-matrix/0, +Matrix,Maximum size rectangle,https://practice.geeksforgeeks.org/problems/max-rectangle/1, +Matrix,Find a specific pair in matrix,https://www.geeksforgeeks.org/find-a-specific-pair-in-matrix/, +Matrix,Rotate matrix by 90 degrees,https://www.geeksforgeeks.org/rotate-a-matrix-by-90-degree-in-clockwise-direction-without-using-any-extra-space/, +Matrix,Kth smallest element in a row-cpumn wise sorted matrix,https://practice.geeksforgeeks.org/problems/kth-element-in-matrix/1, +Matrix,Common elements in all rows of a given matrix,https://www.geeksforgeeks.org/common-elements-in-all-rows-of-a-given-matrix/, +String,Reverse a String,https://leetcode.com/problems/reverse-string/, +String,Check whether a String is Palindrome or not,https://practice.geeksforgeeks.org/problems/palindrome-string0817/1, +String,Find Duplicate characters in a string,https://www.geeksforgeeks.org/print-all-the-duplicates-in-the-input-string/, +String,Write a Code to check whether one string is a rotation of another,https://www.geeksforgeeks.org/a-program-to-check-if-strings-are-rotations-of-each-other/, +String,Write a Program to check whether a string is a valid shuffle of two strings or not,https://www.programiz.com/java-programming/examples/check-valid-shuffle-of-strings, +String,Count and Say problem,https://leetcode.com/problems/count-and-say/, +String,Write a program to find the longest Palindrome in a string.[ Longest palindromic Substring],https://practice.geeksforgeeks.org/problems/longest-palindrome-in-a-string/0, +String,Find Longest Recurring Subsequence in String,https://practice.geeksforgeeks.org/problems/longest-repeating-subsequence/0, +String,Print all Subsequences of a string.,https://www.geeksforgeeks.org/print-subsequences-string/, +String,Print all the permutations of the given string,https://practice.geeksforgeeks.org/problems/permutations-of-a-given-string/0, +String,Split the Binary string into two substring with equal 0’s and 1’s,https://www.geeksforgeeks.org/split-the-binary-string-into-substrings-with-equal-number-of-0s-and-1s/, +String,Word Wrap Problem [VERY IMP].,https://practice.geeksforgeeks.org/problems/word-wrap/0, +String,EDIT Distance [Very Imp],https://practice.geeksforgeeks.org/problems/edit-distance3702/1, +String,Find next greater number with same set of digits. [Very Very IMP],https://practice.geeksforgeeks.org/problems/next-permutation/0, +String,Balanced Parenthesis problem.[Imp],https://practice.geeksforgeeks.org/problems/parenthesis-checker/0, +String,Word break Problem[ Very Imp],https://practice.geeksforgeeks.org/problems/word-break/0, +String,Rabin Karp Algo,https://www.geeksforgeeks.org/rabin-karp-algorithm-for-pattern-searching/, +String,KMP Algo,https://practice.geeksforgeeks.org/problems/longest-prefix-suffix2527/1, +String,Convert a Sentence into its equivalent mobile numeric keypad sequence.,https://www.geeksforgeeks.org/convert-sentence-equivalent-mobile-numeric-keypad-sequence/, +String,Minimum number of bracket reversals needed to make an expression balanced.,https://practice.geeksforgeeks.org/problems/count-the-reversals/0, +String,Count All Palindromic Subsequence in a given String.,https://practice.geeksforgeeks.org/problems/count-palindromic-subsequences/1, +String,Count of number of given string in 2D character array,https://www.geeksforgeeks.org/find-count-number-given-string-present-2d-character-array/, +String,Search a Word in a 2D Grid of characters.,https://practice.geeksforgeeks.org/problems/find-the-string-in-grid/0, +String,Boyer Moore Algorithm for Pattern Searching.,https://www.geeksforgeeks.org/boyer-moore-algorithm-for-pattern-searching/, +String,Converting Roman Numerals to Decimal,https://practice.geeksforgeeks.org/problems/roman-number-to-integer/0, +String,Longest Common Prefix,https://leetcode.com/problems/longest-common-prefix/, +String,Number of flips to make binary string alternate,https://practice.geeksforgeeks.org/problems/min-number-of-flips/0, +String,Find the first repeated word in string.,https://practice.geeksforgeeks.org/problems/second-most-repeated-string-in-a-sequence/0, +String,Minimum number of swaps for bracket balancing.,https://practice.geeksforgeeks.org/problems/minimum-swaps-for-bracket-balancing/0, +String,Find the longest common subsequence between two strings.,https://practice.geeksforgeeks.org/problems/longest-common-subsequence/0, +String,Program to generate all possible valid IP addresses from given string.,https://www.geeksforgeeks.org/program-generate-possible-valid-ip-addresses-given-string/, +String,Write a program tofind the smallest window that contains all characters of string itself.,https://practice.geeksforgeeks.org/problems/smallest-distant-window/0, +String,Rearrange characters in a string such that no two adjacent are same,https://practice.geeksforgeeks.org/problems/rearrange-characters/0, +String,Minimum characters to be added at front to make string palindrome,https://www.geeksforgeeks.org/minimum-characters-added-front-make-string-palindrome/, +String,"Given a sequence of words, print all anagrams together",https://practice.geeksforgeeks.org/problems/k-anagrams-1/0, +String,Find the smallest window in a string containing all characters of another string,https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0, +String,Recursively remove all adjacent duplicates,https://practice.geeksforgeeks.org/problems/consecutive-elements/0, +String,String matching where one string contains wildcard characters,https://practice.geeksforgeeks.org/problems/wildcard-string-matching/0, +String,Function to find Number of customers who could not get a computer,https://www.geeksforgeeks.org/function-to-find-number-of-customers-who-could-not-get-a-computer/, +String,Transform One String to Another using Minimum Number of Given Operation,https://www.geeksforgeeks.org/transform-one-string-to-another-using-minimum-number-of-given-operation/, +String,Check if two given strings are isomorphic to each other,https://practice.geeksforgeeks.org/problems/isomorphic-strings/0, +String,Recursively print all sentences that can be formed from list of word lists,https://www.geeksforgeeks.org/recursively-print-all-sentences-that-can-be-formed-from-list-of-word-lists/, +Searching & Sorting,Find first and last positions of an element in a sorted array,https://practice.geeksforgeeks.org/problems/first-and-last-occurrences-of-x/0, +Searching & Sorting,Find a Fixed Point (Value equal to index) in a given array,https://practice.geeksforgeeks.org/problems/value-equal-to-index-value1330/1, +Searching & Sorting,Search in a rotated sorted array,https://leetcode.com/problems/search-in-rotated-sorted-array/, +Searching & Sorting,square root of an integer,https://practice.geeksforgeeks.org/problems/count-squares3649/1, +Searching & Sorting,Maximum and minimum of an array using minimum number of comparisons,https://practice.geeksforgeeks.org/problems/middle-of-three2926/1, +Searching & Sorting,Optimum location of point to minimize total distance,https://www.geeksforgeeks.org/optimum-location-point-minimize-total-distance/, +Searching & Sorting,Find the repeating and the missing,https://practice.geeksforgeeks.org/problems/find-missing-and-repeating2512/1, +Searching & Sorting,find majority element,https://practice.geeksforgeeks.org/problems/majority-element/0, +Searching & Sorting,Searching in an array where adjacent differ by at most k,https://www.geeksforgeeks.org/searching-array-adjacent-differ-k/, +Searching & Sorting,find a pair with a given difference,https://practice.geeksforgeeks.org/problems/find-pair-given-difference/0, +Searching & Sorting,find four elements that sum to a given value,https://practice.geeksforgeeks.org/problems/find-all-four-sum-numbers/0, +Searching & Sorting,maximum sum such that no 2 elements are adjacent,https://practice.geeksforgeeks.org/problems/stickler-theif/0, +Searching & Sorting,Count triplet with sum smaller than a given value,https://practice.geeksforgeeks.org/problems/count-triplets-with-sum-smaller-than-x5549/1, +Searching & Sorting,merge 2 sorted arrays,https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays5135/1, +Searching & Sorting,print all subarrays with 0 sum,https://practice.geeksforgeeks.org/problems/zero-sum-subarrays/0, +Searching & Sorting,Product array Puzzle,https://practice.geeksforgeeks.org/problems/product-array-puzzle/0, +Searching & Sorting,Sort array according to count of set bits,https://practice.geeksforgeeks.org/problems/sort-by-set-bit-count/0, +Searching & Sorting,minimum no. of swaps required to sort the array,https://practice.geeksforgeeks.org/problems/minimum-swaps/1, +Searching & Sorting,Bishu and Soldiers,https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/bishu-and-soldiers/, +Searching & Sorting,Rasta and Kheshtak,https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/rasta-and-kheshtak/, +Searching & Sorting,Kth smallest number again,https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/kth-smallest-number-again-2/, +Searching & Sorting,Find pivot element in a sorted array,http://theoryofprogramming.com/2017/12/16/find-pivot-element-sorted-rotated-array/, +Searching & Sorting,K-th Element of Two Sorted Arrays,https://practice.geeksforgeeks.org/problems/k-th-element-of-two-sorted-array/0, +Searching & Sorting,Aggressive cows,https://www.spoj.com/problems/AGGRCOW/, +Searching & Sorting,Book Allocation Problem,https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages/0, +Searching & Sorting,EKOSPOJ:,https://www.spoj.com/problems/EKO/, +Searching & Sorting,Job Scheduling Algo,https://www.geeksforgeeks.org/weighted-job-scheduling-log-n-time/, +Searching & Sorting,Missing Number in AP,https://practice.geeksforgeeks.org/problems/arithmetic-number/0, +Searching & Sorting,Smallest number with atleastn trailing zeroes infactorial,https://practice.geeksforgeeks.org/problems/smallest-factorial-number5929/1, +Searching & Sorting,Painters Partition Problem:,https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages/0, +Searching & Sorting,ROTI-Prata SPOJ,https://www.spoj.com/problems/PRATA/, +Searching & Sorting,DoubleHelix SPOJ,https://www.spoj.com/problems/ANARC05B/, +Searching & Sorting,Subset Sums,https://www.spoj.com/problems/SUBSUMS/, +Searching & Sorting,Findthe inversion count,https://practice.geeksforgeeks.org/problems/inversion-of-array/0, +Searching & Sorting,Implement Merge-sort in-place,https://www.geeksforgeeks.org/in-place-merge-sort/, +Searching & Sorting,Partitioning and Sorting Arrays with Many Repeated Entries,https://www.baeldung.com/java-sorting-arrays-with-repeated-entries, +LinkedList,Write a Program to reverse the Linked List. (Both Iterative and recursive),https://www.geeksforgeeks.org/reverse-a-linked-list/, +LinkedList,Reverse a Linked List in group of Given Size. [Very Imp],https://practice.geeksforgeeks.org/problems/reverse-a-linked-list-in-groups-of-given-size/1, +LinkedList,Write a program to Detect loop in a linked list.,https://practice.geeksforgeeks.org/problems/detect-loop-in-linked-list/1, +LinkedList,Write a program to Delete loop in a linked list.,https://practice.geeksforgeeks.org/problems/remove-loop-in-linked-list/1, +LinkedList,Find the starting point of the loop. ,https://www.geeksforgeeks.org/find-first-node-of-loop-in-a-linked-list/, +LinkedList,Remove Duplicates in a sorted Linked List.,https://practice.geeksforgeeks.org/problems/remove-duplicate-element-from-sorted-linked-list/1, +LinkedList,Remove Duplicates in a Un-sorted Linked List.,https://practice.geeksforgeeks.org/problems/remove-duplicates-from-an-unsorted-linked-list/1, +LinkedList,Write a Program to Move the last element to Front in a Linked List.,https://www.geeksforgeeks.org/move-last-element-to-front-of-a-given-linked-list/, +LinkedList,Add “1” to a number represented as a Linked List.,https://practice.geeksforgeeks.org/problems/add-1-to-a-number-represented-as-linked-list/1, +LinkedList,Add two numbers represented by linked lists.,https://practice.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-lists/1, +LinkedList,Intersection of two Sorted Linked List.,https://practice.geeksforgeeks.org/problems/intersection-of-two-sorted-linked-lists/1, +LinkedList,Intersection Point of two Linked Lists.,https://practice.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1, +LinkedList,Merge Sort For Linked lists.[Very Important],https://practice.geeksforgeeks.org/problems/sort-a-linked-list/1, +LinkedList,Quicksort for Linked Lists.[Very Important],https://practice.geeksforgeeks.org/problems/quick-sort-on-linked-list/1, +LinkedList,Find the middle Element of a linked list.,https://leetcode.com/problems/middle-of-the-linked-list/, +LinkedList,Check if a linked list is a circular linked list,https://practice.geeksforgeeks.org/problems/circular-linked-list/1, +LinkedList,Split a Circular linked list into two halves.,https://practice.geeksforgeeks.org/problems/split-a-circular-linked-list-into-two-halves/1, +LinkedList,Write a Program to check whether the Singly Linked list is a palindrome or not.,https://practice.geeksforgeeks.org/problems/check-if-linked-list-is-pallindrome/1, +LinkedList,Deletion from a Circular Linked List.,https://www.geeksforgeeks.org/deletion-circular-linked-list/, +LinkedList,Reverse a Doubly Linked list.,https://practice.geeksforgeeks.org/problems/reverse-a-doubly-linked-list/1, +LinkedList,Find pairs with a given sum in a DLL.,https://www.geeksforgeeks.org/find-pairs-given-sum-doubly-linked-list/, +LinkedList,Count triplets in a sorted DLL whose sum is equal to given value “X”.,https://www.geeksforgeeks.org/count-triplets-sorted-doubly-linked-list-whose-sum-equal-given-value-x/, +LinkedList,Sort a “k”sorted Doubly Linked list.[Very IMP],https://www.geeksforgeeks.org/sort-k-sorted-doubly-linked-list/, +LinkedList,Rotate DoublyLinked list by N nodes.,https://www.geeksforgeeks.org/rotate-doubly-linked-list-n-nodes/, +LinkedList,Rotate a Doubly Linked list in group of Given Size.[Very IMP],https://www.geeksforgeeks.org/reverse-doubly-linked-list-groups-given-size/, +LinkedList,Flatten a Linked List,https://practice.geeksforgeeks.org/problems/flattening-a-linked-list/1, +LinkedList,"Sort a LL of 0's, 1's and 2's",https://practice.geeksforgeeks.org/problems/given-a-linked-list-of-0s-1s-and-2s-sort-it/1, +LinkedList,Clone a linked list with next and random pointer,https://practice.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1, +LinkedList,Merge K sorted Linked list,https://practice.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1, +LinkedList,Multiply 2 no. represented by LL,https://practice.geeksforgeeks.org/problems/multiply-two-linked-lists/1, +LinkedList,Delete nodes which have a greater value on right side,https://practice.geeksforgeeks.org/problems/delete-nodes-having-greater-value-on-right/1, +LinkedList,Segregate even and odd nodes in a Linked List,https://practice.geeksforgeeks.org/problems/segregate-even-and-odd-nodes-in-a-linked-list/0, +LinkedList,Program for n’th node from the end of a Linked List,https://practice.geeksforgeeks.org/problems/nth-node-from-end-of-linked-list/1, +LinkedList,Find the first non-repeating character from a stream of characters,https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream/0, +Binary Trees,level order traversal,https://practice.geeksforgeeks.org/problems/level-order-traversal/1, +Binary Trees,Reverse Level Order traversal,https://practice.geeksforgeeks.org/problems/reverse-level-order-traversal/1, +Binary Trees,Height of a tree,https://practice.geeksforgeeks.org/problems/height-of-binary-tree/1, +Binary Trees,Diameter of a tree,https://practice.geeksforgeeks.org/problems/diameter-of-binary-tree/1, +Binary Trees,Mirror of a tree,https://www.geeksforgeeks.org/create-a-mirror-tree-from-the-given-binary-tree/, +Binary Trees,Inorder Traversal of a tree both using recursion and Iteration,https://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/, +Binary Trees,Preorder Traversal of a tree both using recursion and Iteration,https://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/, +Binary Trees,Postorder Traversal of a tree both using recursion and Iteration,https://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/, +Binary Trees,Left View of a tree,https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1, +Binary Trees,Right View of Tree,https://practice.geeksforgeeks.org/problems/right-view-of-binary-tree/1, +Binary Trees,Top View of a tree,https://practice.geeksforgeeks.org/problems/top-view-of-binary-tree/1, +Binary Trees,Bottom View of a tree,https://practice.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1, +Binary Trees,Zig-Zag traversal of a binary tree,https://practice.geeksforgeeks.org/problems/zigzag-tree-traversal/1, +Binary Trees,Check if a tree is balanced or not,https://practice.geeksforgeeks.org/problems/check-for-balanced-tree/1, +Binary Trees,Diagnol Traversal of a Binary tree,https://www.geeksforgeeks.org/diagonal-traversal-of-binary-tree/, +Binary Trees,Boundary traversal of a Binary tree,https://practice.geeksforgeeks.org/problems/boundary-traversal-of-binary-tree/1, +Binary Trees,Construct Binary Tree from String with Bracket Representation,https://www.geeksforgeeks.org/construct-binary-tree-string-bracket-representation/, +Binary Trees,Convert Binary tree into Doubly Linked List,https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1, +Binary Trees,Convert Binary tree into Sum tree,https://practice.geeksforgeeks.org/problems/transform-to-sum-tree/1, +Binary Trees,Construct Binary tree from Inorder and preorder traversal,https://practice.geeksforgeeks.org/problems/construct-tree-1/1, +Binary Trees,Find minimum swaps required to convert a Binary tree into BST,https://www.geeksforgeeks.org/minimum-swap-required-convert-binary-tree-binary-search-tree/, +Binary Trees,Check if Binary tree is Sum tree or not,https://practice.geeksforgeeks.org/problems/sum-tree/1, +Binary Trees,Check if all leaf nodes are at same level or not,https://practice.geeksforgeeks.org/problems/leaf-at-same-level/1, +Binary Trees,Check if a Binary Tree contains duplicate subtrees of size 2 or more [ IMP ],https://practice.geeksforgeeks.org/problems/duplicate-subtree-in-binary-tree/1, +Binary Trees,Check if 2 trees are mirror or not,https://practice.geeksforgeeks.org/problems/check-mirror-in-n-ary-tree/0, +Binary Trees,Sum of Nodes on the Longest path from root to leaf node ,https://practice.geeksforgeeks.org/problems/sum-of-the-longest-bloodline-of-a-tree/1, +Binary Trees,Check if given graph is tree or not. [ IMP ] ,https://www.geeksforgeeks.org/check-given-graph-tree/, +Binary Trees,Find Largest subtree sum in a tree,https://www.geeksforgeeks.org/find-largest-subtree-sum-tree/, +Binary Trees,Maximum Sum of nodes in Binary tree such that no two are adjacent ,https://www.geeksforgeeks.org/maximum-sum-nodes-binary-tree-no-two-adjacent/, +Binary Trees,"Print all ""K"" Sum paths in a Binary tree",https://www.geeksforgeeks.org/print-k-sum-paths-binary-tree/, +Binary Trees,Find LCA in a Binary tree,https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-binary-tree/1, +Binary Trees,Find distance between 2 nodes in a Binary tree,https://practice.geeksforgeeks.org/problems/min-distance-between-two-given-nodes-of-a-binary-tree/1, +Binary Trees,Kth Ancestor of node in a Binary tree,https://www.geeksforgeeks.org/kth-ancestor-node-binary-tree-set-2/, +Binary Trees,Find all Duplicate subtrees in a Binary tree [ IMP ],https://practice.geeksforgeeks.org/problems/duplicate-subtrees/1, +Binary Trees,Tree Isomorphism Problem,https://practice.geeksforgeeks.org/problems/check-if-tree-is-isomorphic/1, +Binary Search Trees,Find a value in a BST,https://www.geeksforgeeks.org/binary-search-tree-set-1-search-and-insertion/, +Binary Search Trees,Deletion of a node in a BST,https://leetcode.com/problems/delete-node-in-a-bst/, +Binary Search Trees,Find min and max value in a BST,https://practice.geeksforgeeks.org/problems/minimum-element-in-bst/1, +Binary Search Trees,Find inorder successor and inorder predecessor in a BST,https://practice.geeksforgeeks.org/problems/predecessor-and-successor/1, +Binary Search Trees,Check if a tree is a BST or not ,https://practice.geeksforgeeks.org/problems/check-for-bst/1, +Binary Search Trees,Populate Inorder successor of all nodes,https://practice.geeksforgeeks.org/problems/populate-inorder-successor-for-all-nodes/1, +Binary Search Trees,Find LCA of 2 nodes in a BST,https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-bst/1, +Binary Search Trees,Construct BST from preorder traversal,https://www.geeksforgeeks.org/construct-bst-from-given-preorder-traversa/, +Binary Search Trees,Convert Binary tree into BST,https://practice.geeksforgeeks.org/problems/binary-tree-to-bst/1, +Binary Search Trees,Convert a normal BST into a Balanced BST,https://www.geeksforgeeks.org/convert-normal-bst-balanced-bst/, +Binary Search Trees,Merge two BST [ V.V.V>IMP ],https://www.geeksforgeeks.org/merge-two-balanced-binary-search-trees/, +Binary Search Trees,Find Kth largest element in a BST,https://practice.geeksforgeeks.org/problems/kth-largest-element-in-bst/1, +Binary Search Trees,Find Kth smallest element in a BST,https://practice.geeksforgeeks.org/problems/find-k-th-smallest-element-in-bst/1, +Binary Search Trees,"Count pairs from 2 BST whose sum is equal to given value ""X""",https://practice.geeksforgeeks.org/problems/brothers-from-different-root/1, +Binary Search Trees,Find the median of BST in O(n) time and O(1) space,https://www.geeksforgeeks.org/find-median-bst-time-o1-space/, +Binary Search Trees,Count BST ndoes that lie in a given range,https://practice.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-given-range/1, +Binary Search Trees,Replace every element with the least greater element on its right,https://www.geeksforgeeks.org/replace-every-element-with-the-least-greater-element-on-its-right/, +Binary Search Trees,"Given ""n"" appointments, find the conflicting appointments",https://www.geeksforgeeks.org/given-n-appointments-find-conflicting-appointments/, +Binary Search Trees,Check preorder is valid or not,https://practice.geeksforgeeks.org/problems/preorder-to-postorder/0, +Binary Search Trees,Check whether BST contains Dead end,https://practice.geeksforgeeks.org/problems/check-whether-bst-contains-dead-end/1, +Binary Search Trees,Largest BST in a Binary Tree [ V.V.V.V.V IMP ],https://practice.geeksforgeeks.org/problems/largest-bst/1, +Binary Search Trees,Flatten BST to sorted list,https://www.geeksforgeeks.org/flatten-bst-to-sorted-list-increasing-order/, +Greedy,Activity Selection Problem,https://practice.geeksforgeeks.org/problems/n-meetings-in-one-room/0, +Greedy,Job SequencingProblem,https://practice.geeksforgeeks.org/problems/job-sequencing-problem/0, +Greedy,Huffman Coding,https://practice.geeksforgeeks.org/problems/huffman-encoding/0, +Greedy,Water Connection Problem,https://practice.geeksforgeeks.org/problems/water-connection-problem/0, +Greedy,Fractional Knapsack Problem,https://practice.geeksforgeeks.org/problems/fractional-knapsack/0, +Greedy,Greedy Algorithm to find Minimum number of Coins,https://practice.geeksforgeeks.org/problems/coin-piles/0, +Greedy,Maximum trains for which stoppage can be provided,https://www.geeksforgeeks.org/maximum-trains-stoppage-can-provided/, +Greedy,Minimum Platforms Problem,https://practice.geeksforgeeks.org/problems/minimum-platforms/0, +Greedy,Buy Maximum Stocks if i stocks can be bought on i-th day,https://www.geeksforgeeks.org/buy-maximum-stocks-stocks-can-bought-th-day/, +Greedy,Find the minimum and maximum amount to buy all N candies,https://practice.geeksforgeeks.org/problems/shop-in-candy-store/0, +Greedy,Minimize Cash Flow among a given set of friends who have borrowed money from each other,https://www.geeksforgeeks.org/minimize-cash-flow-among-given-set-friends-borrowed-money/, +Greedy,Minimum Cost to cut a board into squares,https://www.geeksforgeeks.org/minimum-cost-cut-board-squares/, +Greedy,Check if it is possible to survive on Island,https://www.geeksforgeeks.org/survival/, +Greedy,Find maximum meetings in one room,https://www.geeksforgeeks.org/find-maximum-meetings-in-one-room/, +Greedy,Maximum product subset of an array,https://www.geeksforgeeks.org/maximum-product-subset-array/, +Greedy,Maximize array sum after K negations,https://practice.geeksforgeeks.org/problems/maximize-sum-after-k-negations/0, +Greedy,Maximize the sum of arr[i]*i,https://practice.geeksforgeeks.org/problems/maximize-arrii-of-an-array/0, +Greedy,Maximum sum of absolute difference of an array,https://www.geeksforgeeks.org/maximum-sum-absolute-difference-array/, +Greedy,Maximize sum of consecutive differences in a circular array,https://practice.geeksforgeeks.org/problems/swap-and-maximize/0, +Greedy,Minimum sum of absolute difference of pairs of two arrays,https://www.geeksforgeeks.org/minimum-sum-absolute-difference-pairs-two-arrays/, +Greedy,Program for Shortest Job First (or SJF) CPU Scheduling,https://www.geeksforgeeks.org/program-for-shortest-job-first-or-sjf-cpu-scheduling-set-1-non-preemptive/, +Greedy,Program for Least Recently Used (LRU) Page Replacement algorithm,https://practice.geeksforgeeks.org/problems/page-faults-in-lru/0, +Greedy,Smallest subset with sum greater than all other elements,https://www.geeksforgeeks.org/smallest-subset-sum-greater-elements/, +Greedy,Chocolate Distribution Problem,https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0, +Greedy,DEFKIN -Defense of a Kingdom,https://www.spoj.com/problems/DEFKIN/, +Greedy,DIEHARD -DIE HARD,https://www.spoj.com/problems/DIEHARD/, +Greedy,GERGOVIA -Wine trading in Gergovia,https://www.spoj.com/problems/GERGOVIA/, +Greedy,Picking Up Chicks,https://www.spoj.com/problems/GCJ101BB/, +Greedy,CHOCOLA –Chocolate,https://www.spoj.com/problems/CHOCOLA/, +Greedy,ARRANGE -Arranging Amplifiers,https://www.spoj.com/problems/ARRANGE/, +Greedy,K Centers Problem,https://www.geeksforgeeks.org/k-centers-problem-set-1-greedy-approximate-algorithm/, +Greedy,Minimum Cost of ropes,https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0, +Greedy,Find smallest number with given number of digits and sum of digits,https://practice.geeksforgeeks.org/problems/smallest-number5829/1, +Greedy,Rearrange characters in a string such that no two adjacent are same,https://practice.geeksforgeeks.org/problems/rearrange-characters/0, +Greedy,Find maximum sum possible equal sum of three stacks,https://www.geeksforgeeks.org/find-maximum-sum-possible-equal-sum-three-stacks/, +BackTracking,Rat in a maze Problem,https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1, +BackTracking,Printing all solutions in N-Queen Problem,https://www.geeksforgeeks.org/printing-solutions-n-queen-problem/, +BackTracking,Word Break Problem using Backtracking,https://practice.geeksforgeeks.org/problems/word-break-part-2/0, +BackTracking,Remove Invalid Parentheses,https://leetcode.com/problems/remove-invalid-parentheses/, +BackTracking,Sudoku Solver,https://practice.geeksforgeeks.org/problems/solve-the-sudoku/0, +BackTracking,m Coloring Problem,https://practice.geeksforgeeks.org/problems/m-coloring-problem/0, +BackTracking,Print all palindromic partitions of a string,https://www.geeksforgeeks.org/given-a-string-print-all-possible-palindromic-partition/, +BackTracking,Subset Sum Problem,https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1, +BackTracking,The Knight’s tour problem,https://www.geeksforgeeks.org/the-knights-tour-problem-backtracking-1/, +BackTracking,Tug of War,https://www.geeksforgeeks.org/tug-of-war/, +BackTracking,Find shortest safe route in a path with landmines,https://www.geeksforgeeks.org/find-shortest-safe-route-in-a-path-with-landmines/, +BackTracking,Combinational Sum,https://practice.geeksforgeeks.org/problems/combination-sum/0, +BackTracking,Find Maximum number possible by doing at-most K swaps,https://practice.geeksforgeeks.org/problems/largest-number-in-k-swaps/0, +BackTracking,Print all permutations of a string ,https://practice.geeksforgeeks.org/problems/permutations-of-a-given-string/0, +BackTracking,Find if there is a path of more than k length from a source,https://www.geeksforgeeks.org/find-if-there-is-a-path-of-more-than-k-length-from-a-source/, +BackTracking,Longest Possible Route in a Matrix with Hurdles,https://www.geeksforgeeks.org/longest-possible-route-in-a-matrix-with-hurdles/, +BackTracking,Print all possible paths from top left to bottom right of a mXn matrix,https://www.geeksforgeeks.org/print-all-possible-paths-from-top-left-to-bottom-right-of-a-mxn-matrix/, +BackTracking,Partition of a set intoK subsets with equal sum,https://practice.geeksforgeeks.org/problems/partition-array-to-k-subsets/1, +BackTracking,Find the K-th Permutation Sequence of first N natural numbers,https://www.geeksforgeeks.org/find-the-k-th-permutation-sequence-of-first-n-natural-numbers/, +Stacks & Queues, Implement Stack from Scratch,https://www.tutorialspoint.com/javaexamples/data_stack.htm, +Stacks & Queues, Implement Queue from Scratch,https://www.geeksforgeeks.org/queue-set-1introduction-and-array-implementation/, +Stacks & Queues,Implement 2 stack in an array,https://practice.geeksforgeeks.org/problems/implement-two-stacks-in-an-array/1, +Stacks & Queues,find the middle element of a stack,https://www.geeksforgeeks.org/design-a-stack-with-find-middle-operation/, +Stacks & Queues,"Implement ""N"" stacks in an Array",https://www.geeksforgeeks.org/efficiently-implement-k-stacks-single-array/, +Stacks & Queues,Check the expression has valid or Balanced parenthesis or not.,https://practice.geeksforgeeks.org/problems/parenthesis-checker/0, +Stacks & Queues,Reverse a String using Stack,https://practice.geeksforgeeks.org/problems/reverse-a-string-using-stack/1, +Stacks & Queues,Design a Stack that supports getMin() in O(1) time and O(1) extra space.,https://practice.geeksforgeeks.org/problems/special-stack/1, +Stacks & Queues,Find the next Greater element,https://practice.geeksforgeeks.org/problems/next-larger-element/0, +Stacks & Queues,The celebrity Problem,https://practice.geeksforgeeks.org/problems/the-celebrity-problem/1, +Stacks & Queues,Arithmetic Expression evaluation,https://www.geeksforgeeks.org/arithmetic-expression-evalution/, +Stacks & Queues,Evaluation of Postfix expression,https://practice.geeksforgeeks.org/problems/evaluation-of-postfix-expression/0, +Stacks & Queues,Implement a method to insert an element at its bottom without using any other data structure.,https://stackoverflow.com/questions/45130465/inserting-at-the-end-of-stack, +Stacks & Queues,Reverse a stack using recursion,https://www.geeksforgeeks.org/reverse-a-stack-using-recursion/, +Stacks & Queues,Sort a Stack using recursion,https://practice.geeksforgeeks.org/problems/sort-a-stack/1, +Stacks & Queues,Merge Overlapping Intervals,https://practice.geeksforgeeks.org/problems/overlapping-intervals/0, +Stacks & Queues,Largest rectangular Area in Histogram,https://practice.geeksforgeeks.org/problems/maximum-rectangular-area-in-a-histogram/0, +Stacks & Queues,Length of the Longest Valid Substring,https://practice.geeksforgeeks.org/problems/valid-substring0624/1, +Stacks & Queues,Expression contains redundant bracket or not,https://www.geeksforgeeks.org/expression-contains-redundant-bracket-not/, +Stacks & Queues,Implement Stack using Queue,https://practice.geeksforgeeks.org/problems/stack-using-two-queues/1, +Stacks & Queues,Implement Stack using Deque,https://www.geeksforgeeks.org/implement-stack-queue-using-deque/, +Stacks & Queues,Stack Permutations (Check if an array is stack permutation of other),https://www.geeksforgeeks.org/stack-permutations-check-if-an-array-is-stack-permutation-of-other/, +Stacks & Queues,Implement Queue using Stack ,https://practice.geeksforgeeks.org/problems/queue-using-two-stacks/1, +Stacks & Queues,"Implement ""n"" queue in an array",https://www.geeksforgeeks.org/efficiently-implement-k-queues-single-array/, +Stacks & Queues,Implement a Circular queue,https://www.geeksforgeeks.org/circular-queue-set-1-introduction-array-implementation/, +Stacks & Queues,LRU Cache Implementationa,https://practice.geeksforgeeks.org/problems/lru-cache/1, +Stacks & Queues,Reverse a Queue using recursion,https://practice.geeksforgeeks.org/problems/queue-reversal/1, +Stacks & Queues,Reverse the first “K” elements of a queue,https://practice.geeksforgeeks.org/problems/reverse-first-k-elements-of-queue/1, +Stacks & Queues,Interleave the first half of the queue with second half,https://www.geeksforgeeks.org/interleave-first-half-queue-second-half/, +Stacks & Queues,Find the first circular tour that visits all Petrol Pumps,https://practice.geeksforgeeks.org/problems/circular-tour/1, +Stacks & Queues,Minimum time required to rot all oranges,https://practice.geeksforgeeks.org/problems/rotten-oranges/0, +Stacks & Queues,Distance of nearest cell having 1 in a binary matrix,https://practice.geeksforgeeks.org/problems/distance-of-nearest-cell-having-1/0, +Stacks & Queues,First negative integer in every window of size “k”,https://practice.geeksforgeeks.org/problems/first-negative-integer-in-every-window-of-size-k/0, +Stacks & Queues,Check if all levels of two trees are anagrams or not.,https://www.geeksforgeeks.org/check-if-all-levels-of-two-trees-are-anagrams-or-not/, +Stacks & Queues,Sum of minimum and maximum elements of all subarrays of size “k”.,https://www.geeksforgeeks.org/sum-minimum-maximum-elements-subarrays-size-k/, +Stacks & Queues,Minimum sum of squares of character counts in a given string after removing “k” characters.,https://practice.geeksforgeeks.org/problems/game-with-string/0, +Stacks & Queues,Queue based approach or first non-repeating character in a stream.,https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream/0, +Stacks & Queues,Next Smaller Element,https://www.geeksforgeeks.org/next-smaller-element/, +Graph,"Create a Graph, print it",https://1drv.ms/t/s!AqTOHFO77CqEiRua06v1PATyiFg5, +Graph,Implement BFS algorithm ,https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1, +Graph,Implement DFS Algo ,https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/, +Graph,Detect Cycle in Directed Graph using BFS/DFS Algo ,https://www.geeksforgeeks.org/detect-cycle-in-a-graph/, +Graph,Detect Cycle in UnDirected Graph using BFS/DFS Algo ,https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1, +Graph,Search in a Maze,https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1, +Graph,Minimum Step by Knight,https://practice.geeksforgeeks.org/problems/steps-by-knight/0, +Graph,flood fill algo,https://leetcode.com/problems/flood-fill/, +Graph,Clone a graph,https://leetcode.com/problems/clone-graph/, +Graph,Making wired Connections,https://leetcode.com/problems/number-of-operations-to-make-network-connected/, +Graph,word Ladder ,https://leetcode.com/problems/word-ladder/, +Graph,Dijkstra algo,https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/, +Graph,Implement Topological Sort,https://practice.geeksforgeeks.org/problems/topological-sort/1, +Graph,Minimum time taken by each job to be completed given by a Directed Acyclic Graph,https://www.geeksforgeeks.org/minimum-time-taken-by-each-job-to-be-completed-given-by-a-directed-acyclic-graph/, +Graph,Find whether it is possible to finish all tasks or not from given dependencies (Check if cycle exists)?? ,https://www.geeksforgeeks.org/find-whether-it-is-possible-to-finish-all-tasks-or-not-from-given-dependencies/, +Graph,Find the no. of Isalnds,https://practice.geeksforgeeks.org/problems/find-the-number-of-islands/1, +Graph,"Given a sorted Dictionary of an Alien Language, find order of characters",https://practice.geeksforgeeks.org/problems/alien-dictionary/1, +Graph,Implement Kruksal’sAlgorithm,https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/, +Graph,Implement Prim’s Algorithm,https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/, +Graph,Total no. of Spanning tree in a graph,https://www.geeksforgeeks.org/total-number-spanning-trees-graph/, +Graph,Implement Bellman Ford Algorithm,https://practice.geeksforgeeks.org/problems/negative-weight-cycle/0, +Graph,Implement Floyd warshallAlgorithm,https://practice.geeksforgeeks.org/problems/implementing-floyd-warshall/0, +Graph,Travelling Salesman Problem,https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/, +Graph,Graph ColouringProblem,https://www.geeksforgeeks.org/graph-coloring-applications/, +Graph,Snake and Ladders Problem,https://leetcode.com/problems/snakes-and-ladders/, +Graph,Find bridge in a graph,https://www.geeksforgeeks.org/bridge-in-a-graph/, +Graph,Count Strongly connected Components(Kosaraju Algo),https://practice.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1, +Graph,Check whether a graph is Bipartite or Not,https://www.geeksforgeeks.org/bipartite-graph/, +Graph,Detect Negative cycle in a graph,https://www.geeksforgeeks.org/detect-negative-cycle-graph-bellman-ford/, +Graph,Longest path in a Directed Acyclic Graph,https://www.geeksforgeeks.org/find-longest-path-directed-acyclic-graph/, +Graph,Journey to the Moon,https://www.hackerrank.com/challenges/journey-to-the-moon/problem, +Graph,Cheapest Flights Within K Stops,https://leetcode.com/problems/cheapest-flights-within-k-stops/description/, +Graph,Oliver and the Game,https://www.hackerearth.com/practice/algorithms/graphs/topological-sort/practice-problems/algorithm/oliver-and-the-game-3/, +Graph,Water Jug problem using BFS,https://www.geeksforgeeks.org/water-jug-problem-using-bfs/, +Graph,Water Jug problem using BFS,https://www.geeksforgeeks.org/water-jug-problem-using-bfs/, +Graph,Find if there is a path of more thank length from a source,https://www.geeksforgeeks.org/find-if-there-is-a-path-of-more-than-k-length-from-a-source/, +Graph,M-ColouringProblem,https://practice.geeksforgeeks.org/problems/m-coloring-problem/0, +Graph,Minimum edges to reverse o make path from source to destination,https://www.geeksforgeeks.org/minimum-edges-reverse-make-path-source-destination/, +Graph,Paths to travel each nodes using each edge(Seven Bridges),https://www.geeksforgeeks.org/paths-travel-nodes-using-edgeseven-bridges-konigsberg/, +Graph,Vertex Cover Problem,https://www.geeksforgeeks.org/vertex-cover-problem-set-1-introduction-approximate-algorithm-2/, +Graph,Chinese Postman or Route Inspection,https://www.geeksforgeeks.org/chinese-postman-route-inspection-set-1-introduction/, +Graph,Number of Triangles in a Directed and Undirected Graph,https://www.geeksforgeeks.org/number-of-triangles-in-directed-and-undirected-graphs/, +Graph,Minimise the cashflow among a given set of friends who have borrowed money from each other,https://www.geeksforgeeks.org/minimize-cash-flow-among-given-set-friends-borrowed-money/, +Graph,Two Clique Problem,https://www.geeksforgeeks.org/two-clique-problem-check-graph-can-divided-two-cliques/, +Trie,Construct a trie from scratch,https://www.geeksforgeeks.org/trie-insert-and-search/, +Trie,Find shortest unique prefix for every word in a given list,https://www.geeksforgeeks.org/find-all-shortest-unique-prefixes-to-represent-each-word-in-a-given-list/, +Trie,Word Break Problem | (Trie solution),https://www.geeksforgeeks.org/word-break-problem-trie-solution/, +Trie,"Given a sequence of words, print all anagrams together",https://practice.geeksforgeeks.org/problems/k-anagrams-1/0, +Trie,Implement a Phone Directory,https://practice.geeksforgeeks.org/problems/phone-directory/0, +Trie,Print unique rows in a given boolean matrix,https://practice.geeksforgeeks.org/problems/unique-rows-in-boolean-matrix/1, +Dynamic Programming,Coin ChangeProblem,https://practice.geeksforgeeks.org/problems/coin-change2448/1, +Dynamic Programming,Knapsack Problem,https://practice.geeksforgeeks.org/problems/0-1-knapsack-problem/0, +Dynamic Programming,Binomial CoefficientProblem,https://practice.geeksforgeeks.org/problems/ncr1019/1, +Dynamic Programming,Permutation CoefficientProblem,https://www.geeksforgeeks.org/permutation-coefficient/, +Dynamic Programming,Program for nth Catalan Number,https://www.geeksforgeeks.org/program-nth-catalan-number/, +Dynamic Programming,Matrix Chain Multiplication ,https://www.geeksforgeeks.org/matrix-chain-multiplication-dp-8/, +Dynamic Programming,Edit Distance,https://practice.geeksforgeeks.org/problems/edit-distance3702/1, +Dynamic Programming,Subset Sum Problem,https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1, +Dynamic Programming,Friends Pairing Problem,https://practice.geeksforgeeks.org/problems/friends-pairing-problem5425/1, +Dynamic Programming,Gold Mine Problem,https://www.geeksforgeeks.org/gold-mine-problem/, +Dynamic Programming,Assembly Line SchedulingProblem,https://www.geeksforgeeks.org/assembly-line-scheduling-dp-34/, +Dynamic Programming,Painting the Fenceproblem,https://practice.geeksforgeeks.org/problems/painting-the-fence3727/1, +Dynamic Programming,Maximize The Cut Segments,https://practice.geeksforgeeks.org/problems/cutted-segments/0, +Dynamic Programming,Longest Common Subsequence,https://practice.geeksforgeeks.org/problems/longest-common-subsequence/0, +Dynamic Programming,Longest Repeated Subsequence,https://practice.geeksforgeeks.org/problems/longest-repeating-subsequence/0, +Dynamic Programming,Longest Increasing Subsequence,https://practice.geeksforgeeks.org/problems/longest-increasing-subsequence/0, +Dynamic Programming,Space Optimized Solution of LCS,https://www.geeksforgeeks.org/space-optimized-solution-lcs/, +Dynamic Programming,LCS (Longest Common Subsequence) of three strings,https://practice.geeksforgeeks.org/problems/lcs-of-three-strings/0, +Dynamic Programming,Maximum Sum Increasing Subsequence,https://practice.geeksforgeeks.org/problems/maximum-sum-increasing-subsequence4749/1, +Dynamic Programming,Count all subsequences having product less than K,https://www.geeksforgeeks.org/count-subsequences-product-less-k/, +Dynamic Programming,Longest subsequence such that difference between adjacent is one,https://practice.geeksforgeeks.org/problems/longest-subsequence-such-that-difference-between-adjacents-is-one4724/1, +Dynamic Programming,Maximum subsequence sum such that no three are consecutive,https://www.geeksforgeeks.org/maximum-subsequence-sum-such-that-no-three-are-consecutive/, +Dynamic Programming,Egg Dropping Problem,https://practice.geeksforgeeks.org/problems/egg-dropping-puzzle/0, +Dynamic Programming,Maximum Length Chain of Pairs,https://practice.geeksforgeeks.org/problems/max-length-chain/1, +Dynamic Programming,Maximum size square sub-matrix with all 1s,https://practice.geeksforgeeks.org/problems/largest-square-formed-in-a-matrix/0, +Dynamic Programming,Maximum sum of pairs with specific difference,https://practice.geeksforgeeks.org/problems/pairs-with-specific-difference/0, +Dynamic Programming,Min Cost PathProblem,https://practice.geeksforgeeks.org/problems/path-in-matrix3805/1, +Dynamic Programming,Maximum difference of zeros and ones in binary string,https://practice.geeksforgeeks.org/problems/maximum-difference-of-zeros-and-ones-in-binary-string4111/1, +Dynamic Programming,Minimum number of jumps to reach end,https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps/0, +Dynamic Programming,Minimum cost to fill given weight in a bag,https://practice.geeksforgeeks.org/problems/minimum-cost-to-fill-given-weight-in-a-bag1956/1, +Dynamic Programming,Minimum removals from array to make max –min <= K,https://www.geeksforgeeks.org/minimum-removals-array-make-max-min-k/, +Dynamic Programming,Longest Common Substring,https://practice.geeksforgeeks.org/problems/longest-common-substring/0, +Dynamic Programming,Count number of ways to reacha given score in a game,https://practice.geeksforgeeks.org/problems/reach-a-given-score/0, +Dynamic Programming,Count Balanced Binary Trees of Height h,https://practice.geeksforgeeks.org/problems/bbt-counter/0, +Dynamic Programming,LargestSum Contiguous Subarray [V>V>V>V IMP ],https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0, +Dynamic Programming,Smallest sum contiguous subarray,https://www.geeksforgeeks.org/smallest-sum-contiguous-subarray/, +Dynamic Programming,Unbounded Knapsack (Repetition of items allowed),https://practice.geeksforgeeks.org/problems/knapsack-with-duplicate-items4201/1, +Dynamic Programming,Word Break Problem,https://practice.geeksforgeeks.org/problems/word-break/0, +Dynamic Programming,Largest Independent Set Problem,https://www.geeksforgeeks.org/largest-independent-set-problem-dp-26/, +Dynamic Programming,Partition problem,https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1, +Dynamic Programming,Longest Palindromic Subsequence,https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/, +Dynamic Programming,Count All Palindromic Subsequence in a given String,https://practice.geeksforgeeks.org/problems/count-palindromic-subsequences/1, +Dynamic Programming,Longest Palindromic Substring,https://leetcode.com/problems/longest-palindromic-substring/, +Dynamic Programming,Longest alternating subsequence,https://practice.geeksforgeeks.org/problems/longest-alternating-subsequence/0, +Dynamic Programming,Weighted Job Scheduling,https://www.geeksforgeeks.org/weighted-job-scheduling/, +Dynamic Programming,Coin game winner where every player has three choices,https://www.geeksforgeeks.org/coin-game-winner-every-player-three-choices/, +Dynamic Programming,Count Derangements (Permutation such that no element appears in its original position) [ IMPORTANT ],https://www.geeksforgeeks.org/count-derangements-permutation-such-that-no-element-appears-in-its-original-position/, +Dynamic Programming,Maximum profit by buying and selling a share at most twice [ IMP ],https://www.geeksforgeeks.org/maximum-profit-by-buying-and-selling-a-share-at-most-twice/, +Dynamic Programming,Optimal Strategy for a Game,https://practice.geeksforgeeks.org/problems/optimal-strategy-for-a-game/0, +Dynamic Programming,Optimal Binary Search Tree,https://www.geeksforgeeks.org/optimal-binary-search-tree-dp-24/, +Dynamic Programming,Palindrome PartitioningProblem,https://practice.geeksforgeeks.org/problems/palindromic-patitioning4845/1, +Dynamic Programming,Word Wrap Problem,https://practice.geeksforgeeks.org/problems/word-wrap/0, +Dynamic Programming,Mobile Numeric Keypad Problem [ IMP ],https://practice.geeksforgeeks.org/problems/mobile-numeric-keypad5456/1, +Dynamic Programming,Boolean Parenthesization Problem,https://practice.geeksforgeeks.org/problems/boolean-parenthesization/0, +Dynamic Programming,Largest rectangular sub-matrix whose sum is 0,https://www.geeksforgeeks.org/largest-rectangular-sub-matrix-whose-sum-0/, +Dynamic Programming,Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ],https://www.geeksforgeeks.org/largest-area-rectangular-sub-matrix-equal-number-1s-0s/, +Dynamic Programming,Maximum sum rectangle in a 2D matrix,https://practice.geeksforgeeks.org/problems/maximum-sum-rectangle/0, +Dynamic Programming,Maximum profit by buying and selling a share at most k times,https://practice.geeksforgeeks.org/problems/maximum-profit4657/1, +Dynamic Programming,Find if a string is interleaved of two other strings,https://practice.geeksforgeeks.org/problems/interleaved-strings/1, +Dynamic Programming,Maximum Length of Pair Chain,https://leetcode.com/problems/maximum-length-of-pair-chain/, +Bit Manipulation,Count set bits in an integer,https://practice.geeksforgeeks.org/problems/set-bits0143/1, +Bit Manipulation,Find the two non-repeating elements in an array of repeating elements,https://practice.geeksforgeeks.org/problems/finding-the-numbers0215/1, +Bit Manipulation,Count number of bits to be flipped to convert A to B,https://practice.geeksforgeeks.org/problems/bit-difference/0, +Bit Manipulation,Count total set bits in all numbers from 1 to n,https://practice.geeksforgeeks.org/problems/count-total-set-bits/0, +Bit Manipulation,Program to find whether a no is power of two,https://practice.geeksforgeeks.org/problems/power-of-2/0, +Bit Manipulation,Find position of the only set bit,https://practice.geeksforgeeks.org/problems/find-position-of-set-bit3706/1, +Bit Manipulation,Copy set bits in a range,https://www.geeksforgeeks.org/copy-set-bits-in-a-range/, +Bit Manipulation,"Divide two integers without using multiplication, division and mod operator",https://www.geeksforgeeks.org/divide-two-integers-without-using-multiplication-division-mod-operator/, +Bit Manipulation,"Calculate square of a number without using *, / and pow()",https://www.geeksforgeeks.org/calculate-square-of-a-number-without-using-and-pow/, +Bit Manipulation,Power Set,https://practice.geeksforgeeks.org/problems/power-set4302/1, diff --git a/dsa-tracker/static/styles.css b/dsa-tracker/static/styles.css new file mode 100644 index 00000000..f62d6bc0 --- /dev/null +++ b/dsa-tracker/static/styles.css @@ -0,0 +1,72 @@ +a{ + text-decoration: none; +} + +body{ + background-color: black; +} + +.switch { + position: relative; + display: inline-block; + width: 60px; + height: 34px; + } + + /* Hide default HTML checkbox */ + .switch input { + opacity: 0; + width: 0; + height: 0; + } + + /* The slider */ + .slider { + position: absolute; + cursor: pointer; + top: 0; + left: 0; + right: 0; + bottom: 0; + background-color: #ccc; + -webkit-transition: .4s; + transition: .4s; + } + + .slider:before { + position: absolute; + content: ""; + height: 26px; + width: 26px; + left: 4px; + bottom: 4px; + background-color: white; + -webkit-transition: .4s; + transition: .4s; + } + + input:checked + .slider { + background-color: #2196F3; + } + + input:focus + .slider { + box-shadow: 0 0 1px #2196F3; + } + + input:checked + .slider:before { + -webkit-transform: translateX(26px); + -ms-transform: translateX(26px); + transform: translateX(26px); + } + + /* Rounded sliders */ + .slider.round { + border-radius: 34px; + } + + .slider.round:before { + border-radius: 50%; + } + + + diff --git a/dsa-tracker/templates/index.html b/dsa-tracker/templates/index.html new file mode 100644 index 00000000..d22539d9 --- /dev/null +++ b/dsa-tracker/templates/index.html @@ -0,0 +1,75 @@ + + + + + + + + + + + + + + DSA Tracker + + + +

DSA Tracker

+

BRUSH UP YOUR DATASTRUCTURES AND ALGORITHM AND GET INTO "FAANG"

+
+ {% for tag in tagline %} + + + +
+
+ {{tag[0]}} +
+
{{tag[0]}}
+

{{tag[1]}}

+ +
+
+
+ + {% endfor %} +
+ + + diff --git a/dsa-tracker/templates/problem.html b/dsa-tracker/templates/problem.html new file mode 100644 index 00000000..f6fd974f --- /dev/null +++ b/dsa-tracker/templates/problem.html @@ -0,0 +1,128 @@ + + + + + + + + + + + + + + {{category}} + + +

{{category}}

+
+ + + + + + + + + + + {% for d in data %} + + + + + + + + {% endfor %} + +
S.NoQuestionSolveStatus
{{loop.index}}{{d[1]}} +
+
+ + + diff --git a/login.html b/login.html deleted file mode 100644 index ab54a808..00000000 --- a/login.html +++ /dev/null @@ -1,16 +0,0 @@ - - Login Page - - - -
- Student Id
- -
-
- Password
- -

- -
- \ No newline at end of file diff --git a/login/css/my-login.css b/login/css/my-login.css new file mode 100644 index 00000000..d9811b5c --- /dev/null +++ b/login/css/my-login.css @@ -0,0 +1,67 @@ +html,body { + height: 100%; +} + +body.my-login-page { + background-color: #f7f9fb; + font-size: 14px; +} + +.my-login-page .message { + overflow: hidden; + margin: 40px auto; + position: relative; + z-index: 1; +} + +.my-login-page .card-wrapper { + width: 400px; +} + +.my-login-page .card { + border-color: transparent; + box-shadow: 0 4px 8px rgba(0,0,0,.05); +} + +.my-login-page .card.fat { + padding: 10px; +} + +.my-login-page .card .card-title { + margin-bottom: 30px; +} + +.my-login-page .form-control { + border-width: 2.3px; +} + +.my-login-page .form-group label { + width: 100%; +} + +.my-login-page .btn.btn-block { + padding: 12px 10px; +} + +.my-login-page .footer { + margin: 40px 0; + color: #888; + text-align: center; +} + +@media screen and (max-width: 425px) { + .my-login-page .card-wrapper { + width: 90%; + margin: 0 auto; + } +} + +@media screen and (max-width: 320px) { + .my-login-page .card.fat { + padding: 0; + } + + .my-login-page .card.fat .card-body { + padding: 15px; + } +} diff --git a/login/fac_login.html b/login/fac_login.html new file mode 100644 index 00000000..63c98fd4 --- /dev/null +++ b/login/fac_login.html @@ -0,0 +1,75 @@ + + + + + + + Login | MLRIT + + + + + +
+
+
+
+
+

Welcome back!

+
+
+
+

Login to your Account.

+ +
+
+
+ Copyright © 2021 — MLRIT +
+
+
+
+
+ + + + + + + diff --git a/login/fac_register.html b/login/fac_register.html new file mode 100644 index 00000000..3a1ac87f --- /dev/null +++ b/login/fac_register.html @@ -0,0 +1,80 @@ + + + + + + + Register + + + + +
+
+
+
+
+

New around here?

+
+
+
+

Register Today!

+ +
+
+
+ Copyright © 2017 — MLRIT +
+
+
+
+
+ + + + + + \ No newline at end of file diff --git a/login/forgot.html b/login/forgot.html new file mode 100644 index 00000000..e04beffb --- /dev/null +++ b/login/forgot.html @@ -0,0 +1,52 @@ + + + + + + + Login | MLRIT password reset + + + + +
+
+
+
+
+

Forgot Password?

+
+
+
+ +
+
+
+ Copyright © 2021 — MLRIT +
+
+
+
+
+ + + + + \ No newline at end of file diff --git a/login/js/my-login.js b/login/js/my-login.js new file mode 100644 index 00000000..8e571083 --- /dev/null +++ b/login/js/my-login.js @@ -0,0 +1,76 @@ +/****************************************** + * My Login + * In case a feedback link has to be provided at the bottom right + * corner of the login page + * var author = '
By @mhdnauvalazhar  •  Buy me a Coffee
'; + $("body").append(author); + * Above code to be edited. + ******************************************/ + +'use strict'; + +$(function() { + + $("input[type='password'][data-eye]").each(function(i) { + var $this = $(this), + id = 'eye-password-' + i, + el = $('#' + id); + + $this.wrap($("
", { + style: 'position:relative', + id: id + })); + + $this.css({ + paddingRight: 60 + }); + $this.after($("
", { + html: 'Show', + class: 'btn btn-primary btn-sm', + id: 'passeye-toggle-'+i, + }).css({ + position: 'absolute', + right: 10, + top: ($this.outerHeight() / 2) - 12, + padding: '2px 7px', + fontSize: 12, + cursor: 'pointer', + })); + + $this.after($("", { + type: 'hidden', + id: 'passeye-' + i + })); + + var invalid_feedback = $this.parent().parent().find('.invalid-feedback'); + + if(invalid_feedback.length) { + $this.after(invalid_feedback.clone()); + } + + $this.on("keyup paste", function() { + $("#passeye-"+i).val($(this).val()); + }); + $("#passeye-toggle-"+i).on("click", function() { + if($this.hasClass("show")) { + $this.attr('type', 'password'); + $this.removeClass("show"); + $(this).removeClass("btn-outline-primary"); + }else{ + $this.attr('type', 'text'); + $this.val($("#passeye-"+i).val()); + $this.addClass("show"); + $(this).addClass("btn-outline-primary"); + } + }); + }); + + $(".my-login-validation").submit(function() { + var form = $(this); + if (form[0].checkValidity() === false) { + event.preventDefault(); + event.stopPropagation(); + } + form.addClass('was-validated'); + }); +}); diff --git a/login/reset.html b/login/reset.html new file mode 100644 index 00000000..6ae39f54 --- /dev/null +++ b/login/reset.html @@ -0,0 +1,54 @@ + + + + + + + My password reset + + + + +
+
+
+
+
+ bootstrap 4 login page +
+
+
+

Reset Password

+ +
+
+
+ Copyright © 2017 — MLRIT +
+
+
+
+
+ + + + + + \ No newline at end of file diff --git a/login/stu_login.html b/login/stu_login.html new file mode 100644 index 00000000..26ce1712 --- /dev/null +++ b/login/stu_login.html @@ -0,0 +1,75 @@ + + + + + + + Login | MLRIT + + + + + +
+
+
+
+
+

Welcome back!

+
+
+
+

Login to your Account.

+ +
+
+
+ Copyright © 2021 — MLRIT +
+
+
+
+
+ + + + + + + diff --git a/login/stu_register.html b/login/stu_register.html new file mode 100644 index 00000000..2654ce98 --- /dev/null +++ b/login/stu_register.html @@ -0,0 +1,128 @@ + + + + + + + Register + + + + +
+
+
+
+
+

New around here?

+
+
+
+

Register Today!

+ +
+
+
+ Copyright © 2017 — MLRIT +
+
+
+
+
+ + + + + + \ No newline at end of file diff --git a/main.html b/main.html new file mode 100644 index 00000000..040719ad --- /dev/null +++ b/main.html @@ -0,0 +1,53 @@ + + + + + + + Omnia | Homepage + + + + +
+
+
+
+
+

Welcome to Omnia

+
+
+
+

Student/Faculty Login

+ + + +
+ +
+ +
+ +
+ +
+ +
+
+
+ Copyright © 2021 — MLRIT +
+
+
+
+
+ + + + + + \ No newline at end of file diff --git a/startbootstrap-sb-admin b/startbootstrap-sb-admin new file mode 160000 index 00000000..e200f8f0 --- /dev/null +++ b/startbootstrap-sb-admin @@ -0,0 +1 @@ +Subproject commit e200f8f0dd86a77255a21c947afeefe90e0dd4c1