Torrent details for "[Apna College] Alpha Batch 5.0 | Complete Placement Course" Log in to bookmark
Controls:
×
Report Torrent
Please select a reason for reporting this torrent:
Your report will be reviewed by our moderation team.
×
Report Information
Loading report information...
This torrent has been reported 0 times.
Report Summary:
| User | Reason | Date |
|---|
Failed to load report information.
×
Success
Your report has been submitted successfully.
Checked by:
Category:
Language:
None
Total Size:
25.4 GB
Info Hash:
25EEE12586A360305ACE93346F385630A7CB2774
Added By:
Added:
July 15, 2025, 9:40 a.m.
Stats:
|
(Last updated: July 15, 2025, 10:21 a.m.)
| File | Size |
|---|---|
| ['css/style.css'] | 0 bytes |
| ['files/0. Updated Topic List.txt'] | 0 bytes |
| ['files/1. Alpha Curriculum.pdf'] | 0 bytes |
| ['files/2. Installation Resources.pdf'] | 0 bytes |
| ['files/2. Installation Resources.pdf_thumb.jpg'] | 0 bytes |
| ['files/3. Telegram Channel.pdf'] | 0 bytes |
| ['files/3. Telegram Channel.pdf_thumb.jpg'] | 0 bytes |
| ['files/4.1 Space & Time Complexity.pdf'] | 0 bytes |
| ['files/4.1 Space & Time Complexity.pdf_thumb.jpg'] | 0 bytes |
| ['files/9_Comparison Table_.mp4_thumb.jpg'] | 0 bytes |
| ['files/9_Comparison Table_.pdf'] | 0 bytes |
| ['files/AVL Trees (Reading Material).pdf'] | 0 bytes |
| ['files/AVL Trees (Reading Material).pdf_thumb.jpg'] | 0 bytes |
| ['files/Assignment in 31 (1).txt'] | 0 bytes |
| ['files/Assignment in 31.txt'] | 0 bytes |
| ['files/Assignment in 33.txt'] | 0 bytes |
| ['files/Assignment in 41 (1).txt'] | 0 bytes |
| ['files/Assignment in 41 (2).txt'] | 0 bytes |
| ['files/Assignment in 41 (3).txt'] | 0 bytes |
| ['files/Assignment in 41.txt'] | 0 bytes |
| ['files/Assignment in 48 (1).txt'] | 0 bytes |
| ['files/Assignment in 48 (2).txt'] | 0 bytes |
| ['files/Assignment in 48 (3).txt'] | 0 bytes |
| ['files/Assignment in 48 (4).txt'] | 0 bytes |
| ['files/Assignment in 48.txt'] | 0 bytes |
| ['files/Assignments in 25.txt'] | 0 bytes |
| ['files/BST Solutions.pdf'] | 0 bytes |
| ['files/BST Solutions.pdf_thumb.jpg'] | 0 bytes |
| ['files/Circular LInked List ( Reading Material).pdf'] | 0 bytes |
| ['files/Circular LInked List ( Reading Material).pdf_thumb.jpg'] | 0 bytes |
| ['files/Comparatos In Java (Reading Material).pdf'] | 0 bytes |
| ['files/Comparatos In Java (Reading Material).pdf_thumb.jpg'] | 0 bytes |
| ['files/Computer Networking Notes for Tech Placements.pdf'] | 0 bytes |
| ['files/Computer Networking Notes for Tech Placements.pdf_thumb.jpg'] | 0 bytes |
| ['files/DBMS_Notes.pdf'] | 0 bytes |
| ['files/DBMS_Notes.pdf_thumb.jpg'] | 0 bytes |
| ['files/DSA_QUES_SHEET.pdf'] | 0 bytes |
| ['files/DSA_QUES_SHEET.pdf_thumb.jpg'] | 0 bytes |
| ['files/Helpful Projects.pdf'] | 0 bytes |
| ['files/Helpful Projects.pdf_thumb.jpg'] | 0 bytes |
| ['files/Looking Forward - Advanced Pattern.pdf'] | 0 bytes |
| ['files/Looking Forward - Advanced Pattern.pdf_thumb.jpg'] | 0 bytes |
| ['files/Operating System Notes.pdf'] | 0 bytes |
| ['files/Operating System Notes.pdf_thumb.jpg'] | 0 bytes |
| ['files/Operator Precedence.pdf'] | 0 bytes |
| ['files/Operator Precedence.pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (1).pdf'] | 0 bytes |
| ['files/Practice Questions (1).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (10).pdf'] | 0 bytes |
| ['files/Practice Questions (10).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (11).pdf'] | 0 bytes |
| ['files/Practice Questions (11).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (12).pdf'] | 0 bytes |
| ['files/Practice Questions (12).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (13).pdf'] | 0 bytes |
| ['files/Practice Questions (13).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (14).pdf'] | 0 bytes |
| ['files/Practice Questions (14).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (15).pdf'] | 0 bytes |
| ['files/Practice Questions (15).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (16).pdf'] | 0 bytes |
| ['files/Practice Questions (16).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (17).pdf'] | 0 bytes |
| ['files/Practice Questions (17).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (18).pdf'] | 0 bytes |
| ['files/Practice Questions (18).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (19).pdf'] | 0 bytes |
| ['files/Practice Questions (19).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (2).pdf'] | 0 bytes |
| ['files/Practice Questions (2).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (20).pdf'] | 0 bytes |
| ['files/Practice Questions (20).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (21).pdf'] | 0 bytes |
| ['files/Practice Questions (21).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (22).pdf'] | 0 bytes |
| ['files/Practice Questions (22).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (23).pdf'] | 0 bytes |
| ['files/Practice Questions (23).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (24).pdf'] | 0 bytes |
| ['files/Practice Questions (24).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (25).pdf'] | 0 bytes |
| ['files/Practice Questions (25).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (26).pdf'] | 0 bytes |
| ['files/Practice Questions (26).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (27).pdf'] | 0 bytes |
| ['files/Practice Questions (27).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (3).pdf'] | 0 bytes |
| ['files/Practice Questions (3).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (4).pdf'] | 0 bytes |
| ['files/Practice Questions (4).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (5).pdf'] | 0 bytes |
| ['files/Practice Questions (5).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (6).pdf'] | 0 bytes |
| ['files/Practice Questions (6).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (7).pdf'] | 0 bytes |
| ['files/Practice Questions (7).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (8).pdf'] | 0 bytes |
| ['files/Practice Questions (8).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions (9).pdf'] | 0 bytes |
| ['files/Practice Questions (9).pdf_thumb.jpg'] | 0 bytes |
| ['files/Practice Questions.pdf'] | 0 bytes |
| ['files/Practice Questions.pdf_thumb.jpg'] | 0 bytes |
| ['files/Quantitative Aptitude-12.pdf'] | 0 bytes |
| ['files/Quantitative Aptitude-12.pdf_thumb.jpg'] | 0 bytes |
| ['files/Solution for Practice Qs (1).pdf'] | 0 bytes |
| ['files/Solution for Practice Qs (1).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solution for Practice Qs (2).pdf'] | 0 bytes |
| ['files/Solution for Practice Qs (2).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solution for Practice Qs (3).pdf'] | 0 bytes |
| ['files/Solution for Practice Qs (3).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solution for Practice Qs (4).pdf'] | 0 bytes |
| ['files/Solution for Practice Qs (4).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solution for Practice Qs (5).pdf'] | 0 bytes |
| ['files/Solution for Practice Qs (5).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solution for Practice Qs (6).pdf'] | 0 bytes |
| ['files/Solution for Practice Qs (6).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solution for Practice Qs (7).pdf'] | 0 bytes |
| ['files/Solution for Practice Qs (7).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solution for Practice Qs (8).pdf'] | 0 bytes |
| ['files/Solution for Practice Qs (8).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solution for Practice Qs (9).pdf'] | 0 bytes |
| ['files/Solution for Practice Qs (9).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solution for Practice Qs.pdf'] | 0 bytes |
| ['files/Solution for Practice Qs.pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (1).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (1).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (10).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (10).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (11).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (11).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (12).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (12).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (13).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (13).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (14).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (14).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (15).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (15).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (16).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (16).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (17).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (17).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (2).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (2).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (3).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (3).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (4).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (4).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (5).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (5).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (6).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (6).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (7).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (7).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (8).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (8).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs (9).pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs (9).pdf_thumb.jpg'] | 0 bytes |
| ['files/Solutions for Practice Qs.pdf'] | 0 bytes |
| ['files/Solutions for Practice Qs.pdf_thumb.jpg'] | 0 bytes |
| ['images/back.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/media_call.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/media_contact.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/media_file.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/media_game.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/media_location.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/media_music.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/media_photo.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/media_shop.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/media_video.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/media_voice.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/section_calls.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/section_chats.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/section_contacts.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/section_frequent.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/section_other.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/section_photos.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/section_sessions.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/section_stories.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['images/section_web.png'] | 0 bytes |
| ['images/[email protected]'] | 0 bytes |
| ['js/script.js'] | 0 bytes |
| ['photos/photo_10@07-07-2025_08-34-56.jpg'] | 0 bytes |
| ['photos/photo_10@07-07-2025_08-34-56_thumb.jpg'] | 0 bytes |
| ['photos/photo_11@07-07-2025_08-35-09.jpg'] | 0 bytes |
| ['photos/photo_11@07-07-2025_08-35-09_thumb.jpg'] | 0 bytes |
| ['photos/photo_12@07-07-2025_08-35-23.jpg'] | 0 bytes |
| ['photos/photo_12@07-07-2025_08-35-23_thumb.jpg'] | 0 bytes |
| ['photos/photo_13@07-07-2025_08-35-34.jpg'] | 0 bytes |
| ['photos/photo_13@07-07-2025_08-35-34_thumb.jpg'] | 0 bytes |
| ['photos/photo_14@07-07-2025_08-35-37.jpg'] | 0 bytes |
| ['photos/photo_14@07-07-2025_08-35-37_thumb.jpg'] | 0 bytes |
| ['photos/photo_15@07-07-2025_08-35-42.jpg'] | 0 bytes |
| ['photos/photo_15@07-07-2025_08-35-42_thumb.jpg'] | 0 bytes |
| ['photos/photo_16@07-07-2025_08-35-55.jpg'] | 0 bytes |
| ['photos/photo_16@07-07-2025_08-35-55_thumb.jpg'] | 0 bytes |
| ['photos/photo_17@07-07-2025_08-35-55.jpg'] | 0 bytes |
| ['photos/photo_17@07-07-2025_08-35-55_thumb.jpg'] | 0 bytes |
| ['photos/photo_18@07-07-2025_08-36-05.jpg'] | 0 bytes |
| ['photos/photo_18@07-07-2025_08-36-05_thumb.jpg'] | 0 bytes |
| ['photos/photo_19@07-07-2025_08-36-15.jpg'] | 0 bytes |
| ['photos/photo_19@07-07-2025_08-36-15_thumb.jpg'] | 0 bytes |
| ['photos/photo_1@07-07-2025_08-33-57.jpg'] | 0 bytes |
| ['photos/photo_1@07-07-2025_08-33-57_thumb.jpg'] | 0 bytes |
| ['photos/photo_20@07-07-2025_08-36-25.jpg'] | 0 bytes |
| ['photos/photo_20@07-07-2025_08-36-25_thumb.jpg'] | 0 bytes |
| ['photos/photo_21@07-07-2025_08-36-34.jpg'] | 0 bytes |
| ['photos/photo_21@07-07-2025_08-36-34_thumb.jpg'] | 0 bytes |
| ['photos/photo_22@07-07-2025_08-36-35.jpg'] | 0 bytes |
| ['photos/photo_22@07-07-2025_08-36-35_thumb.jpg'] | 0 bytes |
| ['photos/photo_23@07-07-2025_08-36-45.jpg'] | 0 bytes |
| ['photos/photo_23@07-07-2025_08-36-45_thumb.jpg'] | 0 bytes |
| ['photos/photo_24@07-07-2025_08-36-56.jpg'] | 0 bytes |
| ['photos/photo_24@07-07-2025_08-36-56_thumb.jpg'] | 0 bytes |
| ['photos/photo_25@07-07-2025_08-37-01.jpg'] | 0 bytes |
| ['photos/photo_25@07-07-2025_08-37-01_thumb.jpg'] | 0 bytes |
| ['photos/photo_26@07-07-2025_08-37-08.jpg'] | 0 bytes |
| ['photos/photo_26@07-07-2025_08-37-08_thumb.jpg'] | 0 bytes |
| ['photos/photo_27@07-07-2025_08-37-18.jpg'] | 0 bytes |
| ['photos/photo_27@07-07-2025_08-37-18_thumb.jpg'] | 0 bytes |
| ['photos/photo_28@07-07-2025_08-37-27.jpg'] | 0 bytes |
| ['photos/photo_28@07-07-2025_08-37-27_thumb.jpg'] | 0 bytes |
| ['photos/photo_29@07-07-2025_08-37-37.jpg'] | 0 bytes |
| ['photos/photo_29@07-07-2025_08-37-37_thumb.jpg'] | 0 bytes |
| ['photos/photo_2@07-07-2025_08-33-59.jpg'] | 0 bytes |
| ['photos/photo_2@07-07-2025_08-33-59_thumb.jpg'] | 0 bytes |
| ['photos/photo_30@07-07-2025_08-37-45.jpg'] | 0 bytes |
| ['photos/photo_30@07-07-2025_08-37-45_thumb.jpg'] | 0 bytes |
| ['photos/photo_31@07-07-2025_08-37-53.jpg'] | 0 bytes |
| ['photos/photo_31@07-07-2025_08-37-53_thumb.jpg'] | 0 bytes |
| ['photos/photo_32@07-07-2025_08-37-58.jpg'] | 0 bytes |
| ['photos/photo_32@07-07-2025_08-37-58_thumb.jpg'] | 0 bytes |
| ['photos/photo_33@07-07-2025_08-38-03.jpg'] | 0 bytes |
| ['photos/photo_33@07-07-2025_08-38-03_thumb.jpg'] | 0 bytes |
| ['photos/photo_34@07-07-2025_08-38-09.jpg'] | 0 bytes |
| ['photos/photo_34@07-07-2025_08-38-09_thumb.jpg'] | 0 bytes |
| ['photos/photo_35@07-07-2025_08-38-14.jpg'] | 0 bytes |
| ['photos/photo_35@07-07-2025_08-38-14_thumb.jpg'] | 0 bytes |
| ['photos/photo_36@07-07-2025_08-38-23.jpg'] | 0 bytes |
| ['photos/photo_36@07-07-2025_08-38-23_thumb.jpg'] | 0 bytes |
| ['photos/photo_37@07-07-2025_08-38-36.jpg'] | 0 bytes |
| ['photos/photo_37@07-07-2025_08-38-36_thumb.jpg'] | 0 bytes |
| ['photos/photo_38@07-07-2025_08-38-44.jpg'] | 0 bytes |
| ['photos/photo_38@07-07-2025_08-38-44_thumb.jpg'] | 0 bytes |
| ['photos/photo_39@07-07-2025_08-38-49.jpg'] | 0 bytes |
| ['photos/photo_39@07-07-2025_08-38-49_thumb.jpg'] | 0 bytes |
| ['photos/photo_3@07-07-2025_08-34-02.jpg'] | 0 bytes |
| ['photos/photo_3@07-07-2025_08-34-02_thumb.jpg'] | 0 bytes |
| ['photos/photo_40@07-07-2025_08-38-53.jpg'] | 0 bytes |
| ['photos/photo_40@07-07-2025_08-38-53_thumb.jpg'] | 0 bytes |
| ['photos/photo_41@07-07-2025_08-38-57.jpg'] | 0 bytes |
| ['photos/photo_41@07-07-2025_08-38-57_thumb.jpg'] | 0 bytes |
| ['photos/photo_42@07-07-2025_08-39-00.jpg'] | 0 bytes |
| ['photos/photo_42@07-07-2025_08-39-00_thumb.jpg'] | 0 bytes |
| ['photos/photo_43@07-07-2025_08-39-05.jpg'] | 0 bytes |
| ['photos/photo_43@07-07-2025_08-39-05_thumb.jpg'] | 0 bytes |
| ['photos/photo_44@07-07-2025_08-39-07.jpg'] | 0 bytes |
| ['photos/photo_44@07-07-2025_08-39-07_thumb.jpg'] | 0 bytes |
| ['photos/photo_45@07-07-2025_08-39-12.jpg'] | 0 bytes |
| ['photos/photo_45@07-07-2025_08-39-12_thumb.jpg'] | 0 bytes |
| ['photos/photo_46@07-07-2025_08-39-17.jpg'] | 0 bytes |
| ['photos/photo_46@07-07-2025_08-39-17_thumb.jpg'] | 0 bytes |
| ['photos/photo_47@07-07-2025_08-39-21.jpg'] | 0 bytes |
| ['photos/photo_47@07-07-2025_08-39-21_thumb.jpg'] | 0 bytes |
| ['photos/photo_48@07-07-2025_08-39-25.jpg'] | 0 bytes |
| ['photos/photo_48@07-07-2025_08-39-25_thumb.jpg'] | 0 bytes |
| ['photos/photo_49@07-07-2025_08-39-29.jpg'] | 0 bytes |
| ['photos/photo_49@07-07-2025_08-39-29_thumb.jpg'] | 0 bytes |
| ['photos/photo_4@07-07-2025_08-34-03.jpg'] | 0 bytes |
| ['photos/photo_4@07-07-2025_08-34-03_thumb.jpg'] | 0 bytes |
| ['photos/photo_50@07-07-2025_08-39-34.jpg'] | 0 bytes |
| ['photos/photo_50@07-07-2025_08-39-34_thumb.jpg'] | 0 bytes |
| ['photos/photo_5@07-07-2025_08-34-16.jpg'] | 0 bytes |
| ['photos/photo_5@07-07-2025_08-34-16_thumb.jpg'] | 0 bytes |
| ['photos/photo_6@07-07-2025_08-34-23.jpg'] | 0 bytes |
| ['photos/photo_6@07-07-2025_08-34-23_thumb.jpg'] | 0 bytes |
| ['photos/photo_7@07-07-2025_08-34-34.jpg'] | 0 bytes |
| ['photos/photo_7@07-07-2025_08-34-34_thumb.jpg'] | 0 bytes |
| ['photos/photo_8@07-07-2025_08-34-40.jpg'] | 0 bytes |
| ['photos/photo_8@07-07-2025_08-34-40_thumb.jpg'] | 0 bytes |
| ['photos/photo_9@07-07-2025_08-34-47.jpg'] | 0 bytes |
| ['photos/photo_9@07-07-2025_08-34-47_thumb.jpg'] | 0 bytes |
| ['video_files/1 (1). Introduction.mp4'] | 0 bytes |
| ['video_files/1 (1). Introduction.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1 (2). Introduction.mp4'] | 0 bytes |
| ['video_files/1 (2). Introduction.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1 (3). Introduction.mp4'] | 0 bytes |
| ['video_files/1 (3). Introduction.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. (For New Students) Bonus Live Session.mp4'] | 0 bytes |
| ['video_files/1. (For New Students) Bonus Live Session.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Basics of Matrices (Math).mp4'] | 0 bytes |
| ['video_files/1. Basics of Matrices (Math).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Bellman Ford Algorithm.mp4'] | 0 bytes |
| ['video_files/1. Bellman Ford Algorithm.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Cheapest Flights within K Stops.mp4'] | 0 bytes |
| ['video_files/1. Cheapest Flights within K Stops.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Classes & Objects.mp4'] | 0 bytes |
| ['video_files/1. Classes & Objects.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Coin Change (Live Class).mp4'] | 0 bytes |
| ['video_files/1. Coin Change (Live Class).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Connected Components.mp4'] | 0 bytes |
| ['video_files/1. Connected Components.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Creating A Java File.mp4'] | 0 bytes |
| ['video_files/1. Creating A Java File.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Detecting Cycle in LL.mp4'] | 0 bytes |
| ['video_files/1. Detecting Cycle in LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Diameter of a Tree (Approach1).mp4'] | 0 bytes |
| ['video_files/1. Diameter of a Tree (Approach1).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Hashing Introduction.mp4'] | 0 bytes |
| ['video_files/1. Hashing Introduction.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Hollow Rectangle Pattern.mp4'] | 0 bytes |
| ['video_files/1. Hollow Rectangle Pattern.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. If Else.mp4'] | 0 bytes |
| ['video_files/1. If Else.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Introduction To 2D Arrays.mp4'] | 0 bytes |
| ['video_files/1. Introduction To 2D Arrays.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Introduction To Bit Manipulation.mp4'] | 0 bytes |
| ['video_files/1. Introduction To Bit Manipulation.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Introduction To Function.mp4'] | 0 bytes |
| ['video_files/1. Introduction To Function.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Introduction to ArrayList.mp4'] | 0 bytes |
| ['video_files/1. Introduction to ArrayList.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Introduction to Binary Trees.mp4'] | 0 bytes |
| ['video_files/1. Introduction to Binary Trees.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Introduction to DP.mp4'] | 0 bytes |
| ['video_files/1. Introduction to DP.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Introduction to Graphs.mp4'] | 0 bytes |
| ['video_files/1. Introduction to Graphs.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Introduction to Greedy.mp4'] | 0 bytes |
| ['video_files/1. Introduction to Greedy.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Introduction to Linked List.mp4'] | 0 bytes |
| ['video_files/1. Introduction to Linked List.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Introduction to Priority Queues.mp4'] | 0 bytes |
| ['video_files/1. Introduction to Priority Queues.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Introduction to Queues.mp4'] | 0 bytes |
| ['video_files/1. Introduction to Queues.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Introduction.mp4'] | 0 bytes |
| ['video_files/1. Introduction.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Kth Level of a Tree.mp4'] | 0 bytes |
| ['video_files/1. Kth Level of a Tree.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Longest Common Substring.mp4'] | 0 bytes |
| ['video_files/1. Longest Common Substring.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Loops Basics.mp4'] | 0 bytes |
| ['video_files/1. Loops Basics.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Path to Placement_1.mp4'] | 0 bytes |
| ['video_files/1. Path to Placement_1.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Print Star Pattern.mp4'] | 0 bytes |
| ['video_files/1. Print Star Pattern.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Segment Trees Introduction.mp4'] | 0 bytes |
| ['video_files/1. Segment Trees Introduction.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Sorted Array to Balanced BST.mp4'] | 0 bytes |
| ['video_files/1. Sorted Array to Balanced BST.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Stack Introduction.mp4'] | 0 bytes |
| ['video_files/1. Stack Introduction.mp4_thumb.jpg'] | 0 bytes |
| ["video_files/1. Strongly Connected Components (Kosaraju's Algorithm).mp4"] | 0 bytes |
| ["video_files/1. Strongly Connected Components (Kosaraju's Algorithm).mp4_thumb.jpg"] | 0 bytes |
| ["video_files/1. Topological Sort using BFS (Kahn's Algorithm).mp4"] | 0 bytes |
| ["video_files/1. Topological Sort using BFS (Kahn's Algorithm).mp4_thumb.jpg"] | 0 bytes |
| ['video_files/1. Tries Introduction.mp4'] | 0 bytes |
| ['video_files/1. Tries Introduction.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Types of Knapsack problems.mp4'] | 0 bytes |
| ['video_files/1. Types of Knapsack problems.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Types of Operators.mp4'] | 0 bytes |
| ['video_files/1. Types of Operators.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. What Is Sorting.mp4'] | 0 bytes |
| ['video_files/1. What Is Sorting.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. What are Flowcharts.mp4'] | 0 bytes |
| ['video_files/1. What are Flowcharts.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. What are Strings.mp4'] | 0 bytes |
| ['video_files/1. What are Strings.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. What to Install (on your laptopcomputer)_1.mp4'] | 0 bytes |
| ['video_files/1. What to Install (on your laptopcomputer)_1.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1. Wildcard Matching - Hard (Explanation).mp4'] | 0 bytes |
| ['video_files/1. Wildcard Matching - Hard (Explanation).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1.What is Divide & Conquer%3f.mp4'] | 0 bytes |
| ['video_files/1.What is Divide & Conquer%3f.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/1.What is Recursion%3f.mp4'] | 0 bytes |
| ['video_files/1.What is Recursion%3f.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10 - Check If Odd Or Even.mp4'] | 0 bytes |
| ['video_files/10 - Check If Odd Or Even.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Calculator.mp4'] | 0 bytes |
| ['video_files/10. Calculator.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Container with Most Water (Brute Force).mp4'] | 0 bytes |
| ['video_files/10. Container with Most Water (Brute Force).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Counting Sort Code.mp4'] | 0 bytes |
| ['video_files/10. Counting Sort Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Diamond Patter.mp4'] | 0 bytes |
| ['video_files/10. Diamond Patter.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Do While Loop.mp4'] | 0 bytes |
| ['video_files/10. Do While Loop.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Height of a Tree.mp4'] | 0 bytes |
| ['video_files/10. Height of a Tree.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Inbuilt vs User Defined Methods.mp4'] | 0 bytes |
| ['video_files/10. Inbuilt vs User Defined Methods.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Inheritance.mp4'] | 0 bytes |
| ['video_files/10. Inheritance.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Iterative Search.mp4'] | 0 bytes |
| ['video_files/10. Iterative Search.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Job Sequencing Problem.mp4'] | 0 bytes |
| ['video_files/10. Job Sequencing Problem.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Last Occurrence.mp4'] | 0 bytes |
| ['video_files/10. Last Occurrence.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Longest Word with all Prefixes.mp4'] | 0 bytes |
| ['video_files/10. Longest Word with all Prefixes.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Majority Element.mp4'] | 0 bytes |
| ['video_files/10. Majority Element.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. N Queens - count ways.mp4'] | 0 bytes |
| ['video_files/10. N Queens - count ways.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Nearby Cars.mp4'] | 0 bytes |
| ['video_files/10. Nearby Cars.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Nested Loop 2 Analysis.mp4'] | 0 bytes |
| ['video_files/10. Nested Loop 2 Analysis.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Next greater element Code.mp4'] | 0 bytes |
| ['video_files/10. Next greater element Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Pairs In Array.mp4'] | 0 bytes |
| ['video_files/10. Pairs In Array.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Queue Reversal.mp4'] | 0 bytes |
| ['video_files/10. Queue Reversal.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Search In Sorted Matrix Code.mp4'] | 0 bytes |
| ['video_files/10. Search In Sorted Matrix Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Sum Of a&b (Input From User).mp4'] | 0 bytes |
| ['video_files/10. Sum Of a&b (Input From User).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10. Zig Zag Linked List.mp4'] | 0 bytes |
| ['video_files/10. Zig Zag Linked List.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/10.Print Largest String.mp4'] | 0 bytes |
| ['video_files/10.Print Largest String.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11 - Get ith Bit.mp4'] | 0 bytes |
| ['video_files/11 - Get ith Bit.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Print x to the power n.mp4'] | 0 bytes |
| ['video_files/11. Print x to the power n.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Single level Inheritance .mp4'] | 0 bytes |
| ['video_files/11. Single level Inheritance .mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Break Statement.mp4'] | 0 bytes |
| ['video_files/11. Break Statement.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Chocola Problem.mp4'] | 0 bytes |
| ['video_files/11. Chocola Problem.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Connect N Ropes with Minimum Cost.mp4'] | 0 bytes |
| ['video_files/11. Connect N Ropes with Minimum Cost.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Container with Most Water (2 Pointer Approach).mp4'] | 0 bytes |
| ['video_files/11. Container with Most Water (2 Pointer Approach).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Count Nodes of a Tree.mp4'] | 0 bytes |
| ['video_files/11. Count Nodes of a Tree.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Deque (Double Ended Queue).mp4'] | 0 bytes |
| ['video_files/11. Deque (Double Ended Queue).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Function Overloading.mp4'] | 0 bytes |
| ['video_files/11. Function Overloading.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. N Queens - print one solution.mp4'] | 0 bytes |
| ['video_files/11. N Queens - print one solution.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Nested Loop 3 Analysis.mp4'] | 0 bytes |
| ['video_files/11. Nested Loop 3 Analysis.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. PRODUCTS OF A & B.mp4'] | 0 bytes |
| ['video_files/11. PRODUCTS OF A & B.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Print Subarrays.mp4'] | 0 bytes |
| ['video_files/11. Print Subarrays.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Recursive Search.mp4'] | 0 bytes |
| ['video_files/11. Recursive Search.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Valid Anagram.mp4'] | 0 bytes |
| ['video_files/11. Valid Anagram.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Valid Parentheses.mp4'] | 0 bytes |
| ['video_files/11. Valid Parentheses.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Why Strings Are Immutable.mp4'] | 0 bytes |
| ['video_files/11. Why Strings Are Immutable.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/11. Zig Zag LL Code.mp4'] | 0 bytes |
| ['video_files/11. Zig Zag LL Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12 - Set ith Bit.mp4'] | 0 bytes |
| ['video_files/12 - Set ith Bit.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Area Of Circle.mp4'] | 0 bytes |
| ['video_files/12. Area Of Circle.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Bubble Sort Analysis.mp4'] | 0 bytes |
| ['video_files/12. Bubble Sort Analysis.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Chocola Problem Code.mp4'] | 0 bytes |
| ['video_files/12. Chocola Problem Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Container wMW vs. Trapping Rainwater.mp4'] | 0 bytes |
| ['video_files/12. Container wMW vs. Trapping Rainwater.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Deque in JCF.mp4'] | 0 bytes |
| ['video_files/12. Deque in JCF.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Doubly LL.mp4'] | 0 bytes |
| ['video_files/12. Doubly LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Grid Ways.mp4'] | 0 bytes |
| ['video_files/12. Grid Ways.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. HashSet.mp4'] | 0 bytes |
| ['video_files/12. HashSet.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Max-Subarray Sum - I (Brute Force).mp4'] | 0 bytes |
| ['video_files/12. Max-Subarray Sum - I (Brute Force).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Multi Level Inheritance.mp4'] | 0 bytes |
| ['video_files/12. Multi Level Inheritance.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Overloading Using Parameters.mp4'] | 0 bytes |
| ['video_files/12. Overloading Using Parameters.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Print x to the power n (Optimized) .mp4'] | 0 bytes |
| ['video_files/12. Print x to the power n (Optimized) .mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Question - Break Statement.mp4'] | 0 bytes |
| ['video_files/12. Question - Break Statement.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Reverse a LL.mp4'] | 0 bytes |
| ['video_files/12. Reverse a LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. String Builder.mp4'] | 0 bytes |
| ['video_files/12. String Builder.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Sum of Nodes.mp4'] | 0 bytes |
| ['video_files/12. Sum of Nodes.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Valid Parentheses Code.mp4'] | 0 bytes |
| ['video_files/12. Valid Parentheses Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/12. Weakest Soldier.mp4'] | 0 bytes |
| ['video_files/12. Weakest Soldier.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13 - Clear ith Bit.mp4'] | 0 bytes |
| ['video_files/13 - Clear ith Bit.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Tiling Problem .mp4'] | 0 bytes |
| ['video_files/13. Tiling Problem .mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Binary Search Analysis.mp4'] | 0 bytes |
| ['video_files/13. Binary Search Analysis.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Continue Statement.mp4'] | 0 bytes |
| ['video_files/13. Continue Statement.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Convert Letters To Uppercase.mp4'] | 0 bytes |
| ['video_files/13. Convert Letters To Uppercase.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Diameter of a Tree (Approach1).mp4'] | 0 bytes |
| ['video_files/13. Diameter of a Tree (Approach1).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Duplicate Parentheses.mp4'] | 0 bytes |
| ['video_files/13. Duplicate Parentheses.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Find and Remove Nth Node from End.mp4'] | 0 bytes |
| ['video_files/13. Find and Remove Nth Node from End.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Grid Ways Code.mp4'] | 0 bytes |
| ['video_files/13. Grid Ways Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Hierarchial Inheritance.mp4'] | 0 bytes |
| ['video_files/13. Hierarchial Inheritance.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Implement Stack using Deque.mp4'] | 0 bytes |
| ['video_files/13. Implement Stack using Deque.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Iteration on HashSets.mp4'] | 0 bytes |
| ['video_files/13. Iteration on HashSets.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Max-Subarray Sum - II (Prifix Sum).mp4'] | 0 bytes |
| ['video_files/13. Max-Subarray Sum - II (Prifix Sum).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Overloading Using Data Types - Copy.mp4'] | 0 bytes |
| ['video_files/13. Overloading Using Data Types - Copy.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Pair Sum-1 (Brute Force).mp4'] | 0 bytes |
| ['video_files/13. Pair Sum-1 (Brute Force).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Reverse a Doubly LL.mp4'] | 0 bytes |
| ['video_files/13. Reverse a Doubly LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Sliding Window Maximum.mp4'] | 0 bytes |
| ['video_files/13. Sliding Window Maximum.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/13. Type Conversion.mp4'] | 0 bytes |
| ['video_files/13. Type Conversion.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14 - Update ith Bit.mp4'] | 0 bytes |
| ['video_files/14 - Update ith Bit.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Check If Number Is Prime Or Not.mp4'] | 0 bytes |
| ['video_files/14. Check If Number Is Prime Or Not.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Check if LL is Palindrome.mp4'] | 0 bytes |
| ['video_files/14. Check if LL is Palindrome.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Circular LL (Approach).mp4'] | 0 bytes |
| ['video_files/14. Circular LL (Approach).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Diameter of a Tree (Approach2) .mp4'] | 0 bytes |
| ['video_files/14. Diameter of a Tree (Approach2) .mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Duplicate Parentheses Code.mp4'] | 0 bytes |
| ['video_files/14. Duplicate Parentheses Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Grid Ways Trick.mp4'] | 0 bytes |
| ['video_files/14. Grid Ways Trick.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Hybrid Inheritance.mp4'] | 0 bytes |
| ['video_files/14. Hybrid Inheritance.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Implement Queue using Deque.mp4'] | 0 bytes |
| ['video_files/14. Implement Queue using Deque.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Linked HashSet.mp4'] | 0 bytes |
| ['video_files/14. Linked HashSet.mp4_thumb.jpg'] | 0 bytes |
| ["video_files/14. Max-Subarray Sum - III (Kadane's Algorithm).mp4"] | 0 bytes |
| ["video_files/14. Max-Subarray Sum - III (Kadane's Algorithm).mp4_thumb.jpg"] | 0 bytes |
| ['video_files/14. Pair Sum-1 (2 Pointer Approach).mp4'] | 0 bytes |
| ['video_files/14. Pair Sum-1 (2 Pointer Approach).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Question - Continue Keyword.mp4'] | 0 bytes |
| ['video_files/14. Question - Continue Keyword.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Recursive Complexity Analysis (Factorial).mp4'] | 0 bytes |
| ['video_files/14. Recursive Complexity Analysis (Factorial).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Srring Compression.mp4'] | 0 bytes |
| ['video_files/14. Srring Compression.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Tiling Problem Code.mp4'] | 0 bytes |
| ['video_files/14. Tiling Problem Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/14. Type Casting.mp4'] | 0 bytes |
| ['video_files/14. Type Casting.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15 - Clear Last i Bits.mp4'] | 0 bytes |
| ['video_files/15 - Clear Last i Bits.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15. Check If A Number Is Prime Or Not.mp4'] | 0 bytes |
| ['video_files/15. Check If A Number Is Prime Or Not.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15. Check Prime (Optmised).mp4'] | 0 bytes |
| ['video_files/15. Check Prime (Optmised).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15. Check if LL is Palindrome (Code).mp4'] | 0 bytes |
| ['video_files/15. Check if LL is Palindrome (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15. Maximum Rectangular Area in Histogram.mp4'] | 0 bytes |
| ['video_files/15. Maximum Rectangular Area in Histogram.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15. Pair Sum-2.mp4'] | 0 bytes |
| ['video_files/15. Pair Sum-2.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15. Polymorphism.mp4'] | 0 bytes |
| ['video_files/15. Polymorphism.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15. Remove Duplicates in a String.mp4'] | 0 bytes |
| ['video_files/15. Remove Duplicates in a String.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15. Sudoku.mp4'] | 0 bytes |
| ['video_files/15. Sudoku.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15. Sum of N Numbers Analysis.mp4'] | 0 bytes |
| ['video_files/15. Sum of N Numbers Analysis.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15. Trapping Rainwater.mp4'] | 0 bytes |
| ['video_files/15. Trapping Rainwater.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15. TreeSet.mp4'] | 0 bytes |
| ['video_files/15. TreeSet.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/15. Type Promotion Expression.mp4'] | 0 bytes |
| ['video_files/15. Type Promotion Expression.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/16 -Clear Range Of Bits.mp4'] | 0 bytes |
| ['video_files/16 -Clear Range Of Bits.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/16. Count Distinct Elements.mp4'] | 0 bytes |
| ['video_files/16. Count Distinct Elements.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/16. Fibonacci Analysis.mp4'] | 0 bytes |
| ['video_files/16. Fibonacci Analysis.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/16. Friends Pairing Problem.mp4'] | 0 bytes |
| ['video_files/16. Friends Pairing Problem.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/16. How Does Java Code Run.mp4'] | 0 bytes |
| ['video_files/16. How Does Java Code Run.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/16. Max Reactangular Area in Histogram (Code).mp4'] | 0 bytes |
| ['video_files/16. Max Reactangular Area in Histogram (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/16. Method Overloading.mp4'] | 0 bytes |
| ['video_files/16. Method Overloading.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/16. Pair Sum-2 (Code).mp4'] | 0 bytes |
| ['video_files/16. Pair Sum-2 (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/16. Prime In Range.mp4'] | 0 bytes |
| ['video_files/16. Prime In Range.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/16. Sudoku Code.mp4'] | 0 bytes |
| ['video_files/16. Sudoku Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/16. Trapping Rainwater - Code.mp4'] | 0 bytes |
| ['video_files/16. Trapping Rainwater - Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/17 - Check If A Number Is Power Of 2 Or Not.mp4'] | 0 bytes |
| ['video_files/17 - Check If A Number Is Power Of 2 Or Not.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/17. Method Overriding.mp4'] | 0 bytes |
| ['video_files/17. Method Overriding.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/17. Best Time To Buy & Sell Stocks.mp4'] | 0 bytes |
| ['video_files/17. Best Time To Buy & Sell Stocks.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/17. Binary Strings Problem.mp4'] | 0 bytes |
| ['video_files/17. Binary Strings Problem.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/17. Binary To Decimal.mp4'] | 0 bytes |
| ['video_files/17. Binary To Decimal.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/17. Merge Sort Analysis.mp4'] | 0 bytes |
| ['video_files/17. Merge Sort Analysis.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/17. Union & Intersection.mp4'] | 0 bytes |
| ['video_files/17. Union & Intersection.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/18. Binary Strings Problem Code.mp4'] | 0 bytes |
| ['video_files/18. Binary Strings Problem Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/18. Code - Binary To Decimal.mp4'] | 0 bytes |
| ['video_files/18. Code - Binary To Decimal.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/18. Count Set Bits In Number.mp4'] | 0 bytes |
| ['video_files/18. Count Set Bits In Number.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/18. Find Itinerary for Tickets.mp4'] | 0 bytes |
| ['video_files/18. Find Itinerary for Tickets.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/18. Packages in Java.mp4'] | 0 bytes |
| ['video_files/18. Packages in Java.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/18. Recurrence Relation - Merge Sort.mp4'] | 0 bytes |
| ['video_files/18. Recurrence Relation - Merge Sort.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/19. Abstraction.mp4'] | 0 bytes |
| ['video_files/19. Abstraction.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/19. Decimal To Binary.mp4'] | 0 bytes |
| ['video_files/19. Decimal To Binary.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/19. Fast Exponetiation.mp4'] | 0 bytes |
| ['video_files/19. Fast Exponetiation.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/19. Largest Subarray with Sum 0.mp4'] | 0 bytes |
| ['video_files/19. Largest Subarray with Sum 0.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/19. Power Function I - Analysis.mp4'] | 0 bytes |
| ['video_files/19. Power Function I - Analysis.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/19. Stack Analysis - Binary Strings.mp4'] | 0 bytes |
| ['video_files/19. Stack Analysis - Binary Strings.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2 Merge sort (basic + space Optimized) .mp4'] | 0 bytes |
| ['video_files/2 Merge sort (basic + space Optimized) .mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. 0-1 Knapsack (Recursion).mp4'] | 0 bytes |
| ['video_files/2. 0-1 Knapsack (Recursion).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Access Modifiers.mp4'] | 0 bytes |
| ['video_files/2. Access Modifiers.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Activity Selection.mp4'] | 0 bytes |
| ['video_files/2. Activity Selection.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Alpha Community Update.mp4'] | 0 bytes |
| ['video_files/2. Alpha Community Update.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Arithmetic Operators.mp4'] | 0 bytes |
| ['video_files/2. Arithmetic Operators.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Arrays-Creation.mp4'] | 0 bytes |
| ['video_files/2. Arrays-Creation.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Bellman Ford (Code).mp4'] | 0 bytes |
| ['video_files/2. Bellman Ford (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Binary Number System.mp4'] | 0 bytes |
| ['video_files/2. Binary Number System.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Boilerplate Code.mp4'] | 0 bytes |
| ['video_files/2. Boilerplate Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Bonus Live Session with Aman Bhaiya.mp4'] | 0 bytes |
| ['video_files/2. Bonus Live Session with Aman Bhaiya.mp4_thumb.jpg'] | 0 bytes |
| ["video_files/2. Bridge in Graph (Tarjan's Algorithm).mp4"] | 0 bytes |
| ["video_files/2. Bridge in Graph (Tarjan's Algorithm).mp4_thumb.jpg"] | 0 bytes |
| ['video_files/2. Bubble Sort.mp4'] | 0 bytes |
| ['video_files/2. Bubble Sort.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Cheapest Flights within K Stops (Code).mp4'] | 0 bytes |
| ['video_files/2. Cheapest Flights within K Stops (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Concept of Search in BST.mp4'] | 0 bytes |
| ['video_files/2. Concept of Search in BST.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Convert BST to Balanced BST.mp4'] | 0 bytes |
| ['video_files/2. Convert BST to Balanced BST.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Count & Meaning of Nodes.mp4'] | 0 bytes |
| ['video_files/2. Count & Meaning of Nodes.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Cycle in Graphs.mp4'] | 0 bytes |
| ['video_files/2. Cycle in Graphs.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Detecting Cycle Code.mp4'] | 0 bytes |
| ['video_files/2. Detecting Cycle Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Diameter of a Tree (Approach2).mp4'] | 0 bytes |
| ['video_files/2. Diameter of a Tree (Approach2).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Dry run- How Rectangle Pattern.mp4'] | 0 bytes |
| ['video_files/2. Dry run- How Rectangle Pattern.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Flowchart Components.mp4'] | 0 bytes |
| ['video_files/2. Flowchart Components.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. HashMap.mp4'] | 0 bytes |
| ['video_files/2. HashMap.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Head & Tail in LL.mp4'] | 0 bytes |
| ['video_files/2. Head & Tail in LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. InputOutput.mp4'] | 0 bytes |
| ['video_files/2. InputOutput.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Levels & Sub-trees in a Tree .mp4'] | 0 bytes |
| ['video_files/2. Levels & Sub-trees in a Tree .mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Longest Increasing Subsequence.mp4'] | 0 bytes |
| ['video_files/2. Longest Increasing Subsequence.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Lowest Common Ancestor (Approach1).mp4'] | 0 bytes |
| ['video_files/2. Lowest Common Ancestor (Approach1).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Matrix Chain Multiplication (Recursion).mp4'] | 0 bytes |
| ['video_files/2. Matrix Chain Multiplication (Recursion).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Operations on ArrayList.mp4'] | 0 bytes |
| ['video_files/2. Operations on ArrayList.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. PQ in JCF.mp4'] | 0 bytes |
| ['video_files/2. PQ in JCF.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Print Inverted Star Pattern.mp4.mp4'] | 0 bytes |
| ['video_files/2. Print Inverted Star Pattern.mp4.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Print The Largest Of 2 Numbers.mp4'] | 0 bytes |
| ['video_files/2. Print The Largest Of 2 Numbers.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Print numbers in decreasing order.mp4'] | 0 bytes |
| ['video_files/2. Print numbers in decreasing order.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Queues using Arrays.mp4'] | 0 bytes |
| ['video_files/2. Queues using Arrays.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Real Life Examples.mp4'] | 0 bytes |
| ['video_files/2. Real Life Examples.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Rod Cutting.mp4'] | 0 bytes |
| ['video_files/2. Rod Cutting.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Stack using ArrayList.mp4'] | 0 bytes |
| ['video_files/2. Stack using ArrayList.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Syntax-Function Code Demo.mp4'] | 0 bytes |
| ['video_files/2. Syntax-Function Code Demo.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Topological Sort using BFS (Code).mp4'] | 0 bytes |
| ['video_files/2. Topological Sort using BFS (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Types of Backtracking.mp4'] | 0 bytes |
| ['video_files/2. Types of Backtracking.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Types of Graphs (Based on Edge).mp4'] | 0 bytes |
| ['video_files/2. Types of Graphs (Based on Edge).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. What is DP (Definition).mp4'] | 0 bytes |
| ['video_files/2. What is DP (Definition).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. What is Time Complexity.mp4'] | 0 bytes |
| ['video_files/2. What is Time Complexity.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. What is a Trie.mp4'] | 0 bytes |
| ['video_files/2. What is a Trie.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. What will you learn_1.mp4'] | 0 bytes |
| ['video_files/2. What will you learn_1.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. While Loop.mp4'] | 0 bytes |
| ['video_files/2. While Loop.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/2. Wildcard Matching (Code).mp4'] | 0 bytes |
| ['video_files/2. Wildcard Matching (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/20. Abstract Classes.mp4'] | 0 bytes |
| ['video_files/20. Abstract Classes.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/20. Code - Decimal To Binary.mp4'] | 0 bytes |
| ['video_files/20. Code - Decimal To Binary.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/20. Fast Exponentiation Code.mp4'] | 0 bytes |
| ['video_files/20. Fast Exponentiation Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/20. Power Function II - Analysis.mp4'] | 0 bytes |
| ['video_files/20. Power Function II - Analysis.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/20. Subarray Sum Equal to K.mp4'] | 0 bytes |
| ['video_files/20. Subarray Sum Equal to K.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/21. Block Scope.mp4'] | 0 bytes |
| ['video_files/21. Block Scope.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/21. Interfaces.mp4'] | 0 bytes |
| ['video_files/21. Interfaces.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/21. Power Function III - Analysis.mp4'] | 0 bytes |
| ['video_files/21. Power Function III - Analysis.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/22. How to approach Coding Questions.mp4'] | 0 bytes |
| ['video_files/22. How to approach Coding Questions.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/22. Method Scope.mp4'] | 0 bytes |
| ['video_files/22. Method Scope.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/22. Static keyword.mp4'] | 0 bytes |
| ['video_files/22. Static keyword.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/23. Super keyword.mp4'] | 0 bytes |
| ['video_files/23. Super keyword.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/24. Solved Questions Practice.mp4'] | 0 bytes |
| ['video_files/24. Solved Questions Practice.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. 0-1 Knapsack (Memoization).mp4'] | 0 bytes |
| ['video_files/3. 0-1 Knapsack (Memoization).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Activity Selection Code.mp4'] | 0 bytes |
| ['video_files/3. Activity Selection Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Add First in LL.mp4'] | 0 bytes |
| ['video_files/3. Add First in LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. All Paths from Source to Target.mp4'] | 0 bytes |
| ['video_files/3. All Paths from Source to Target.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Arrays-Input,Output & Updates.mp4'] | 0 bytes |
| ['video_files/3. Arrays-Input,Output & Updates.mp4_thumb.jpg'] | 0 bytes |
| ["video_files/3. Articulation Point (Tarjan's Algorithm).mp4"] | 0 bytes |
| ["video_files/3. Articulation Point (Tarjan's Algorithm).mp4_thumb.jpg"] | 0 bytes |
| ['video_files/3. Backtracking on Arrays.mp4'] | 0 bytes |
| ['video_files/3. Backtracking on Arrays.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Bitwise Operators.mp4'] | 0 bytes |
| ['video_files/3. Bitwise Operators.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Bubble Sort Code.mp4'] | 0 bytes |
| ['video_files/3. Bubble Sort Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Build a BST.mp4'] | 0 bytes |
| ['video_files/3. Build a BST.mp4_thumb.jpg'] | 0 bytes |
| ["video_files/3. Catalan's Number (Recursion + Memoization).mp4"] | 0 bytes |
| ["video_files/3. Catalan's Number (Recursion + Memoization).mp4_thumb.jpg"] | 0 bytes |
| ['video_files/3. Circular Queue using Arrays.mp4'] | 0 bytes |
| ['video_files/3. Circular Queue using Arrays.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Connecting Cities.mp4'] | 0 bytes |
| ['video_files/3. Connecting Cities.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Constant Time Complexity.mp4'] | 0 bytes |
| ['video_files/3. Constant Time Complexity.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Creating a Trie.mp4'] | 0 bytes |
| ['video_files/3. Creating a Trie.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Creation of ST.mp4'] | 0 bytes |
| ['video_files/3. Creation of ST.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Cycle Detection (Undirected graphs) - DFS.mp4'] | 0 bytes |
| ['video_files/3. Cycle Detection (Undirected graphs) - DFS.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Edit Distance (Explanation).mp4'] | 0 bytes |
| ['video_files/3. Edit Distance (Explanation).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Getters & Setters.mp4'] | 0 bytes |
| ['video_files/3. Getters & Setters.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Graph Representations.mp4'] | 0 bytes |
| ['video_files/3. Graph Representations.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. HashMap Operations.mp4'] | 0 bytes |
| ['video_files/3. HashMap Operations.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Inverted And Rotated Half Pyramid.mp4'] | 0 bytes |
| ['video_files/3. Inverted And Rotated Half Pyramid.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Live Mentorship Session - 1 (with Shradha Didi).mp4'] | 0 bytes |
| ['video_files/3. Live Mentorship Session - 1 (with Shradha Didi).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Longest Common Subsequence (Recursion).mp4'] | 0 bytes |
| ['video_files/3. Longest Common Subsequence (Recursion).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Lowest Common Ancestor (Approach2).mp4'] | 0 bytes |
| ['video_files/3. Lowest Common Ancestor (Approach2).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. MCM (Memoization).mp4'] | 0 bytes |
| ['video_files/3. MCM (Memoization).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Merge Sort Code.mp4'] | 0 bytes |
| ['video_files/3. Merge Sort Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Output In Java.mp4'] | 0 bytes |
| ['video_files/3. Output In Java.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. PQ for Objects.mp4'] | 0 bytes |
| ['video_files/3. PQ for Objects.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Pop Quiz.mp4'] | 0 bytes |
| ['video_files/3. Pop Quiz.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Prerequisites_1.mp4'] | 0 bytes |
| ['video_files/3. Prerequisites_1.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Print Half-Pyramid Pattern.mp4'] | 0 bytes |
| ['video_files/3. Print Half-Pyramid Pattern.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Print If Number Is Odd Or Even.mp4'] | 0 bytes |
| ['video_files/3. Print If Number Is Odd Or Even.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Print Number From 1 To 10.mp4'] | 0 bytes |
| ['video_files/3. Print Number From 1 To 10.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Removing Cycle in LL.mp4'] | 0 bytes |
| ['video_files/3. Removing Cycle in LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Representation Of 2D Arrays.mp4'] | 0 bytes |
| ['video_files/3. Representation Of 2D Arrays.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Size of ArrayList.mp4'] | 0 bytes |
| ['video_files/3. Size of ArrayList.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Size of Largest BST in BT.mp4'] | 0 bytes |
| ['video_files/3. Size of Largest BST in BT.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Stack overflow video.mp4'] | 0 bytes |
| ['video_files/3. Stack overflow video.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Stack using Linked List.mp4'] | 0 bytes |
| ['video_files/3. Stack using Linked List.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. String Length.mp4'] | 0 bytes |
| ['video_files/3. String Length.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Subtree of another tree.mp4'] | 0 bytes |
| ['video_files/3. Subtree of another tree.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Sum of 2 Numbers.mp4'] | 0 bytes |
| ['video_files/3. Sum of 2 Numbers.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Syntax With Parameters.mp4'] | 0 bytes |
| ['video_files/3. Syntax With Parameters.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Unary Operators.mp4'] | 0 bytes |
| ['video_files/3. Unary Operators.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. Ways of DP.mp4'] | 0 bytes |
| ['video_files/3. Ways of DP.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/3. What is MST.mp4'] | 0 bytes |
| ['video_files/3. What is MST.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. 0-1 Knapsack (Tabulation).mp4'] | 0 bytes |
| ['video_files/4. 0-1 Knapsack (Tabulation).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. 7 Important Concepts.mp4'] | 0 bytes |
| ['video_files/4. 7 Important Concepts.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Activity Selection Explanation.mp4'] | 0 bytes |
| ['video_files/4. Activity Selection Explanation.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Add Last in LL.mp4'] | 0 bytes |
| ['video_files/4. Add Last in LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Arrays as Function Arguments.mp4'] | 0 bytes |
| ['video_files/4. Arrays as Function Arguments.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Big O Notation.mp4'] | 0 bytes |
| ['video_files/4. Big O Notation.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Binary AND.mp4'] | 0 bytes |
| ['video_files/4. Binary AND.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Bipartite Graph.mp4'] | 0 bytes |
| ['video_files/4. Bipartite Graph.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Build Tree Preorder.mp4'] | 0 bytes |
| ['video_files/4. Build Tree Preorder.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Calculate Simple Interest.mp4'] | 0 bytes |
| ['video_files/4. Calculate Simple Interest.mp4_thumb.jpg'] | 0 bytes |
| ["video_files/4. Catalan's Number (Tabulation).mp4"] | 0 bytes |
| ["video_files/4. Catalan's Number (Tabulation).mp4_thumb.jpg"] | 0 bytes |
| ['video_files/4. Connecting Cities (Code).mp4'] | 0 bytes |
| ['video_files/4. Connecting Cities (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Creation Of 2D Arrays.mp4'] | 0 bytes |
| ['video_files/4. Creation Of 2D Arrays.mp4_thumb.jpg'] | 0 bytes |
| ["video_files/4. Dijkstra's Algorithm.mp4"] | 0 bytes |
| ["video_files/4. Dijkstra's Algorithm.mp4_thumb.jpg"] | 0 bytes |
| ['video_files/4. Edit Distance (Code).mp4'] | 0 bytes |
| ['video_files/4. Edit Distance (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Else If.mp4'] | 0 bytes |
| ['video_files/4. Else If.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Encapsulation.mp4'] | 0 bytes |
| ['video_files/4. Encapsulation.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Find Subsets.mp4'] | 0 bytes |
| ['video_files/4. Find Subsets.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Graph Applications.mp4'] | 0 bytes |
| ['video_files/4. Graph Applications.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Insertion.mp4'] | 0 bytes |
| ['video_files/4. Insertion.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Introduction to Heaps.mp4'] | 0 bytes |
| ['video_files/4. Introduction to Heaps.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Inverted Half Pyramid Pattern with Numbers.mp4'] | 0 bytes |
| ['video_files/4. Inverted Half Pyramid Pattern with Numbers.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Iteration on HashMaps.mp4'] | 0 bytes |
| ['video_files/4. Iteration on HashMaps.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. LCS (Memoization).mp4'] | 0 bytes |
| ['video_files/4. LCS (Memoization).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Live Mentorship Session - 2 (with Shradha Didi).mp4'] | 0 bytes |
| ['video_files/4. Live Mentorship Session - 2 (with Shradha Didi).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. MCM (Tabulation).mp4'] | 0 bytes |
| ['video_files/4. MCM (Tabulation).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Minimum Distance between 2 Nodes.mp4'] | 0 bytes |
| ['video_files/4. Minimum Distance between 2 Nodes.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Parameters vs Arguments.mp4'] | 0 bytes |
| ['video_files/4. Parameters vs Arguments.mp4_thumb.jpg'] | 0 bytes |
| ["video_files/4. Prim's Algorithm.mp4"] | 0 bytes |
| ["video_files/4. Prim's Algorithm.mp4_thumb.jpg"] | 0 bytes |
| ['video_files/4. Print A Pattern.mp4'] | 0 bytes |
| ['video_files/4. Print A Pattern.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Print Character Pattern.mp4'] | 0 bytes |
| ['video_files/4. Print Character Pattern.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Print Number From 1 to n.mp4'] | 0 bytes |
| ['video_files/4. Print Number From 1 to n.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Print Reverse of an ArrayList.mp4'] | 0 bytes |
| ['video_files/4. Print Reverse of an ArrayList.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Print numbers in increasing order.mp4'] | 0 bytes |
| ['video_files/4. Print numbers in increasing order.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Queries on ST.mp4'] | 0 bytes |
| ['video_files/4. Queries on ST.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Queue using LL.mp4'] | 0 bytes |
| ['video_files/4. Queue using LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Quick Sort.mp4'] | 0 bytes |
| ['video_files/4. Quick Sort.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Relational Operators.mp4'] | 0 bytes |
| ['video_files/4. Relational Operators.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Removing Cycle Code.mp4'] | 0 bytes |
| ['video_files/4. Removing Cycle Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Search in a BST.mp4'] | 0 bytes |
| ['video_files/4. Search in a BST.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Selection Sort.mp4'] | 0 bytes |
| ['video_files/4. Selection Sort.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Size of Largest BST in BT (Code).mp4'] | 0 bytes |
| ['video_files/4. Size of Largest BST in BT (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Stack using Collections Framework.mp4'] | 0 bytes |
| ['video_files/4. Stack using Collections Framework.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. String Concatenation.mp4'] | 0 bytes |
| ['video_files/4. String Concatenation.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/4. Subtree of another tree Code.mp4'] | 0 bytes |
| ['video_files/4. Subtree of another tree Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. 2D Array In Memory.mp4'] | 0 bytes |
| ['video_files/5. 2D Array In Memory.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Big Omega & Theta Notation.mp4'] | 0 bytes |
| ['video_files/5. Big Omega & Theta Notation.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Binary OR.mp4'] | 0 bytes |
| ['video_files/5. Binary OR.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Build Tree Preorder Code.mp4'] | 0 bytes |
| ['video_files/5. Build Tree Preorder Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Climbing Stairs (Recursion).mp4'] | 0 bytes |
| ['video_files/5. Climbing Stairs (Recursion).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Constructors.mp4'] | 0 bytes |
| ['video_files/5. Constructors.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Count BSTs.mp4'] | 0 bytes |
| ['video_files/5. Count BSTs.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Creating a Graph (Adjacency List).mp4'] | 0 bytes |
| ['video_files/5. Creating a Graph (Adjacency List).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Cycle Detection (Directed graph) - DFS.mp4'] | 0 bytes |
| ['video_files/5. Cycle Detection (Directed graph) - DFS.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Delete a Node.mp4'] | 0 bytes |
| ['video_files/5. Delete a Node.mp4_thumb.jpg'] | 0 bytes |
| ["video_files/5. Dijkstra's Algorithm (Code).mp4"] | 0 bytes |
| ["video_files/5. Dijkstra's Algorithm (Code).mp4_thumb.jpg"] | 0 bytes |
| ['video_files/5. Disjoint Set Union.mp4'] | 0 bytes |
| ['video_files/5. Disjoint Set Union.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Find Factorial of N.mp4'] | 0 bytes |
| ['video_files/5. Find Factorial of N.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Find Maximum in an ArrayList.mp4'] | 0 bytes |
| ['video_files/5. Find Maximum in an ArrayList.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Find Subsets Code.mp4'] | 0 bytes |
| ['video_files/5. Find Subsets Code.mp4_thumb.jpg'] | 0 bytes |
| ["video_files/5. Floyd's Triangle Pattern.mp4"] | 0 bytes |
| ["video_files/5. Floyd's Triangle Pattern.mp4_thumb.jpg"] | 0 bytes |
| ['video_files/5. Fractional Knapsack.mp4'] | 0 bytes |
| ['video_files/5. Fractional Knapsack.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. HashMap Implementation.mp4'] | 0 bytes |
| ['video_files/5. HashMap Implementation.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Heap Implementation (using CBT).mp4'] | 0 bytes |
| ['video_files/5. Heap Implementation (using CBT).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Income Tax Calculator.mp4'] | 0 bytes |
| ['video_files/5. Income Tax Calculator.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Kth ancestor of Node.mp4'] | 0 bytes |
| ['video_files/5. Kth ancestor of Node.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. LCS (Tabulation).mp4'] | 0 bytes |
| ['video_files/5. LCS (Tabulation).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Linear Search.mp4'] | 0 bytes |
| ['video_files/5. Linear Search.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Live Mentorship Session - 3 (Resume).mp4'] | 0 bytes |
| ['video_files/5. Live Mentorship Session - 3 (Resume).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Logical Operators.mp4'] | 0 bytes |
| ['video_files/5. Logical Operators.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Max of 3 Numbers.mp4'] | 0 bytes |
| ['video_files/5. Max of 3 Numbers.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Merge 2 BSTs.mp4'] | 0 bytes |
| ['video_files/5. Merge 2 BSTs.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Minimum Partitioning.mp4'] | 0 bytes |
| ['video_files/5. Minimum Partitioning.mp4_thumb.jpg'] | 0 bytes |
| ["video_files/5. Prim's Code.mp4"] | 0 bytes |
| ["video_files/5. Prim's Code.mp4_thumb.jpg"] | 0 bytes |
| ['video_files/5. Print a LL.mp4'] | 0 bytes |
| ['video_files/5. Print a LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Push at Bottom of Stack.mp4'] | 0 bytes |
| ['video_files/5. Push at Bottom of Stack.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Queue using JCF.mp4'] | 0 bytes |
| ['video_files/5. Queue using JCF.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Quick Sort Code.mp4'] | 0 bytes |
| ['video_files/5. Quick Sort Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Removing Cycle Explanation (Math).mp4'] | 0 bytes |
| ['video_files/5. Removing Cycle Explanation (Math).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Searching.mp4'] | 0 bytes |
| ['video_files/5. Searching.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Selection Sort Code.mp4'] | 0 bytes |
| ['video_files/5. Selection Sort Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. String Conversion.mp4'] | 0 bytes |
| ['video_files/5. String Conversion.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. String char At Method.mp4'] | 0 bytes |
| ['video_files/5. String char At Method.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Sum Of First n Natural Numbers.mp4'] | 0 bytes |
| ['video_files/5. Sum Of First n Natural Numbers.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Target Sum Subset (Tabulation).mp4'] | 0 bytes |
| ['video_files/5. Target Sum Subset (Tabulation).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Top View of a Tree (Basics).mp4'] | 0 bytes |
| ['video_files/5. Top View of a Tree (Basics).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Update on ST.mp4'] | 0 bytes |
| ['video_files/5. Update on ST.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. Variables In Java.mp4'] | 0 bytes |
| ['video_files/5. Variables In Java.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/5. What Happens In Memory.mp4'] | 0 bytes |
| ['video_files/5. What Happens In Memory.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. (0-1) Triangle Pattern.mp4'] | 0 bytes |
| ['video_files/6. (0-1) Triangle Pattern.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. AVL Tress.mp4'] | 0 bytes |
| ['video_files/6. AVL Tress.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Add in the Middle of LL.mp4'] | 0 bytes |
| ['video_files/6. Add in the Middle of LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Assignment Operator.mp4'] | 0 bytes |
| ['video_files/6. Assignment Operator.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. BFS (Breadth First Search).mp4'] | 0 bytes |
| ['video_files/6. BFS (Breadth First Search).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Binary XOR.mp4'] | 0 bytes |
| ['video_files/6. Binary XOR.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Call By Value.mp4'] | 0 bytes |
| ['video_files/6. Call By Value.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Check If String Is Palindrome.mp4'] | 0 bytes |
| ['video_files/6. Check If String Is Palindrome.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Climbing Stairs (Memoization DP).mp4'] | 0 bytes |
| ['video_files/6. Climbing Stairs (Memoization DP).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Common Complexities.mp4'] | 0 bytes |
| ['video_files/6. Common Complexities.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Data Types In Java.mp4'] | 0 bytes |
| ['video_files/6. Data Types In Java.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Extra Read.mp4'] | 0 bytes |
| ['video_files/6. Extra Read.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Find Permutations.mp4'] | 0 bytes |
| ['video_files/6. Find Permutations.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Find if a Number is Prime or not.mp4'] | 0 bytes |
| ['video_files/6. Find if a Number is Prime or not.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. For Loops.mp4'] | 0 bytes |
| ['video_files/6. For Loops.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Fractional Knapsack Code.mp4'] | 0 bytes |
| ['video_files/6. Fractional Knapsack Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. HashMap Implementation Code.mp4'] | 0 bytes |
| ['video_files/6. HashMap Implementation Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Insert in Heap.mp4'] | 0 bytes |
| ['video_files/6. Insert in Heap.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Insertion Sort.mp4'] | 0 bytes |
| ['video_files/6. Insertion Sort.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Java Collections Framework.mp4'] | 0 bytes |
| ['video_files/6. Java Collections Framework.mp4_thumb.jpg'] | 0 bytes |
| ["video_files/6. Kruskal's Algorithm.mp4"] | 0 bytes |
| ["video_files/6. Kruskal's Algorithm.mp4_thumb.jpg"] | 0 bytes |
| ['video_files/6. Largest in array.mp4'] | 0 bytes |
| ['video_files/6. Largest in array.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Live Mentorships Session - 4 (Theory Topics).mp4'] | 0 bytes |
| ['video_files/6. Live Mentorships Session - 4 (Theory Topics).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Max-Min Segment Tree (Creation).mp4'] | 0 bytes |
| ['video_files/6. Max-Min Segment Tree (Creation).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Minimum Array Jumps (Explanation).mp4'] | 0 bytes |
| ['video_files/6. Minimum Array Jumps (Explanation).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Mountain Ranges.mp4'] | 0 bytes |
| ['video_files/6. Mountain Ranges.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Preorder Traversal.mp4'] | 0 bytes |
| ['video_files/6. Preorder Traversal.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Print The Largest Of 3 Numbers.mp4'] | 0 bytes |
| ['video_files/6. Print The Largest Of 3 Numbers.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Print in Range.mp4'] | 0 bytes |
| ['video_files/6. Print in Range.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Print sum of N natural numbers.mp4'] | 0 bytes |
| ['video_files/6. Print sum of N natural numbers.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Queue using Two Stacks.mp4'] | 0 bytes |
| ['video_files/6. Queue using Two Stacks.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Reverse a String using a Stack.mp4'] | 0 bytes |
| ['video_files/6. Reverse a String using a Stack.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Special Note.mp4'] | 0 bytes |
| ['video_files/6. Special Note.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Spiral Matrix.mp4'] | 0 bytes |
| ['video_files/6. Spiral Matrix.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Swap 2 Numbers.mp4'] | 0 bytes |
| ['video_files/6. Swap 2 Numbers.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Target Sum Subset (Code).mp4'] | 0 bytes |
| ['video_files/6. Target Sum Subset (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Top View of a Tree (Approach).mp4'] | 0 bytes |
| ['video_files/6. Top View of a Tree (Approach).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Transform to Sum Tree.mp4'] | 0 bytes |
| ['video_files/6. Transform to Sum Tree.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Type of Constructors .mp4'] | 0 bytes |
| ['video_files/6. Type of Constructors .mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Word Break Problem.mp4'] | 0 bytes |
| ['video_files/6. Word Break Problem.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/6. Worst Case in Quick Sort.mp4'] | 0 bytes |
| ['video_files/6. Worst Case in Quick Sort.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Binary Search.mp4'] | 0 bytes |
| ['video_files/7. Binary Search.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Butterfly Patter.mp4'] | 0 bytes |
| ['video_files/7. Butterfly Patter.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Climbing Stairs Variation.mp4'] | 0 bytes |
| ['video_files/7. Climbing Stairs Variation.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Copy Constructor .mp4'] | 0 bytes |
| ['video_files/7. Copy Constructor .mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. DFS (Depth First Search).mp4'] | 0 bytes |
| ['video_files/7. DFS (Depth First Search).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Find Permutations Code.mp4'] | 0 bytes |
| ['video_files/7. Find Permutations Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Flood Fill Algorithm.mp4'] | 0 bytes |
| ['video_files/7. Flood Fill Algorithm.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Inorder Traversal.mp4'] | 0 bytes |
| ['video_files/7. Inorder Traversal.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Insertion Sort Code.mp4'] | 0 bytes |
| ['video_files/7. Insertion Sort Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. LL in Collections Framework.mp4'] | 0 bytes |
| ['video_files/7. LL in Collections Framework.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Live Mentorship Session - 5 (Off-campus Placements).mp4'] | 0 bytes |
| ['video_files/7. Live Mentorship Session - 5 (Off-campus Placements).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Max-Min Segment Tree (Query-Update).mp4'] | 0 bytes |
| ['video_files/7. Max-Min Segment Tree (Query-Update).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Minimum Array Jumps (Code).mp4'] | 0 bytes |
| ['video_files/7. Minimum Array Jumps (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Minimum Sum absolute difference pairs.mp4'] | 0 bytes |
| ['video_files/7. Minimum Sum absolute difference pairs.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Peek From Heap.mp4'] | 0 bytes |
| ['video_files/7. Peek From Heap.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Prefix Problem.mp4'] | 0 bytes |
| ['video_files/7. Prefix Problem.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Print Square Pattern.mp4'] | 0 bytes |
| ['video_files/7. Print Square Pattern.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Product Of a & b_.mp4'] | 0 bytes |
| ['video_files/7. Product Of a & b_.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Question - Shortest Path.mp4'] | 0 bytes |
| ['video_files/7. Question - Shortest Path.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Reverse a Stack.mp4'] | 0 bytes |
| ['video_files/7. Reverse a Stack.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Root to Leaf Path.mp4'] | 0 bytes |
| ['video_files/7. Root to Leaf Path.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Size of a LL.mp4'] | 0 bytes |
| ['video_files/7. Size of a LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Sorted & Rotated Array Search.mp4'] | 0 bytes |
| ['video_files/7. Sorted & Rotated Array Search.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Sorting an ArrayList.mp4'] | 0 bytes |
| ['video_files/7. Sorting an ArrayList.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Space Complexity.mp4'] | 0 bytes |
| ['video_files/7. Space Complexity.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Special Note.mp4'] | 0 bytes |
| ['video_files/7. Special Note.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Spiral Matrix Code.mp4'] | 0 bytes |
| ['video_files/7. Spiral Matrix Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Stack using 2 Queues.mp4'] | 0 bytes |
| ['video_files/7. Stack using 2 Queues.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Sum of first N natural numbers.mp4'] | 0 bytes |
| ['video_files/7. Sum of first N natural numbers.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Sun Of a & b.mp4'] | 0 bytes |
| ['video_files/7. Sun Of a & b.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Ternary Operators.mp4'] | 0 bytes |
| ['video_files/7. Ternary Operators.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Top View of a Tree (Code).mp4'] | 0 bytes |
| ['video_files/7. Top View of a Tree (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Topological Sorting (using DFS).mp4'] | 0 bytes |
| ['video_files/7. Topological Sorting (using DFS).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/7. Unbounded Knapsack (Tabulation).mp4'] | 0 bytes |
| ['video_files/7. Unbounded Knapsack (Tabulation).mp4_thumb.jpg'] | 0 bytes |
| ["video_files/7.. Binary 1's Complement.mp4"] | 0 bytes |
| ["video_files/7.. Binary 1's Complement.mp4_thumb.jpg"] | 0 bytes |
| ['video_files/7.Print Nth Fibonacci number.mp4'] | 0 bytes |
| ['video_files/7.Print Nth Fibonacci number.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. ArrayList (Implementation in Java).mp4'] | 0 bytes |
| ['video_files/8. ArrayList (Implementation in Java).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Binary Left Shift.mp4'] | 0 bytes |
| ['video_files/8. Binary Left Shift.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Binary Search Code.mp4'] | 0 bytes |
| ['video_files/8. Binary Search Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. COMMENTS IN JAVA.mp4'] | 0 bytes |
| ['video_files/8. COMMENTS IN JAVA.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Check If A Student Is Pass Or Fail.mp4'] | 0 bytes |
| ['video_files/8. Check If A Student Is Pass Or Fail.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Climbing Stairs (Tabulation DP).mp4'] | 0 bytes |
| ['video_files/8. Climbing Stairs (Tabulation DP).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Copy Constructor.mp4'] | 0 bytes |
| ['video_files/8. Copy Constructor.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Diagonal Sum.mp4'] | 0 bytes |
| ['video_files/8. Find Factorial.mp4'] | 0 bytes |
| ['video_files/8. Find Factorial.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. First Non-Repeating Letter.mp4'] | 0 bytes |
| ['video_files/8. First Non-Repeating Letter.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Has Path (Using DFS).mp4'] | 0 bytes |
| ['video_files/8. Has Path (Using DFS).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Inbuilt sort.mp4'] | 0 bytes |
| ['video_files/8. Inbuilt sort.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Linked HashMap.mp4'] | 0 bytes |
| ['video_files/8. Linked HashMap.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Live Mentorship Session (on Linkedin).mp4'] | 0 bytes |
| ['video_files/8. Live Mentorship Session (on Linkedin).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Maximum length chain of pairs.mp4'] | 0 bytes |
| ['video_files/8. Maximum length chain of pairs.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Merge Sort on LL.mp4'] | 0 bytes |
| ['video_files/8. Merge Sort on LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. N Queens - all ways.mp4'] | 0 bytes |
| ['video_files/8. N Queens - all ways.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Postorder Traversal.mp4'] | 0 bytes |
| ['video_files/8. Postorder Traversal.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Print Reverse Of A Number.mp4'] | 0 bytes |
| ['video_files/8. Print Reverse Of A Number.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Remove First in LL.mp4'] | 0 bytes |
| ['video_files/8. Remove First in LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Remove from Heap.mp4'] | 0 bytes |
| ['video_files/8. Remove from Heap.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Simple Loop Analysis.mp4'] | 0 bytes |
| ['video_files/8. Simple Loop Analysis.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Solid Rhombus Pattern.mp4'] | 0 bytes |
| ['video_files/8. Solid Rhombus Pattern.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Sorted & Rotated Array Code.mp4'] | 0 bytes |
| ['video_files/8. Sorted & Rotated Array Code.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Starts With Problem.mp4'] | 0 bytes |
| ['video_files/8. Starts With Problem.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Stock Span Problem.mp4'] | 0 bytes |
| ['video_files/8. Stock Span Problem.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. String Function - Compare.mp4'] | 0 bytes |
| ['video_files/8. String Function - Compare.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8. Validate BST.mp4'] | 0 bytes |
| ['video_files/8. Validate BST.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/8.Check if array is sorted or not.mp4'] | 0 bytes |
| ['video_files/8.Check if array is sorted or not.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9 - Binary Right Shift.mp4'] | 0 bytes |
| ['video_files/9 - Binary Right Shift.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Counting Sort.mp4'] | 0 bytes |
| ['video_files/9. Counting Sort.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Destructors.mp4'] | 0 bytes |
| ['video_files/9. Destructors.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Find Binomial Coefficent.mp4'] | 0 bytes |
| ['video_files/9. Find Binomial Coefficent.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Heap Sort.mp4'] | 0 bytes |
| ['video_files/9. Heap Sort.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Hollow Rhombus Pattern.mp4'] | 0 bytes |
| ['video_files/9. Hollow Rhombus Pattern.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Indian Coins.mp4'] | 0 bytes |
| ['video_files/9. Indian Coins.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Input In Java.mp4'] | 0 bytes |
| ['video_files/9. Input In Java.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Interleave two halves of a Queue.mp4'] | 0 bytes |
| ['video_files/9. Interleave two halves of a Queue.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Level order Traversal.mp4'] | 0 bytes |
| ['video_files/9. Level order Traversal.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Live Mentorship Session - 7 (Interview Prep).mp4'] | 0 bytes |
| ['video_files/9. Live Mentorship Session - 7 (Interview Prep).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Merge Sort on LL (Code).mp4'] | 0 bytes |
| ['video_files/9. Merge Sort on LL (Code).mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Mirror a BST.mp4'] | 0 bytes |
| ['video_files/9. Mirror a BST.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Multi-dimensional ArrayLists.mp4'] | 0 bytes |
| ['video_files/9. Multi-dimensional ArrayLists.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. N Queens - Time Complexity.mp4'] | 0 bytes |
| ['video_files/9. N Queens - Time Complexity.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Nested Loop 1 Analysis.mp4'] | 0 bytes |
| ['video_files/9. Nested Loop 1 Analysis.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Next greater element.mp4'] | 0 bytes |
| ['video_files/9. Next greater element.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Remove Last in LL.mp4'] | 0 bytes |
| ['video_files/9. Remove Last in LL.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Reverse In Array.mp4'] | 0 bytes |
| ['video_files/9. Reverse In Array.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Reverse The Given Number.mp4'] | 0 bytes |
| ['video_files/9. Reverse The Given Number.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Search In Sorted Matrix.mp4'] | 0 bytes |
| ['video_files/9. Search In Sorted Matrix.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Switch Statement.mp4'] | 0 bytes |
| ['video_files/9. Switch Statement.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. TreeMap.mp4'] | 0 bytes |
| ['video_files/9. TreeMap.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9. Unique Substrings.mp4'] | 0 bytes |
| ['video_files/9. Unique Substrings.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9.First Occurrence.mp4'] | 0 bytes |
| ['video_files/9.First Occurrence.mp4_thumb.jpg'] | 0 bytes |
| ['video_files/9.String Function - Substring .mp4'] | 0 bytes |
| ['video_files/9.String Function - Substring .mp4_thumb.jpg'] | 0 bytes |
| ['video_files/Bonus LIVE Class.mp4'] | 0 bytes |
| ['video_files/Bonus LIVE Class.mp4_thumb.jpg'] | 0 bytes |
| ['Curriculum Easy Navigation.html'] | 0 bytes |
| ['favicon.webp'] | 0 bytes |
| ['logo.png'] | 0 bytes |
Name
DL
Uploader
Size
S/L
Added
NOTE
SOURCE: [Apna College] Alpha Batch 5.0 | Complete Placement Course
-----------------------------------------------------------------------------------
COVER
-----------------------------------------------------------------------------------
MEDIAINFO
[Apna College] Alpha Batch 5.0 | Complete Placement Course Master coding, DSA, and placement skills with Apna College Alpha Batch 5.0. > Become placement-ready in just 3.5 months. > Learn from industry experts through structured videos and live mentorship. > Join thousands who've landed jobs in top-tier companies. > Official website: `apnacollege.in/course/alpha-batch-5` --- # 1,339 files (25.4 GB) comprehensive material included
×