- 109
- 288 327
Programming with Sikander
India
Приєднався 12 жов 2012
Python Sort vs Sorted
In Python, sort() is a list method that sorts the list in place and returns None, modifying the original list. In contrast, sorted() is a built-in function that works on any iterable and returns a new sorted list, leaving the original data unchanged. Use sort() when you want to modify a list directly and sorted() when you need a sorted copy without altering the original.
Переглядів: 32
Відео
Python Map function
Переглядів 2328 днів тому
The map function in Python applies a specified function to each item in an iterable (like a list or tuple) and returns a map object (an iterator). It is useful for performing transformations or calculations on data without using explicit loops.
Tuple in Python
Переглядів 4128 днів тому
Discover the power of tuples in Python! In this video, we’ll explore what tuples are, how they differ from lists, and why they are perfect for storing immutable data. Learn how to create, access, and manipulate tuples with practical examples. Whether you’re a beginner or brushing up your Python skills, this video has got you covered.
Mettl Platform Demo
Переглядів 2,2 тис.11 місяців тому
Mettl Assessment Tool is a comprehensive platform designed for conducting skill assessments and talent measurement. It offers a wide range of customizable tests and evaluations to help businesses and educational institutions make informed decisions about hiring, training, and development. With its user-friendly interface and advanced analytics, Mettl enables efficient and objective evaluation o...
C++ interview Question | Template instantiation
Переглядів 245Рік тому
Templates allow you to write generic code that can work with different types without specifying them beforehand. Template instantiation occurs when the compiler generates actual code for a template with specific template arguments. Template instantiation allows you to write generic code that can be reused with different types while benefiting from type safety and avoiding code duplication.
LinkedList | Merge two Sorted List
Переглядів 328Рік тому
A linked list is a data structure used to store and manage collections of data. It is a linear data structure, meaning that the elements in a linked list are stored in a sequence, and each element is called a node. Unlike arrays, linked lists do not store their elements in contiguous memory locations; instead, they use pointers or references to connect the nodes. Given pointers to the heads of ...
Hackerrank | Data Structure | Compare Linked List
Переглядів 135Рік тому
In this video lecture, we will discuss how to compare two Linked List. www.hackerrank.com/challenges/compare-two-linked-lists/problem #datastructures #linkedlists #hackerrank
Reverse Order of Words | C++
Переглядів 145Рік тому
In this video lecture we will discuss how to reverse the order of words. The problem is solved using Stack Data Structure of C STL. The same problem is also solved using Python in this video: ua-cam.com/video/sYe6OUPWgu4/v-deo.html Code Link: onlinegdb.com/7xcwtn1sDd #interviewquestions #datastructures #strings
Interview Question | Data Structure | Print words of string in reverse order
Переглядів 115Рік тому
In this video lecture we will discuss how to reverse the order of words. The problem is solved using two methods. 1. Splitting string into words and print the elements of List in reverse order using reversed function. 2. Using Stack Data Structure. Code Link: onlinegdb.com/U_UgRbVBvZ #interviewquestions #pythonprogramming #pythoninterviewquestions #programmingwithpython #datastructures #strings
Interview Question | C++ | Reverse individual words in a String using Stack
Переглядів 122Рік тому
In this video lecture we are solving an Interview Question based on Stack Data Structure. Given a string of multi-word, we need to reverse individual words of the string. This problem is solved using C STL std::stack. #interviewquestions #datastructures #stack #cppprogramming #stl
Interview Questions | Reverse Individual words of String
Переглядів 88Рік тому
In this video lecture we will discuss how to reverse individual words of a given string. The problem is solved using two methods. 1. Splitting string into words and reversing individual words 2. Using Stack Data Structure. Code Link: onlinegdb.com/_hoWnMdnW #interviewquestions #pythonprogramming #pythoninterviewquestions #programmingwithpython
Hackerrank | Data Structure | LinkedList | Print in Reverse
Переглядів 106Рік тому
In this video lecture we have discussed how to print the elements of Linked List in Reverse Order. It is implemented using recursion. It is visually demonstrated using PythonTutor.org. www.hackerrank.com/challenges/print-the-elements-of-a-linked-list-in-reverse/problem?isFullScreen=false Link to Code: onlinegdb.com/l7kfc5xRgj #hackerrank #hackerranksolutions #datastructures #linkedlists #cprogr...
HackerRank | LinkedList | Reverse a List
Переглядів 116Рік тому
In this video lecture we are learning about reverse the Linked List. leetcode.com/problems/reverse-linked-list/description/ www.hackerrank.com/challenges/reverse-a-linked-list/problem. Code: onlinegdb.com/DFJN6rZ5d #datastructures #linkedlists #hackerrank #leetcode #hackerranksolutions
HackerRank | Data Structures | Delete a node
Переглядів 256Рік тому
In this video, I have explained on how to solve "Delete a node" at a specific position in a linked list using loops and simple logic in C. This hackerrank problem is a part of Problem Solving | Practice | Data Structures | Linked Lists | Delete a Node. www.hackerrank.com/challenges/delete-a-node-from-a-linked-list/problem Link to Code : onlinegdb.com/WfYbqUvwN
HackerRank | Data Structures | Insert a node at Specific Position in a Linked List.
Переглядів 184Рік тому
In this video, I have explained on how to solve insert a node at a specific position in a linked list using loops and simple logic in C. This hackerrank problem is a part of Problem Solving | Practice | Data Structures | Linked Lists | Insert a node at a specific position in a linked list and solved in C. The complexity of this solution is O (n). Assumptions: a. The dynamically allocated memory...
Hackerrank | Data Structures | Insert a Node at the Tail of a Linked List
Переглядів 177Рік тому
Hackerrank | Data Structures | Insert a Node at the Tail of a Linked List
HackerRank | Data Strucutre | Insert a node at the head of a link
Переглядів 202Рік тому
HackerRank | Data Strucutre | Insert a node at the head of a link
Hackerrank | Left Rotate | One line solution in Python
Переглядів 234Рік тому
Hackerrank | Left Rotate | One line solution in Python
Hackerrank | Python | Find the Runner-Up Score
Переглядів 877Рік тому
Hackerrank | Python | Find the Runner-Up Score
Hackerrank | Python | Designer Door mat
Переглядів 700Рік тому
Hackerrank | Python | Designer Door mat
Data Analysis using Pandas || concatenate DataFrames
Переглядів 126Рік тому
Data Analysis using Pandas || concatenate DataFrames
Accessing Elements of vector using operator [] and at().
Переглядів 231Рік тому
Accessing Elements of vector using operator [] and at().
Search for a character in a string using strchr, strrchr
Переглядів 446Рік тому
Search for a character in a string using strchr, strrchr
C Interview Question: Difference between memcpy and strcpy
Переглядів 346Рік тому
C Interview Question: Difference between memcpy and strcpy
Do we have hidden tests cases like after submitting the code??
Hii Sikander sir . In your batch there no update after final exam sir if you have any update regarding that sir
@@gnaneswarthirakala9250 even I do not have any update.
Nice sir ❤
ty
Thankyou sir Great explanation it's very much useful to quick learning 👏👏👏
Straight up, very clean and easy to understand tutorial! Great explanation!
nice explanation sir ❤
Keep up the great work, sir! Your dedication deserves more support and a growing community of subscribers...💌
Thanks, I appreciate the support!
Awesome explanation sir
Great expectation sir 👏👏
Great explanation sir 👏👏
Happy to help!
Sir your explanation of the program was very clear and concise
A very good explanation sir...💌Thank You
Good explanation
Nice video, What is the purpose of having int main() and return 0 in the bare metal environment?
I love this video
Thank you, great explanation, it was very clear
Thank you
Sir, the problem is the amount of elements in the list doesn't follow the value of n. So if i put 5 to n, i can still simply add elements more than 5 index
which language is this? ,plz converted to c or java or python
It's C language.
but i can't due this @@programmingwithsikander3539
Best video I’ve watched for this topic
Which application extension sir
Thank you so much. Given a lot of information and explanations is mind-blowing!.
Thanks
Welcome
How to execute this without using center?
I got rejected from an interview because of this. Really, just scratching the surface won't make you good at anything.
LIFE SAVER , SIR!!✨
This video was great at explaining tokenization concepts! I’ve been struggling putting it into my head, but this helped a lot!
Glad it was helpful!
Excellent video, Now I understood why we need to pass NULL for successive calls to strtok.
3:00 Stat with this time line
Amazing! Please keep adding more videos! Kudos to your hardwork in helping the community.
Thank you for simplified step by step explanation and demonstration of Solution to Hackerrank problem.. Looking forward for more such videos..🙏
Glad you liked it. Surely will upload more videos
❤nice explanation
Thank you 🙂
Amazing, it was so helpful!
Excellent video…. Pls upload more on C programmings hidden or underrated concepts. Thanks
Nice video sir . Thank you !
Most welcome. If you come across any questions, share it with me as a comment. I will try to explain that through video
sir do matrix related videos plz
Promo`SM
Hi sir
Hi somashekaraya
@@programmingwithsikander3539 sir how to improve the python
I learned new thing
Nice 👍
It's nice videos, It's helping us to upgrade, Thank you
Thank you so much
Thank you for sharing these basics but most important topics with visual explanations
Useful, tq
Nice way to get memories leakage message, nice