• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

strtok()

March 21, 2014 by Dhaval Dave

Function Strtok

char * strtok ( char * str, const char * delimiters );
What it does : Split string into tokens
A sequence of calls to this function split str into tokens,
which are sequences of contiguous characters separated by any of
the characters that are part of delimiters

Example

/* strtok example */


int main ()
{
  char str[] ="This-is Go,Hired Site.";
  char * pch;
  printf ("Splitting string "%s" into tokens:n",str);
  printf ("--------");
  pch = strtok (str," ,.-"); // ',' '.' and '-' will be removed
  while (pch != NULL)
  {
    printf ("%sn",pch);
    pch = strtok (NULL, " ,.-");
  }
  return 0;
}
Output:
Splitting string “This-is Go,Hired Site.” into tokens:
——–
This is Go Hired Site

Similar Articles

Filed Under: problem Tagged With: Array, string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Binary Tree in Java

VMWare SDEII Interview

Maximum occurred Smallest integer in n ranges

Handle duplicates in Binary Search Tree

SAP Interview Questions

LeetCode: Binary Tree Maximum Path Sum

Check Binary Tree is Binary Search Tree or not

Coin Collection Dynamic Programming

Find the element that appears once others appears thrice

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Regular Expression Matching

SAP Off Campus Hiring_ March 2015 Computer Skills

ADOBE Aptitude C Language Test

Minimum insertions to form a palindrome

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Microsoft BING Interview Experience

Count Possible Decodings of a given Digit Sequence

Hackerearth : Counting Subarrays

C++ OOPs Part1

The Magic HackerEarth Nirvana solutions Hiring Challenge

Get Minimum element in O(1) from input numbers or Stack

Binary Tree Isomorphic to each other

Given a string, find the first character which is non-repetitive

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Leetcode: Edit Distance

Maximum difference between two elements s.t larger element appears after the smaller number

Check if an array has duplicate numbers in O(n) time and O(1) space

Convert number to words java

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Copyright © 2025 · Genesis Framework · WordPress · Log in