{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":692831814,"defaultBranch":"main","name":"DSA_SUPREME_2.0_BATCH_HANDWRITTEN_NOTES","ownerLogin":"DitijTanwar29","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-09-17T18:03:52.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/86351168?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1699213021.0","currentOid":""},"activityList":{"items":[{"before":"0ac1e40fd1ee115533066b467a949d9be7f49667","after":"9c38d38c1c79641e484066a4737d265309cc89dc","ref":"refs/heads/main","pushedAt":"2023-11-05T19:37:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"RECURSION COMPLETE NOTES \n\nThese 3 pdf's contains all the recursion concepts of live lectures","shortMessageHtmlLink":"RECURSION COMPLETE NOTES"}},{"before":"98da98fc175c48471834ca268f88af0de3414042","after":"0ac1e40fd1ee115533066b467a949d9be7f49667","ref":"refs/heads/main","pushedAt":"2023-10-05T07:35:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"Lecture_14 SORTING & CUSTOM COMPARATOR NOTES\n\nKEY POINTS- \r\n1- BUBBLE SORT \r\n2- SELECTION SORT\r\n3- INSERTION SORT\r\n4- CUSTOM COMPARATOR","shortMessageHtmlLink":"Lecture_14 SORTING & CUSTOM COMPARATOR NOTES"}},{"before":"8bacd0789c352de8288c5e390db4ff099c524253","after":"98da98fc175c48471834ca268f88af0de3414042","ref":"refs/heads/main","pushedAt":"2023-09-29T08:12:40.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"Lecture_13 Searching&sorting_LEVEL_3 Notes\n\nKEY POINTS-\r\n\r\n1- QUESTIONS ON SEARCH SPACE CONCEPT\r\n2- BINARY SEEAERCH ON NEARLY SORTED ARRAY\r\n3- FIND ODD OCCURING ELEMENT","shortMessageHtmlLink":"Lecture_13 Searching&sorting_LEVEL_3 Notes"}},{"before":"b5c5eb06137f00e2fa859026d94f952d38465e89","after":"8bacd0789c352de8288c5e390db4ff099c524253","ref":"refs/heads/main","pushedAt":"2023-09-26T15:51:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"Lecture_12_Searching&Sorting_Level_2_Notes \n\nKEY POINTS-\r\n\r\n1- SEARCH IN ROTATED & SORTED ARRAY (LEETCODE 33)\r\n2- SQRT(X) (LEETCODE 69)\r\n3- SEARCH SPACE MINIMISATION\r\n4- BINARY SEARCH IN 2-D ARRAY\r\n5-SEARCH A 2-D MATRIX (LEETCODE 74)","shortMessageHtmlLink":"Lecture_12_Searching&Sorting_Level_2_Notes"}},{"before":"4c2566b5447a9bf718f28336cc11110e2fc1c0a0","after":"b5c5eb06137f00e2fa859026d94f952d38465e89","ref":"refs/heads/main","pushedAt":"2023-09-23T12:40:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"Lecture_11_Searching&&Sorting_Level_1_Notes\n\nKEY POINTS-\r\n\r\n1- LINEAR SEARCH\r\n2- BINARY SEARCH\r\n3- WORKING OF BINARY SEARCH + TIME COMPLEXITY\r\n4- RULES FOR APPLYING BINARY SEARCH + CODE\r\n5- FIND FIRST OCCURENCE OF A NUMBER IN A SORTED ARRAY\r\n6- FIND LAST OCCURENCE OF AN ELEMENT IN A SORTED ARRAY\r\n7- FIND TOTAL OCCURENCE OF AN ELEMENT IN A SORTED ARRAY\r\n8- FIND MISSING ELEMENT IN A SORTED ARRAY\r\n9- PEAK INDEX IN A MOUNTAIN ARRAY (852 LEETCODE)","shortMessageHtmlLink":"Lecture_11_Searching&&Sorting_Level_1_Notes"}},{"before":"7c7a5e2bd6e5e7c286c700b983084c5cc3f054e9","after":"4c2566b5447a9bf718f28336cc11110e2fc1c0a0","ref":"refs/heads/main","pushedAt":"2023-09-18T13:11:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"L-10 Array Extra class of 12 sept 23\n\nARRAY EXTRA CLASS OF 12 SEPT 2023\r\n\r\nKEY POINTS-\r\n\r\n1- LEETCODE QUESTIONS\r\n2- SORT COLOR\r\n3- ROTATE ARRAY\r\n4- MISSING NUMBER\r\n5- ROW WITH MAXIMUM ONES\r\n6- ROTATE IMAGE","shortMessageHtmlLink":"L-10 Array Extra class of 12 sept 23"}},{"before":"1ea192e484446efa0091f925df0d21c5702c31f9","after":"7c7a5e2bd6e5e7c286c700b983084c5cc3f054e9","ref":"refs/heads/main","pushedAt":"2023-09-17T18:51:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"ARRAYS LEVEL-3 LECTURE 9 NOTES SAME AS BELOW\n\nARRAY LEVEL-3 LECTURE 9 NOTES BY MISTAKE WROTE LECTURE 8 IN MY PREVIOUS COMMIT SORRY FOR THAT BUT ITS SAME AS ARRAY LEVEL 3 LECTURE 8 \r\n\r\nKEY POINTS-\r\n\r\n1- 2-D ARRAY\r\n2- CREATION OF ARRAY\r\n3- INITIALISATION OF 2-D ARRAY\r\n4- ACCESS ARRAY VALUES IN 2-D ARRAY\r\n5- STORAGE OF 2-D ARRAY IN MEMORY \r\n6- PRINT 2D ARRAY\r\n7- COLUMN WISE ACCESS \r\n8- FINDING TARGET IN 2D ARRAY (USING 2 POINTER APPROACH)\r\n9- FIND MAX NO. IN AN ARRAY\r\n10- FIND MINIMUM NO. IN AN ARRAY\r\n11- FIND ROW WISE SUM OF 2D ARRAY\r\n12- FIND COLUMN WISE SUM IN 2D ARRAY\r\n12- PRINT DIGONAL OF 2D ARRAY\r\n13- PRINT DIAGONAL SUM PD 2D ARRAY\r\n14- PRINT TRANSPOSE OF 2D MATRIX\r\n15 VECTOR\r\n16- 2D VECTOR\r\n17- JAGGED ARRAY","shortMessageHtmlLink":"ARRAYS LEVEL-3 LECTURE 9 NOTES SAME AS BELOW"}},{"before":"7acf672a63e972c3e7905567e2cc5b40795b3b0b","after":"1ea192e484446efa0091f925df0d21c5702c31f9","ref":"refs/heads/main","pushedAt":"2023-09-17T18:44:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"ARRAYS LEVEL-3 LECTURE 8 NOTES\n\nKEY POINTS-\r\n\r\n1- 2-D ARRAY\r\n2- CREATION OF ARRAY\r\n3- INITIALISATION OF 2-D ARRAY\r\n4- ACCESS ARRAY VALUES IN 2-D ARRAY\r\n5- STORAGE OF 2-D ARRAY IN MEMORY \r\n6- PRINT 2D ARRAY\r\n7- COLUMN WISE ACCESS \r\n8- FINDING TARGET IN 2D ARRAY (USING 2 POINTER APPROACH)\r\n9- FIND MAX NO. IN AN ARRAY\r\n10- FIND MINIMUM NO. IN AN ARRAY\r\n11- FIND ROW WISE SUM OF 2D ARRAY\r\n12- FIND COLUMN WISE SUM IN 2D ARRAY\r\n12- PRINT DIGONAL OF 2D ARRAY\r\n13- PRINT DIAGONAL SUM PD 2D ARRAY\r\n14- PRINT TRANSPOSE OF 2D MATRIX\r\n15 VECTOR\r\n16- 2D VECTOR\r\n17- JAGGED ARRAY","shortMessageHtmlLink":"ARRAYS LEVEL-3 LECTURE 8 NOTES"}},{"before":"6113f416ddd772972d8ca4ed181e100d785c1870","after":"7acf672a63e972c3e7905567e2cc5b40795b3b0b","ref":"refs/heads/main","pushedAt":"2023-09-17T18:35:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"ARRAYS LEVEL-2 LECTURE 8 NOTES \n\nKEY POINTS-\r\n\r\n1- PASS BY VALUE\r\n2- PASS BY REFERENCE\r\n3- REFERENCE VARIABLE\r\n4- PASSING ARRAYS IN A FUNCTION\r\n5- VARIOUS QUESTIONS ON ARRAY+FUNCTIONS","shortMessageHtmlLink":"ARRAYS LEVEL-2 LECTURE 8 NOTES"}},{"before":"a27c9c057162e1013f5f6fc81c917741d6347420","after":"6113f416ddd772972d8ca4ed181e100d785c1870","ref":"refs/heads/main","pushedAt":"2023-09-17T18:32:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"ARRAYS LEVEL 1- LECTURE 7 NOTES \n\nKEY POINTS- \r\n\r\n1- WHY WE NEED ARRAY?\r\n2- ADDRESS OF OPERATOR AND SIZE OF FUNCTION\r\n3- ARRAY INITIALISATION\r\n4- INDEXING IN ARRAY\r\n5- TAKING INPUT IN AN ARRAY\r\n6- LINEAR SEARCH IN ARRAY\r\n7- ARRAYS AND FUNCTIONS\r\n8- 7 TO 8 QUESTIONS ON ARRAYS AND PASSING ARRAYS IN FUNCTION","shortMessageHtmlLink":"ARRAYS LEVEL 1- LECTURE 7 NOTES"}},{"before":"ce8dd539fb73adcf765547a764381fe1d78f9ffc","after":"a27c9c057162e1013f5f6fc81c917741d6347420","ref":"refs/heads/main","pushedAt":"2023-09-17T18:28:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"FUNCTIONS LECTURE 6\n\nKEY POINTS-\r\n\r\n1- NEED OF FUNCTIONS AND SYNTAX\r\n2- FUNCTION DECLARATION\r\n3- FUNCTION DEFINITION\r\n4- FUNCTION CALL\r\n5- FUNCTION CALL STACK","shortMessageHtmlLink":"FUNCTIONS LECTURE 6"}},{"before":"b8a2ae3b56953e3a270152f9b6e20d44891500ec","after":"ce8dd539fb73adcf765547a764381fe1d78f9ffc","ref":"refs/heads/main","pushedAt":"2023-09-17T18:25:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"BITWISE OPERATORS AND LOOPS LECTURE 5\n\nLECTURE 5 NOTES \r\n\r\nKEY POINTS-\r\n\r\n1- AND OPERATOR ( & )\r\n2- OR OPERATOR ( | )\r\n3- NOT OPERATOR ( ~ )\r\n4- XOR OPERATOR ( ^ )\r\n5- LEFT SHIFT ( << ) AND RIGHT SHIFT ( >> ) OPERATORS\r\n6- PRE/POST INCREMENT/DECREMENT OPERATORS\r\n7- BREAK AND CONTINUE KEYWORDS\r\n8- VARIABLE SCOPING","shortMessageHtmlLink":"BITWISE OPERATORS AND LOOPS LECTURE 5"}},{"before":"c0dc9f1953868caf38b7dbddc73ce0317404d259","after":"b8a2ae3b56953e3a270152f9b6e20d44891500ec","ref":"refs/heads/main","pushedAt":"2023-09-17T18:21:29.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"BASICS OF PROGRAMMING- PATTERN CONTINUES LECTURE 4\n\nKEY POINTS-\r\n\r\n1- PRINT FULL PYRAMID PATTERN\r\n2- PRINT INVERTED FULL PYRAMID\r\n3- PRIINT DIAMOND PATTERN \r\n4- PRINT HOLLOW PYRAMID PATTERN\r\n5- PRINT INVERTED HOLLOW PYRAMID PATTERN\r\n6- PRINT HOLLOW DIAMOND PATTERN\r\n7- PRINT FLIPPED SOLID DIAMOND PATTERN\r\n8- VARIOUS UNIQUE PATTERN QUESTIONS AND HOMEWORK QUESTIONS ADDED","shortMessageHtmlLink":"BASICS OF PROGRAMMING- PATTERN CONTINUES LECTURE 4"}},{"before":"0c066522d3764af9334d97fa38b537c016880242","after":"c0dc9f1953868caf38b7dbddc73ce0317404d259","ref":"refs/heads/main","pushedAt":"2023-09-17T18:16:40.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"CONDITIONALS & LOOPS LECTURE 3\n\nKEY POINTS- \r\n1- IF STATEMENT\r\n2- IF ELSE STATEMENT\r\n3- IF-ELSE IF-ELSE STATEMENT\r\n4- FOR LOOP\r\n5- PRINT RECTANGLE PATTERN\r\n6- PRINT SQUARE PATTERN\r\n7- PRINT HOLLOW RECTANGLE PATTERN \r\n8- PRINT HALF PYRAMID PATTERN\r\n9- PRINT INVERTED HALF PYRAMID PATTERN \r\n10- PRINT NUMERIC HALF PYRAMID PATTERN\r\n11- PRINT INVERTED NUMERIC HALF PATTERN","shortMessageHtmlLink":"CONDITIONALS & LOOPS LECTURE 3"}},{"before":"f14ef50ba73db813340f902252ae49994fb1bdfa","after":"0c066522d3764af9334d97fa38b537c016880242","ref":"refs/heads/main","pushedAt":"2023-09-17T18:11:20.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"BASICS OF PROGRAMMING LECTURE 2 NOTES\n\nKEY POINTS-\r\n\r\n1- NEED OF PROGRAMMING LANGUAGES?\r\n2- COMPILATION PROCESS\r\n3- TERMINOLOGIES\r\n4- DATATYPES AND VARIABLES\r\n5- HOW DATA IS STORED?\r\n6- FINDING BINARY EQUIVALENT\r\n7- HOW NEGATIVE NUMBERS ARE STORED\r\n8- RANGE (OF UNSIGNED DATA)\r\n9- SIGNED VS UNSIGNED DATA","shortMessageHtmlLink":"BASICS OF PROGRAMMING LECTURE 2 NOTES"}},{"before":null,"after":"f14ef50ba73db813340f902252ae49994fb1bdfa","ref":"refs/heads/main","pushedAt":"2023-09-17T18:07:25.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"DitijTanwar29","name":null,"path":"/DitijTanwar29","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/86351168?s=80&v=4"},"commit":{"message":"BASICS OF PROGRAMMING LECTURE 1 NOTES\n\nKEY POINTS -\r\n\r\n1- ALGORITHM\r\n2- HOW TO APPROACH A PROBLEM?\r\n3- COMPONENTS OF FLOW CHART\r\n4- PSUEDO-CODE\r\n5- VARIOUS QUESTIONS ON FLOWCHARTS AND PSUEDO-CODE","shortMessageHtmlLink":"BASICS OF PROGRAMMING LECTURE 1 NOTES"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"Y3Vyc29yOnYyOpK7MjAyMy0xMS0wNVQxOTozNzowMi4wMDAwMDBazwAAAAOn3J7D","startCursor":"Y3Vyc29yOnYyOpK7MjAyMy0xMS0wNVQxOTozNzowMi4wMDAwMDBazwAAAAOn3J7D","endCursor":"Y3Vyc29yOnYyOpK7MjAyMy0wOS0xN1QxODowNzoyNS4wMDAwMDBazwAAAAOCfEHb"}},"title":"Activity ยท DitijTanwar29/DSA_SUPREME_2.0_BATCH_HANDWRITTEN_NOTES"}