Page Index - anishsingh90/Data_Structure_And_Algorithm_In_Cpp_github.io GitHub Wiki

271 page(s) in this GitHub Wiki:

• Home
• (1). 2.1 Data Types and Type Modifiers code.
• Please reload this page
• (10). 6.3 Advanced Placement Questions on Functions.
• Please reload this page
• (100). 28.4. CHECK FOR BST(BINARY SEARCH TREE)
• Please reload this page
• (101). 28.5. BUILD BALANCED BST FROM SORTED ARRAY
• Please reload this page
• (102). 28.6. CATALAN NUMBERS APPLICATION.
• Please reload this page
• (103). 28.7. ZIG‐ZAG TRAVERSAL BINARY SEARCH TREE.
• Please reload this page
• (104). 28.8. IDENTICAL BINARY SEARCH TREES
• Please reload this page
• (105). 28.10. LARGEST BST IN BINARY TREE.
• Please reload this page
• (106). 28.11. RECOVER BINARY SEARCH TREE
• Please reload this page
• (107). 28.12. SET AND MULTISET (STANDARD TEMPLATE LIBRARY)
• Please reload this page
• (108). 29.1. PLACE ELEMENTS TO Maximise Minimum Distance.
• Please reload this page
• (109). 29.2. PAGE ALLOCATION PROBLEM.
• Please reload this page
• (11). 8.1 Introduction of Arrays.
• Please reload this page
• (110). 29.3. PAINTERS PARTITION PROBLEM.
• Please reload this page
• (111). 29.4. SEARCH IN SORTED AND ROTATED ARRAY
• Please reload this page
• (112). 29.5. FIND THE PEAK ELEMENT
• Please reload this page
• (113). 30.1. MAX SUM SUBARRAY
• Please reload this page
• (114). 30.2. MINIMUM SUBARRAY SIZE.
• Please reload this page
• (115). 30.3. FROM NUMBER DIVISIBLE BY 3.
• Please reload this page
• (116). 30.4. SUBARRAY WITH PALINDROMIC CONCATENATION.
• Please reload this page
• (117). 30.5. PERFECT NUMBERS IN SUBARRAYS
• Please reload this page
• (118). 31.2. HEAP SORT
• Please reload this page
• (119). 31.3. HEAP STL
• Please reload this page
• (12). 8.2 Searching in Arrays.
• Please reload this page
• (120). 31.4. HEAPS‐MEDIAN OF RUNNING STREAM
• Please reload this page
• (121). 31.5. HEAPS‐MERGE K SORTED ARRAY.
• Please reload this page
• (122). 31.6. HEAPS ‐ SMALLEST SEQUENCE WITH SUM K.
• Please reload this page
• (123). 32.2. HASHING STL
• Please reload this page
• (124). 32.3. HASHING ‐ COUNT FREQUENCY OF ELEMENT.
• Please reload this page
• (125). 32.4. PRINT VERTICAL ORDER OF A BINARY TREE.
• Please reload this page
• (126). 32.5. HASHING‐NUMBER OF SUBARRAYS WITH SUM ZERO
• Please reload this page
• (127). 32.6. HASHING SLIDING WINDOWS TECHNIQUE.
• Please reload this page
• (128). 32.7. HASHING TOP K MOST FREQUENT ELEMENT.
• Please reload this page
• (129). 32.8. SUDOKU SOLVER ‐ HASHING.
• Please reload this page
• (13). 8.3.1 Sorting in Arrays(Selection Sort)
• Please reload this page
• (130). 33.2. INDIAN COIN CHANGE ‐ GREEDY ALGORITHM.
• Please reload this page
• (131). 33.3. Activity Selection Problem.
• Please reload this page
• (132). 33.4 FRACTIONAL KNAPSACK‐GREEDY ALGORITHMS
• Please reload this page
• (133). 33.5 OPTIMAL MERGE PATTERN.
• Please reload this page
• (134) 33.7. MAXIMUM AND MINIMUM DIFFERENCE ‐ GREEDY ALGORITHM.
• Please reload this page
• (135). 85. Introduction to Graphs
• Please reload this page
• (14). 8.3.2 Bubble Sort in Array.
• Please reload this page
• (15). 8.3.3. INSERTION SORT IN ARRAYS.
• Please reload this page
• (16). 8.4 ARRAY CHALLANGES.
• Please reload this page
• (17). 8.5 Array Q's asked by Top MNC's.
• Please reload this page
• (18). 8.6 SUBARRAYS CHALLENGES (Questions asked by top MNC's)
• Please reload this page
• (19). 9.1 TWO DIMENSIONAL ARRAYS | 2‐D ARRAYS |
• Please reload this page
• (2). 2.2 Input and Output in C .
• Please reload this page
• (20). 9.2 2‐D ARRAY CHALLENGE
• Please reload this page
• (21). 10. Character Arrays
• Please reload this page
• (22). 11. Pointers in C .
• Please reload this page
• (23). 13. String in C .
• Please reload this page
• (24). 13.1 STRING CHALLENGE
• Please reload this page
• (25). 14.1 BIT MANIPULATION.
• Please reload this page
• (26). 14.2 BIT MANIJPULATION CHALLENGE
• Please reload this page
• (27). 14.3 Bit Manupulation Challenge.
• Please reload this page
• (28). 15.1 Sieve of Erasthenes ‐ Challenge.
• Please reload this page
• (29). 15.2. Inclusion ‐ Exclusion Principle ‐ Challenge.
• Please reload this page
• (3). 2.3 If else statement in C
• Please reload this page
• (30). 19.3 Vector in CPP By College Wallah.
• Please reload this page
• (31). 16.1 Recursion Introduction.
• Please reload this page
• (32). 16.2 Recursion ‐ Challenges
• Please reload this page
• (33). 16.3 7 Best Problem on Recursion.
• Please reload this page
• (34). 16.4 Advanced Recursion Problem.
• Please reload this page
• (35). 16.5 Recursion Advanced Problem.
• Please reload this page
• (36). 17 PERMUTATION
• Please reload this page
• (37). 18.1 BACKTRACKING
• Please reload this page
• (38). 18.2 BACKTRACKING N‐Queen Problem.
• Please reload this page
• (39). 19.1 Merge Sort.
• Please reload this page
• (4). 2.4 Introduction to Loops in C .
• Please reload this page
• (40). 19.2 Quick Sort
• Please reload this page
• (41). 20.1 COUNT SORT.
• Please reload this page
• (42). 20.2 DNF SORT (DUTCH NATIONAL FLAG)
• Please reload this page
• (43). 20.3 WAVE SORT.
• Please reload this page
• (44). 20.4 COUNT INVERSION
• Please reload this page
• (45). OOPS CONCEPT BY LOVE BABAR.
• Please reload this page
• (46) 21.1 Object Oriented Programming in CPP.
• Please reload this page
• (47). 21.3 POLYMORPHISM IN OOP's.
• Please reload this page
• (48). 22.1 Introduction to Linked List.
• Please reload this page
• (49). 22.2 DELETION IN LINKED LIST.
• Please reload this page
• (5). 4.1 Awesome Pattern Questions 1.
• Please reload this page
• (50). 22.3 REVERSE A LINKED ‐ LIST.
• Please reload this page
• (51). 22.4 REVERSE K NODE OF LINKED LIST
• Please reload this page
• (52). 22.5 Detection and Romoval of Cycle in Linked List.
• Please reload this page
• (53). 44. LINKED LIST (SINGLY, DOUBLY AND CIRCULAR) by love bubbar
• Please reload this page
• (54). 22.6 DOUBLY LINKED LIST.
• Please reload this page
• (55). 22.7 APPEND LAST K NODES TO START OF LINKED LIST
• Please reload this page
• (56). 22.8 FIND INTERSECTION POINT OF TWO LINKED LIST.
• Please reload this page
• (57). 22.9. MERGE TWO SORTED LINKED LIST
• Please reload this page
• (58). 22.10 CIRCULAR LINKED LIST
• Please reload this page
• (59). 22.11 PUT EVEN POSITION NODES AFTER ODD POSITION NODES.
• Please reload this page
• (6). 4.2 Advanced Pattern Question 2
• Please reload this page
• (60). 23.1 STACK DATA STRUCTURE ‐ INTRODUCTION
• Please reload this page
• (61). 23.2 STACK CHALLENGE (REVERSE A SENTENCE) USING STACK
• Please reload this page
• (62). 23.3 STACK CHALLENGE (REVERSE A STACK)
• Please reload this page
• (63). 23.5 PREFIX EXPRESSION EVALUATION
• Please reload this page
• (64). 23.6 POSTFIX EXPRESSION EVALUATION
• Please reload this page
• (65). 23.7. INFIX To POSTFIX.
• Please reload this page
• (66). 23.8 INFIX TO PREFIX
• Please reload this page
• (67). 23.9 BALANCED STRING
• Please reload this page
• (68). 24.1 INTRODUCTION TO QUEUE
• Please reload this page
• (69). 24.2 Linked List Implementation Of Queue
• Please reload this page
• (7). 5.2 How to Reverse a Number.
• Please reload this page
• (70). 24.3. Queue Using Stack
• Please reload this page
• (71). 24.4.1. Stack Using Queue
• Please reload this page
• (72). 24.4.2. Stack Using Queue.
• Please reload this page
• (73). 25.1. Deque (Sliding Windows Maximum Using Deque)
• Please reload this page
• (74). 25.2. LARGEST RECTANGLE IN A HISTOGRAM
• Please reload this page
• (75). 25.3. TRAPPING RAINWATER HARVESTING
• Please reload this page
• (76). 25.4. Redundant Parenthesis
• Please reload this page
• (77). 25.5. THE STACK SPAN PROBLEM.
• Please reload this page
• (78). 26.1. TWO POINTERS [THREE SUM PROBLEM]
• Please reload this page
• (79). 26.2. Max Consecutive Ones
• Please reload this page
• (8). 6.1 Function in C .
• Please reload this page
• (80). 26.3. LONGEST SUBSTRING WITHOUT REPEATING CHARACTER.
• Please reload this page
• (81). 27.1. BINARY TREES INTRODUCTION.
• Please reload this page
• (82). 27.2. BINARY TREE TRAVERSAL (PREORDER , INORDER , POSTORDER TRAVERSAL)
• Please reload this page
• (83). 27.3. BUILD TREE FROM POSTORDER AND INORDER.
• Please reload this page
• (84). 27.4. BUILD TREE FROM POSTORDER AND INORDER.
• Please reload this page
• (85). 27.5. LEVEL ORDER TRAVERSAL (SUM AT Kth LEVEL IN BINARY TREE)
• Please reload this page
• (86). 27.6. COUNT AND SUM OF NODES
• Please reload this page
• (87). 27.7. HEIGHT AND DIAMETER IN BINARY TREE
• Please reload this page
• (88). 27.8. SUM REPLACEMENT IN BINARY TREE
• Please reload this page
• (89). 27.9. Height Balanced Binary Tree.
• Please reload this page
• (9). 6.2 Function Challenges.
• Please reload this page
• (90). 27.10. Right view of Binary Tree.
• Please reload this page
• (91). 27.11. Left view of Binary Tree.
• Please reload this page
• (92). 27.12. SHORTEST DISTANCE BETWEEN 2 NODES.
• Please reload this page
• (93). 27.13. FLATTEN A BINARY TREE
• Please reload this page
• (94). 27.14. NODES AT DISTANCE K IN BINARY TREE.
• Please reload this page
• (95). 27.15. LOWEST COMMEN ANCESTOR IN BINARY TREE
• Please reload this page
• (96). 27.16. MAX SUM PATH FROM ONE NODE TO ANOTHER IN BINARY TREE
• Please reload this page
• (97). 28.1. BINARY SEARCH TREE (INTRODUCTION, BUILD)
• Please reload this page
• (98). 28.2. SEARCH AND DELETE IN BINARY SEARCH TREE
• Please reload this page
• (99). 28.3. CONSTRUCT BINARY SEARCH TREE FROM PREORDER.
• Please reload this page